Skip to main content

Improving K-Nearest Neighbor Rule with Dual Weighted Voting for Pattern Classification

  • Conference paper
Computer Science for Environmental Engineering and EcoInformatics (CSEEE 2011)

Abstract

In this paper, we propose a dual distance-weighted voting for KNN, which can solve the oversmoothing of increasing the neighborhood size k. The proposed classifier is compared with the other methods on ten UCI data sets. Experimental results suggest that the proposed classifier is a promising algorithm due to its satisfactory classification performance and robustness over a large value of k.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cover, T.M., Hart, P.E.: Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory 13, 21–27 (1967)

    Article  MATH  Google Scholar 

  2. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statical Learning. Springer, New York (2001)

    Book  MATH  Google Scholar 

  3. Dudani, S.A.: The Distance-weighted K-Nearest Neighbor Rule. IEEE Transactions on System Man and Cybernetics 6, 325–327 (1976)

    Article  Google Scholar 

  4. Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, London (1990)

    MATH  Google Scholar 

  5. Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2010), http://www.archive.ics.uci.edu

  6. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. New York, NY, USA (2001)

    Google Scholar 

  7. Wu, X.D., Kumar, V., et al.: Top 10 Algorithms in Data Mining. Knowledge Information System 14, 1–37 (2008)

    Article  Google Scholar 

  8. Zavrel.: An Empirical Re-examination of Weighted Voting for K-NN. In: Proceedings of the 7th Belgian-Dutch Conference on Machine Learning, Tilburg, pp. 139–148 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gou, J., Luo, M., Xiong, T. (2011). Improving K-Nearest Neighbor Rule with Dual Weighted Voting for Pattern Classification. In: Yu, Y., Yu, Z., Zhao, J. (eds) Computer Science for Environmental Engineering and EcoInformatics. CSEEE 2011. Communications in Computer and Information Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22691-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22691-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22690-8

  • Online ISBN: 978-3-642-22691-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics