TL;DR本篇论文提出一种新的核函数以及一种新的编辑相似性模型,可以更好地优化距离和相似度函数,提高 k 近邻算法的性能,并在学习相似性时考虑到泛化能力与算法的稳定性, 解决了当前度量学习方法的局限性,为特征向量和结构化对象(如字符串或树)的度量学习提供了新方法。
Abstract
The crucial importance of metrics in machine learning algorithms has led to
an increasing interest in optimizing distance and similarity functions, an area
of research known as metric learning. When data consist of feature vectors, a
large body of work has focused on learning a Mahalan