We propose a new method for local metric learning based on a conical combination of Mahalanobis metrics and pair-wise similarities between the data. Its formulation allows for controlling the rank of the metrics\u27 weight matrices. We also offer a convergent algorithm for training the associated model. Experimental results on a collection of classification problems imply that the new method may offer notable performance advantages over alternative metric learning approaches that have recently appeared in the literature. © 2013 Springer-Verlag
Metric learning has become a critical tool in many machine learning tasks. This paper focuses on lea...
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for ...
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for ...
We propose a new method for local metric learning based on a conical combination of Mahalanobis metr...
We study the problem of learning local metrics for nearest neighbor classification. Most previous wo...
The need for appropriate ways to measure the distance or similarity between data is ubiquitous in ma...
Many algorithms rely critically on being given a good metric over their inputs. For instance, data ...
For many machine learning algorithms such as k-nearest neighbor ( k-NN) classifiers and k-means clus...
textA large number of machine learning algorithms are critically dependent on the underlying distanc...
For many machine learning algorithms such as k-nearest neighbor ( k-NN) classifiers and k-means clus...
Abstract—Many researches have been devoted to learn a Mahalanobis distance metric, which can effecti...
Recent studies [1]-[5] have suggested using constraints in the form of relative distance comparisons...
The performance of distance-based classifiers heavily depends on the underlying distance metric, so ...
Introduction. The concepts of similarity, distance or metric are central to a many well-known and po...
In this paper, we present a novel two-stage metric learning algorithm. We first map each learning in...
Metric learning has become a critical tool in many machine learning tasks. This paper focuses on lea...
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for ...
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for ...
We propose a new method for local metric learning based on a conical combination of Mahalanobis metr...
We study the problem of learning local metrics for nearest neighbor classification. Most previous wo...
The need for appropriate ways to measure the distance or similarity between data is ubiquitous in ma...
Many algorithms rely critically on being given a good metric over their inputs. For instance, data ...
For many machine learning algorithms such as k-nearest neighbor ( k-NN) classifiers and k-means clus...
textA large number of machine learning algorithms are critically dependent on the underlying distanc...
For many machine learning algorithms such as k-nearest neighbor ( k-NN) classifiers and k-means clus...
Abstract—Many researches have been devoted to learn a Mahalanobis distance metric, which can effecti...
Recent studies [1]-[5] have suggested using constraints in the form of relative distance comparisons...
The performance of distance-based classifiers heavily depends on the underlying distance metric, so ...
Introduction. The concepts of similarity, distance or metric are central to a many well-known and po...
In this paper, we present a novel two-stage metric learning algorithm. We first map each learning in...
Metric learning has become a critical tool in many machine learning tasks. This paper focuses on lea...
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for ...
A distance metric that can accurately reflect the intrinsic characteristics of data is critical for ...