Skip to main content

The Learnability of Naive Bayes

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2000)

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

Abstract

Naive Bayes is an efficient and effective learning algorithm, but previous results show that its representation ability is severely limited since it can only represent certain linearly separable functions in the binary domain. We give necessary and sufficient conditions on linearly separable functions in the binary domain to be learnable by Naive Bayes under uniform representation. We then show that the learnability (and error rates) of Naive Bayes can be affected dramatically by sampling distributions. Our results help us to gain a much deeper understanding of this seemingly simple, yet powerful learning algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Domingos, P., & Pazzani, M. (1997): Beyond independence: Conditions of the optimality of the simple bayesian classifier. Machine Learning, 29, 103–130.

    Article  MATH  Google Scholar 

  2. Dougherty, J., Kohavi, R., & Sahami, M. (1995): Supervised and unsupervised discretization of Continuous Features. In Proceedings of the Twelfth International Conference on Machine Learning, pp. 194–202. Morgan Kaufmann.

    Google Scholar 

  3. Duda, R. O., & Hart, P. E. (1973): Pattern classification and scene analysis. A Wiley Interscience Publication.

    Google Scholar 

  4. Kononenko, I. (1990): Comparison of inductive and naive Bayesian learning approaches to automatic knowledge acquisition. In Wielinga, B. (Ed.), Current Trends in Knowledge Acquisition. IOS Press.

    Google Scholar 

  5. Langley, P., Iba, W., & Thomas, K. (1992). An analysis of Bayesian classifier. In proceedings of the Tenth National Conference of Artificial Intelligence, pp. 223–228. AAAI Press.

    Google Scholar 

  6. Pazzani, M., Muramatsu, J., & Billsus, B. (1996). Syskill & webert: Identifying interesting websites. In Proceedings of the Thirteenth National Conference of Artificial Intelligence. pp. 54–62. AAAI Press.

    Google Scholar 

  7. Quinlan, J. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann: San Mateo, CA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Ling, C.X., Zhao, Z. (2000). The Learnability of Naive Bayes. In: Hamilton, H.J. (eds) Advances in Artificial Intelligence. Canadian AI 2000. Lecture Notes in Computer Science(), vol 1822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45486-1_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-45486-1_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67557-0

  • Online ISBN: 978-3-540-45486-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics