Skip to main content

Pseudo Nearest Centroid Neighbor Classification

  • Conference paper
  • First Online:
Frontier Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 375))

Abstract

In this paper, we propose a new reliable classification approach, called the pseudo nearest centroid neighbor rule, which is based on the pseudo nearest neighbor rule (PNN) and nearest centroid neighborhood (NCN). In the proposed PNCN, the nearest centroid neighbors rather than nearest neighbors per class are first searched by means of NCN. Then, we calculate k categorical local mean vectors corresponding to k nearest centroid neighbors, and assign the weight to each local mean vector. Using the weighted k local mean vectors for each class, PNCN designs the corresponding pseudo nearest centroid neighbor and decides the class label of the query pattern according to the closest pseudo nearest centroid neighbor among all classes. The classification performance of the proposed PNCN is evaluated on real data sets in terms of the classification accuracy. The experimental results demonstrate the effectiveness of PNCN over the competing methods in many practical classification problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wu X, Kumar V, Quinlan JR, Ghosh J (2008) Top 10 algorithems in data mining. Knowl Inf Syst 14(1):1–37

    Article  Google Scholar 

  2. Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21–27

    Article  MATH  Google Scholar 

  3. Wagner T (1971) Covergence of the nearest neighbor rule. IEEE Trans Inf Theory 17:566–571

    Article  MATH  Google Scholar 

  4. Blanzieri E, Melgan F (2008) Nearest neighbor classification of remote sensing images with the maximal margin principle. IEEE Trans Geosci Remote Sens 46(6):1804–1811

    Article  Google Scholar 

  5. Guo G, Dyer CR (2005) Learning from examples in the small sample case: face expression recognition. IEEE Trans Syst Man Cybern 35:477–488

    Article  Google Scholar 

  6. Fukunaga K (1990) Introduction to statistical pattern recognition. Academic Press, San Diego, CA, USA, pp 219–238

    MATH  Google Scholar 

  7. Gou J, Du L, Zhang Y, Xiong T (2012) A new distance-weighted k-nearest neighbor classifier. J Inf Comput Sci 9(6):1429–1436

    Google Scholar 

  8. Mitani Y, Hamamoto Y (2006) A local mean-based nonparametric Classifier. Pattern Recognition Lett 27(10,15):1151–1159

    Google Scholar 

  9. Zeng Y, Yang Y, Zhao L (2009) Pseudo nearest neighbor rule for pattern classification. Expert Syst Appl 36(2):3587–3595

    Google Scholar 

  10. Gou J, Du Zhang Yi L, Xiong T (2012) A local mean-based K-nearest centroid neighbor classifier. Comput J 55(9):1058–1071

    Article  Google Scholar 

  11. Yang J, Zhang L, Yang JY, David Zhang (2011) From classifiers to discriminators: a nearest neighbor rule induced discriminant analysis. Pattern Recogn 44(7):1387–1402

    Article  MATH  Google Scholar 

  12. Gou J, Zhan Y, Rao Y, Shen X, Wang X, He W (2014) Improved pseudo nearest neighbor classification. Knowl-Based Syst 70:361–375

    Article  Google Scholar 

  13. Yang T, Kecman V (2008) Adaptive local hyperplane classification. Neurocomputing 71(13–15):3001–3004

    Google Scholar 

  14. Dudani SA (1976) The distance-weighted k-nearest neighbor Rule. IEEE Trans Syst Man Cybern 6(4):325–327

    Article  Google Scholar 

  15. Chaudhuri BB (1996) A new definition of neighbourhood of a point in multi-dimensional space. Pattern Recogn Lett 17(1):11–17

    Article  Google Scholar 

  16. Sánchez JS, Pla F, Ferri FJ (1997) On the use of neighbourhoodbased non-parametric classifiers. Pattern Recogn Lett 18(11–13):1179–1186

    Article  Google Scholar 

  17. Sánchez JS, Marqués AI (2006) An LVQ-based adaptive algorithm for learning from very small codebooks. Neurocomputing 69(7–9):922–927

    Article  Google Scholar 

  18. Bache K, Lichman M (2015) UCI Machine Learning Repository. http://archive.ics.uci.edu/ml. University of California, School of Information and Computer Science, Irvine, CA

Download references

Acknowledgment

This work was supported by National Science Foundation of China (Grant Nos. 61162005, 41171338 and 61163002), the Beifang Ethnic University school project (Grant No. 2010Y030), the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (Grant No. 14KJB520007), China Postdoctoral Science Foundation (Grant No. 2015M570411) and Research Foundation for Talented Scholars of JiangSu University (Grant No. 14JDG037).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Ma, H., Wang, X., Gou, J. (2016). Pseudo Nearest Centroid Neighbor Classification. In: Hung, J., Yen, N., Li, KC. (eds) Frontier Computing. Lecture Notes in Electrical Engineering, vol 375. Springer, Singapore. https://doi.org/10.1007/978-981-10-0539-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0539-8_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0538-1

  • Online ISBN: 978-981-10-0539-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics