Sequential reduction algorithm for nearest neighbor rule

Authors:
Marcin Raniszewski
Affiliations:
University of Łódź, Faculty of Physics and Applied Informatics, Łódź, Poland
Venue:
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
Year:
2010

Citing 6
Cited 0

Editing for the k-nearest neighbors rule by a genetic algorithm

Pattern Recognition Letters - Special issue on genetic algorithms
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Pattern Recognition, Third Edition

Pattern Recognition, Third Edition
A study of cross-validation and bootstrap for accuracy estimation and model selection

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Nearest prototype classification: clustering, genetic algorithms, or random search?

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Another move toward the minimum consistent subset: a tabu searchapproach to the condensed nearest neighbor rule

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effective training set reduction is one of the main problems in constructing fast 1-NN classifiers. A reduced set should be significantly smaller and ought to result in a similar fraction of correct classifications as a complete training set. In this paper a sequential reduction algorithm for nearest neighbor rule is described. The proposed method is based on heuristic idea of sequential adding and eliminating samples. The performance of the described algorithm is evaluated and compared with three other well-known reduction algorithms based on heuristic ideas, on four real datasets extracted from images.