2009 · 63 citations · 22 references
ComputingComputer ScienceMathematicsData MiningMachine LearningOptimizationClassificationConvex AnalysisKernel MethodsOptimization For Machine LearningOverfittingPattern RecognitionConic ProgrammingReproducing Kernel Hilbert SpacesSimilarity LearningSimilarity MatricesSimilarity-based Learning
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similarities. These indefinite kernels can be problematic for standard kernel-based algorithms as the optimization problems become non-convex and the underlying theory is invalidated. In order to adapt kernel methods for similarity-based learning, we introduce a method that aims to simultaneously find a reproducing kernel Hilbert space based on the given similarities and train a classifier with good generalization in that space. The method is formulated as a convex optimization problem. We propose a simplified version that can reduce overfitting and whose associated convex conic program can be solved efficiently. We compare the proposed simplified version with six other methods on a collection of real data sets.
22
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
Maurice Sion · Pacific Journal of Mathematics · 1958 · 1.9K citations · Full text
Craig Stanfill, David L. Waltz · Communications of the ACM · 1986 · 1.2K citations