2003 · 600 citations · 8 references
ComputingComputer ScienceData ScienceComputational LinguisticsData MiningMachine LearningKernel MethodsMetric LearningSupport Vector MachinesText MiningText Similarity AnalysisConstraintsConvex Quadratic ProgrammingDistance Metric LearningDocument SimilarityMetric Learning For ClassificationRelative ComparisonSimilarity LearningSupport Vector Classification
This paper presents a method for learning a distance metric from rel-ative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach, we develop an algorithm that provides a flexible way of describing qualitative training data as a set of constraints. We show that such constraints lead to a convex quadratic programming problem that can be solved by adapting standard meth-ods for SVM training. We empirically evaluate the performance and the modelling flexibility of the algorithm on a collection of text documents. 1
8
Corinna Cortes, Vladimir Vapnik · Machine Learning · 1995 · 33K citations · Full text
Yuhai Wu, Vladimir Vapnik · Technometrics · 1999 · 27K citations
Indexing by latent semantic analysis
Scott Deerwester, Susan Dumais, George W. Furnas et al. · Journal of the American Society for Information Science · 1990 · 12.8K citations
Optimizing search engines using clickthrough data
Thorsten Joachims · 2002 · 3.9K citations
Distance Metric Learning with Application to Clustering with Side-Information
Eric P. Xing, Michael I. Jordan, Stuart Russell et al. · 2002 · 2.7K citations