Skip to main content

Nearest Neighbor Classification by Relearning

  • Conference paper
Intelligent Data Engineering and Automated Learning - IDEAL 2009 (IDEAL 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5788))

Abstract

Since the k-nearest neighbor (kNN) classification is a simple and effective classification approach, it is well known in the data classification. However, improving performance of the classifier is still attractive to cope with the high accuracy processing. A tolerant rough set is considered as a basis of the classification of data. The data classification is realized by applying the kNN with distance function. To improve the classification accuracy, a distance function with weights is considered. Then, weights of the function are optimized by the genetic algorithm. After the learning of training data, an unknown data is classified by the kNN with distance function. To improve further the performance of the kNN classifier, a relearning method is proposed. The proposed relearning method shows a higher generalization accuracy when compared to the basic kNN with distance function and other conventional learning algorithms. Experiments have been conducted on some benchmark datasets from the UCI Machine Learning Repository.

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. Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. Intelligent Data Analysis 3(3), 191–209 (1999)

    Article  Google Scholar 

  2. Bao, Y., Ishii, N.: Combining Multiple k-Nearest Neighbor Classifiers for Text Classification by Reducts. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS (LNAI), vol. 2534, pp. 340–347. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Ishii, N., Muai, T., Yamada, T., Bao, Y.: Classification by Weighting, Similarity and kNN. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 57–64. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Wilson, D.R., Martinez, T.R.: An Integrated Instance-based Learning Algorithm. Computational Intelligence 16(1), 1–28 (2000)

    Article  MathSciNet  Google Scholar 

  6. Merz, C.J., Murphy, P.M.: UCI Repository of Machine Learning Databases. Irvine, CA (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishii, N., Hoki, Y., Okada, Y., Bao, Y. (2009). Nearest Neighbor Classification by Relearning. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04394-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04393-2

  • Online ISBN: 978-3-642-04394-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics