Nearest neighbor classification relies on the assumption that class conditional probabilities are locally constant. This assumption becomes false in high dimensions with finite samples due to the curse of dimensionality. The nearest neighbor rule introduces severe bias under these conditions. We propose a locally adaptive neighborhood morphing classification method to try to minimize bias. We use local support vector machine teaming to estimate an effective metric for producing neighborhoods that are elongated along less discriminant feature dimensions and constricted along most discriminant ones. As a result, the class conditional probabilities can be expected to be approximately constant in the modified neighborhoods, whereby better classification performance can be achieved. The efficacy of our method is validated and compared against other competing techniques using a number of data sets.
LDA/SVM driven nearest neighbor classification
2001-01-01
638248 byte
Conference paper
Electronic Resource
English
LDA/SVM Driven Nearest Neighbor Classification
British Library Conference Proceedings | 2001
|Hyperspectral Signature Classification with Tabular Nearest-Neighbor Encoding
British Library Conference Proceedings | 2007
|British Library Online Contents | 2015
|Wavelet-k Nearest Neighbor Vehicle Classification Approach with Inductive Loop Signatures
Online Contents | 2013
|