.png){kind=icon}
.png){kind=icon}
Return
A Kernel Classification Framework for Metric Learning
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2014.2361142.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Learning a distance metric from the given training samples plays a crucial role in many machine learning tasks, and various models and optimization algorithms have been proposed in the past decade. In this paper, we generalize several state-of-the-art metric learning methods, such as large margin nearest neighbor (LNINN) and information theoretic metric learning (ITNII,), into a kernel classification framework. First, doublets and triplets are constructed from the training samples, and a family of degree-2 polynomial kernel functions is proposed for pairs of doublets or triplets. Then, a kernel classification framework is established to generalize many popular metric learning methods such as LNINN and ITML. The proposed framework can also suggest new metric learning methods, which can he efficiently implemented, interestingly, using the standard support vector machine (SVNI) solvers. Two novel metric learning methods, namely, doublet-SVM and triplet-SVM, are then developed under the proposed framework. Experimental results show that doublet-SVM and triplet-SVM achieve competitive classification accuracies with state-of-the-art metric learning methods but with significantly less training time.
Keywords:
Kernel method
metric learning
nearest neighbor (NN)
polynomial kernel
support vector machine (SVM)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W