Large Margin Nearest Neighbor Classifiers
Document Type
Article
Publication Date
7-1-2005
Abstract
The nearest neighbor technique is a simple and appealing approach to addressing classification problems. It relies on the assumption of locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with a finite number of examples due to the curse of dimensionality. Severe bias can be introduced under these conditions when using the nearest neighbor rule. The employment of a locally adaptive metric becomes crucial in order to keep class conditional probabilities close to uniform, thereby minimizing the bias of estimates. We propose a technique that computes a locally flexible metric by means of support vector machines (SVMs). The decision function constructed by SVMs is used to determine the most discriminant direction in a neighborhood around the query. Such a direction provides a local feature weighting scheme. We formally show that our method increases the margin in the weighted space where classification takes place. Moreover, our method has the important advantage of online computational efficiency over competing locally adaptive techniques for nearest neighbor classification. We demonstrate the efficacy of our method using both real and simulated data.
DOI
10.1109/TNN.2005.849821
Montclair State University Digital Commons Citation
Domeniconi, Carlotta; Gunopulos, Dimitrios; and Peng, Jing, "Large Margin Nearest Neighbor Classifiers" (2005). Department of Computer Science Faculty Scholarship and Creative Works. 367.
https://digitalcommons.montclair.edu/compusci-facpubs/367