Skip to main content

Introduction to Classification: Naïve Bayes and Nearest Neighbour

  • Chapter
Principles of Data Mining

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 8599 Accesses

Abstract

This chapter introduces classification, one of the most common data mining tasks. Two classification algorithms are described in detail: the Naïve Bayes algorithm, which uses probability theory to find the most likely of the possible classifications, and Nearest Neighbour classification, which estimates the classification of an unseen instance using the classification of the instances ‘closest’ to it. These two methods generally assume that all the attributes are categorical and continuous, respectively.

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

Access this chapter

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Bramer, M. (2013). Introduction to Classification: Naïve Bayes and Nearest Neighbour. In: Principles of Data Mining. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4884-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4884-5_3

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4883-8

  • Online ISBN: 978-1-4471-4884-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics