Skip to main content

An average predictive accuracy of the nearest neighbor classifier

  • Methods and Tools
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 984))

Abstract

The definition of similarity between cases is a key issue on case-based reasoning. The nearest neighbor method represents a basic mechanism for defining the similarity in the case-based reasoning system. In this paper, we perform an average-case analysis of the nearest neighbor classifier for conjunctive classes. We formally compute the predictive accuracy of the nearest neighbor classifier. The predictive accuracy is represented as a function of the number of training cases and the numbers of relevant attributes for classes. We also plot the predictive behavior of the classifier by substituting actual values into the parameters of the accuracy function. The graphs by plotting the predictive behavior help us to understand the relationships between the parameters of the accuracy function and the predictive accuracy of the nearest neighbor classifier. Our investigation focuses on how the numbers of relevant attributes for classes affect the predictive accuracy.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aha, D.W.: Incremental Instance-Based Learning of Independent and Graded Concept Descriptions. Proc. 6th International Workshop on Machine Learning. (1989) 387–391

    Google Scholar 

  2. Aha, D.W., Kibler, D. and Albert, M.K.: Instance-Based Learning Algorithms. Machine Learning. 6 (1991) 37–66

    Google Scholar 

  3. Albert, M.K. and Aha, D.W.: Analyses of Instance-Based Learning Algorithms. Proc. AAAI'91. (1991) 553–558

    Google Scholar 

  4. Cardie, C.: Using Decision Trees to Improve Case-Based Learning. Proc. 10th International Workshop on Machine Learning. (1993) 25–32

    Google Scholar 

  5. Cover, T.M. and Hart, P.E.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory. 13 (1967) 21–27

    Google Scholar 

  6. Creecy, O.H., Masand, B.M., Smith, S.J. and Waltz, D.: Trading Mips and Memory for Knowledge Engineering. CACM. 35 (1992) 48–63

    Google Scholar 

  7. Langley, P., Iba, W. and Thompson, K.: Average-Case Analysis of a Nearest Neighbor Algorithm. Proc. IJCAI'93. (1993) 889–894

    Google Scholar 

  8. Langley, P. and Iba, W.: Average-Case Analysis of a Nearest Neighbor Algorithm. Proc. AAAI'92. (1992) 223–228

    Google Scholar 

  9. Pazzani, M. and Sarrett, W. A Framework for Average Case Analysis of Conjunctive Learning Algorithms. Machine Learning. 9 (1992) 349–372

    Google Scholar 

  10. Satoh, K. and Okamoto, S.: Toward PAC-Learning of Weights from Qualitative Distance Information. Proc. AAAI'94 Workshop on CBR. (1994) 128–132

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jean-Paul Haton Mark Keane Michel Manago

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okamoto, S., Satoh, K. (1995). An average predictive accuracy of the nearest neighbor classifier. In: Haton, JP., Keane, M., Manago, M. (eds) Advances in Case-Based Reasoning. EWCBR 1994. Lecture Notes in Computer Science, vol 984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60364-6_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-60364-6_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60364-1

  • Online ISBN: 978-3-540-45052-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics