Skip to main page content
Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2006 Jul;28(7):1100-10.
doi: 10.1109/TPAMI.2006.145.

Learning Weighted Metrics to Minimize Nearest-Neighbor Classification Error

Affiliations

Learning Weighted Metrics to Minimize Nearest-Neighbor Classification Error

Roberto Paredes et al. IEEE Trans Pattern Anal Mach Intell. .

Abstract

In order to optimize the accuracy of the Nearest-Neighbor classification rule, a weighted distance is proposed, along with algorithms to automatically learn the corresponding weights. These weights may be specific for each class and feature, for each individual prototype, or for both. The learning algorithms are derived by (approximately) minimizing the Leaving-One-Out classification error of the given training set. The proposed approach is assessed through a series of experiments with UCI/STATLOG corpora, as well as with a more specific task of text classification which entails very sparse data representation and huge dimensionality. In all these experiments, the proposed approach shows a uniformly good behavior, with results comparable to or better than state-of-the-art results published with the same data so far.

Similar articles

See all similar articles

Cited by 2 articles

Publication types

MeSH terms

LinkOut - more resources

Feedback