A novel template reduction approach for the K-nearest neighbor method

IEEE Transactions on Neural Networks

Volumn 20, Issue 5, 2009, Pages 890-896

  Fayed, Hatem A ^a   Atiya, Amir F ^b  

^a CAIRO UNIVERSITY   (Egypt)

^b CAIRO UNIVERSITY   (Egypt)

Author keywords

Condensing; Cross validation; Editing; Nearest neighbor (KNN); Template reduction

Indexed keywords

CONDENSING; CROSS VALIDATION; EDITING; NEAREST NEIGHBOR (KNN); TEMPLATE REDUCTION;

SET THEORY;

EID: 67349169047     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2009.2018547     Document Type: Article

References (27)

1. K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd ed. New York: Academic, 1990.
2. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, 2nd ed. New York: Wiley, 2001.
3. T. Hastie, R. Tibshirani, and J. H. Friedman, The Elements of Statistical Learning: Data Mining Inference, and Prediction, ser. Statistics. Berlin, Germany: Springer-Verlag, 2001.
4. A. R. Webb, Statistical Pattern Recognition, 2nd ed. London, U.K.: Wiley, 2002.
5. W. Duch, "Similarity based methods: A general framework for classification, approximation and association," Control Cybern., vol. 29, no. 4, pp. 937-968, 2000.
6. D. L. Wilson, "Asymptotic properties of nearest neighbor rules using edited data," IEEE Trans. Syst. Man Cybern., vol. SMC-2, no. 3, pp. 408-420, Jul. 1972.
7. P. A. Devijver and J. Kittler, "On the edited nearest neighbor rule," in Proc. 5th Int. Conf. Pattern Recognit., Miami, FL, 1980, pp. 72-80.
8. F. J. Ferri and E. Vidal, "Colour image segmentation and labeling through multiedit-condensing," Pattern Recognit. Lett., vol. 13, pp. 561-568, 1992.
9. P. E. Hart, "The condensed nearest neighbor rule," IEEE Trans. Inf. Theory, vol. IT-14, no. 3, pp. 515-516, May 1968.
10. W. Gates, "The reduced nearest neighbor rule," IEEE Trans. Inf. Theory, vol. IT-18, no. 3, pp. 431-433, May 1972.
11. B. K. Bhattacharya, R. S. Poulsen, and G. T. Toussaint, "Application of proximity graphs to editing nearest neighbor decision rules," in Proc. 16th Symp. Interface Between Comput. Sci. Statist., 1984, pp. 97-108.
12. D. R. Wilson and T. R. Martinez, "Reduction techniques for instance-based learning algorithms," Mach. Learn., vol. 38, no. 3, pp. 257-286, 2000.
13. R. A. Mollineda, F. J. Ferri, and E. Vidal, "An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering," Pattern Recognit., vol. 35, pp. 2771-2782, 2002.
14. Y.Wu,K. Ianakiev, and V. Govindaraju, "Improved k-nearest neighbor classification," Pattern Recognit., vol. 35, pp. 2311-2318, 2002.
15. J. R. Cano, F. Herrera, and M. Lozano, "Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study," IEEE Trans. Evol. Comput., vol. 7, no. 6, pp. 561-575, Dec. 2003.
16. J. S. Sánchez, "High training set size reduction by space partitioning and prototype abstraction," Pattern Recognit., vol. 37, no. 7, pp. 1561-1564, 2004.
17. R. Barandela, F. J. Ferri, and J. S. Sánchez, "Decision boundary preserving prototype selection for nearest neighbor classification," Int. J. Pattern Recognit. Artif. Intell., vol. 19, no. 6, pp. 787-806, 2005.
18. D. Huang and T. W. S. Chow, "Enhancing density-based data reduction using entropy," Neural Comput., vol. 18, no. 2, pp. 470-495, 2006.
19. R. Paredes and E. Vidal, "Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization," Pattern Recognit., vol. 39, no. 2, pp. 171-179, 2006.
20. J. S. Sánchez and A. I. Marqués, "An LVQ-based adaptive algorithm for learning from very small codebooks," Neurocomputing, vol. 69, no. 7-9, pp. 922-927, 2006.
21. H. Brighton and C. Mellish, "Advances in instance selection for instance-based learning algorithms," Data Mining Knowl. Disc., vol. 6, pp. 153-172, 2002.
22. D. A. Fraser, Nonparametric Methods in Statistics. New York:WIley, 1957, ch. 4.
23. R. D. Short and K. Fukunaga, "The optimal distance measure for nearest neighbor classification," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 622-627, Sep. 1981.
24. E. Alpaydin, "Combined 5 × 2 cv F test for comparing supervised classification learning algorithms," Neural Comput., vol. 11, pp. 1885-1892, 1999.
25. T. G. Dietterch, "Approximate statistical tests for comparing supervised classification learning algorithms," Neural Comput., vol. 10, pp. 1895-1923, 1998.
26. L. Prechelt, "Proben1, A set of neural-network benchmark problems," University of Karlsruhe, Germany, 1994 [Online]. Available: Available: http://page.mi.fu-berlin.de/prechelt/ Biblio/1994-21.pdf
27. C. L. Blake and C. J. Merz, "UCI Repository of Machine Learning database," Dept. Inf. Comput. Sci., Univ. California, Irvine, Irvine, CA, 1998 [Online]. Available: http://www.ics.uci.edu/~mlearn