Sequential Reduction Algorithm for Nearest Neighbor Rule
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.
KeywordsTraining Phase Reduction Level Handwritten Digit Neighbor Rule Heuristic Idea
Unable to display preview. Download preview PDF.
- 5.Hart, P.E.: The condensed nearest neighbor rule. IEEE Transactions on Information Theory IT-14(3), 515–516 (1968)Google Scholar
- 6.Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proc. 14th Int. Joint Conf. Artificial Intelligence, pp. 338–345 (1995)Google Scholar
- 10.Skalak, D.B.: Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: 11th International Conference on Machine Learning, New Brunswick, NJ, USA, pp. 293–301 (1994)Google Scholar