Using maximum similarity graphs to edit nearest neighbor classifiers

Abstract

The Nearest Neighbor classifier is a simple but powerful nonparametric technique for supervised classification. However, it is very sensitive to noise and outliers, which could decrease the classifier accuracy. To overcome this problem, we propose two new editing methods based on maximum similarity graphs. Numerical experiments in several databases show the high quality performance of our methods according to classifier accuracy. © 2009 Springer-Verlag Berlin Heidelberg.