Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 324742, 14 pages
http://dx.doi.org/10.1155/2014/324742
Research Article

A New Nearest Neighbor Classification Algorithm Based on Local Probability Centers

Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, Taichung 402, Taiwan

Received 14 August 2013; Revised 29 December 2013; Accepted 29 December 2013; Published 9 February 2014

Academic Editor: Massimo Scalia

Copyright © 2014 I-Jing Li and Jiunn-Lin Wu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. E. Hart, D. G. Stock, and R. O. Duda, Pattern Classification, Wiley, Hoboken, NJ, USA, 2nd edition, 2001.
  2. S. A. Mahmoud and W. G. Al-Khatib, “Recognition of Arabic (Indian) bank check digits using log-gabor filters,” Applied Intelligence, vol. 35, no. 3, pp. 445–456, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. H. Malek, M. M. Ebadzadeh, and M. Rahmati, “Three new fuzzy neural networks learning algorithms based on clustering, training error and genetic algorithm,” Applied Intelligence, vol. 37, no. 3, pp. 280–289, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. C. Domeniconi, J. Peng, and D. Gunopulos, “Locally adaptive metric nearest-neighbor classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1281–1285, 2002. View at Publisher · View at Google Scholar · View at Scopus
  5. R. Paredes and E. Vidal, “Learning weighted metrics to minimize nearest-neighbor classification error,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 7, pp. 1100–1110, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Wang, P. Neskovic, and L. N. Cooper, “Improving nearest neighbor rule with a simple adaptive distance measure,” Pattern Recognition Letters, vol. 28, no. 2, pp. 207–213, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Z. Jahromi, E. Parvinnia, and R. John, “A method of learning weighted similarity function to improve the performance of nearest neighbor,” Information Sciences, vol. 179, no. 17, pp. 2964–2973, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. T. Hastie and R. Tibshirani, “Discriminant adaptive nearest neighbor classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 6, pp. 607–616, 1996. View at Publisher · View at Google Scholar · View at Scopus
  9. R. D. Short and K. Fukunaga, “The optimal distance measure for nearest neighbor classification,” IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 622–627, 1981. View at Google Scholar · View at Scopus
  10. B. Chen, H. Liu, J. Chai, and Z. Bao, “Large margin feature weighting method via linear programming,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 10, pp. 1475–1488, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. W. Hui, “Nearest neighbors by neighborhood counting,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 6, pp. 942–953, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. C.-M. Hsu and M.-S. Chen, “On the design and applicability of distance functions in high-himensional data space,” IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 4, pp. 523–536, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. C. J. Veenman and M. J. T. Reinders, “The nearest subclass classifier: a compromise between the nearest mean and nearest neighbor classifier,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 9, pp. 1417–1429, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. T. Kohonen, “The self-organizing map,” Proceedings of the IEEE, vol. 78, no. 9, pp. 1464–1480, 1990. View at Publisher · View at Google Scholar · View at Scopus
  15. L. Nanni and A. Lumini, “Particle swarm optimization for prototype reduction,” Neurocomputing, vol. 72, no. 4–6, pp. 1092–1097, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. W. Lam, C.-K. Keung, and D. Liu, “Discovering useful concept prototypes for classification based on filtering and abstraction,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 8, pp. 1075–1090, 2002. View at Publisher · View at Google Scholar · View at Scopus
  17. I. Triguero, J. Derrac, S. García, and F. Herrera, “A taxonomy and experimental study on prototype generation for nearest neighbor classification,” IEEE Transactions on Systems, Man and Cybernetics C, vol. 42, no. 1, pp. 86–100, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. S. García, J. Derrac, J. R. Cano, and F. Herrera, “Prototype selection for nearest neighbor classification: taxonomy and empirical study,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 3, pp. 417–435, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. H. A. Fayed and A. F. Atiya, “A novel template reduction approach for the K-nearest neighbor method,” IEEE Transactions on Neural Networks, vol. 20, no. 5, pp. 890–896, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. F. Angiulli, “Fast nearest neighbor condensation for large data sets classification,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 11, pp. 1450–1464, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. D. Randall Wilson and T. R. Martinez, “Reduction techniques for instance-based learning algorithms,” Machine Learning, vol. 38, no. 3, pp. 257–286, 2000. View at Publisher · View at Google Scholar · View at Scopus
  22. B. Li, Y. W. Chen, and Y. Q. Chen, “The nearest neighbor algorithm of local probability centers,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 38, no. 1, pp. 141–154, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Hotta, S. Kiyasu, and S. Miyahara, “Pattern recognition using average patterns of categorical k-nearest neighbors,” in Proceedings of the 17th International Conference on Pattern Recognition (ICPR '04), pp. 412–415, August 2004. View at Publisher · View at Google Scholar · View at Scopus
  24. S. Theodoridis and K. Koutroumbas, Pattern Recognition, Academic Press, 3rd edition, 2006.
  25. H. Gould, J. Tobochnik, and W. Christian, An Introduction to Computer Simulation Methods: Applications to Physical System, Addison Wesley, 3rd edition, 2006.
  26. Y. Zeng, Y. Yang, and L. Zhao, “Pseudo nearest neighbor rule for pattern classification,” Expert Systems with Applications, vol. 36, no. 2, pp. 3587–3595, 2009. View at Publisher · View at Google Scholar · View at Scopus
  27. K. Fukunaga, Introduction to Statistical Pattern Recognition, Academic Press, 2nd edition, 1990.
  28. C. Blake, E. Keogh, and C. J. Merz, “UCI Repository of Machine Learning Databases,” Department of Information and Computer Science, University of California, 2009, http://www.ics.uci.edu/~mlearn.
  29. F. Korn, B.-U. Pagel, and C. Faloutsos, “On the “dimensionality curse” and the “self-similarity blessing”,” IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 96–111, 2001. View at Publisher · View at Google Scholar · View at Scopus
  30. A. Hinneburg, C. C. Aggarwal, and D. A. Keim, “What is the nearest neighbor in high dimensional spaces?” in Proc. the 26th International Conference on Very Large Data Bases, pp. 506–515, 2000.