Sciweavers

Share
ICPR
2002
IEEE

Adaptive Kernel Metric Nearest Neighbor Classification

11 years 5 months ago
Adaptive Kernel Metric Nearest Neighbor Classification
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions due to the curse-ofdimensionality. Severe bias can be introduced under these conditions when using the nearest neighbor rule. We propose an adaptive nearest neighbor classification method to try to minimize bias. We use quasiconformal transformed kernels to compute neighborhoods over which the class probabilities tend to be more homogeneous. As a result, better classification performance can be expected. The efficacy of our method is validated and compared against other competing techniques using a variety of data sets.
Jing Peng, Douglas R. Heisterkamp, H. K. Dai
Added 09 Nov 2009
Updated 09 Nov 2009
Type Conference
Year 2002
Where ICPR
Authors Jing Peng, Douglas R. Heisterkamp, H. K. Dai
Comments (0)
books