Please use this identifier to cite or link to this item:
Title: A kernel classification framework for metric learning
Authors: Wang, F
Zuo, W
Zhang, L 
Meng, D
Zhang, D 
Keywords: Kernel method
Metric learning
Nearest neighbor (NN)
Polynomial kernel
Support vector machine (SVM).
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on neural networks and learning systems, 2015, v. 26, no. 9, 6932476, p. 1950-1962 How to cite?
Journal: IEEE transactions on neural networks and learning systems 
Abstract: 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 (LMNN) and information theoretic metric learning (ITML), 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 LMNN and ITML. The proposed framework can also suggest new metric learning methods, which can be efficiently implemented, interestingly, using the standard support vector machine (SVM) 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.
ISSN: 2162-237X
EISSN: 2162-2388
DOI: 10.1109/TNNLS.2014.2361142
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 13, 2017

Page view(s)

Last Week
Last month
Checked on Aug 13, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.