22 search results - page 1 / 5 » Learning Weighted Metrics to Minimize Nearest-Neighbor Class... |
PAMI
2006
13 years 4 months ago
2006
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
VLSISP
2010
13 years 2 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
JMLR
2010
12 years 11 months ago
2010
In this paper we learn a dissimilarity measure for categorical data, for effective classification of the data points. Each categorical feature (with values taken from a finite set...