.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Kernel method
metric learning
nearest neighbor (NN)
polynomial kernel
support vector machine (SVM)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions基于拓扑保持多个半监督假设的半监督度量学习.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容