Abstract
It is well known that the naive Bayesian classifier is linear in binary domains. However, little work is done on the learnability of the naive Bayesian classifier in nominal domains, a general case of binary domains. This paper explores the geometric properties of the naive Bayesian classifier in nominal domains. First we propose a three-layer measure for the linearity of functions in nominal domains: hard linear, soft nonlinear, and hard nonlinear. We examine the learnability of the naive Bayesian classifier in terms of that linearity measure. We show that the naive Bayesian classifier can learn some hard linear and some soft nonlinear nominal functions, but still cannot learn any hard nonlinear functions.
Chapter PDF
Similar content being viewed by others
References
Domingos P., Pazzani M.: Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier. Machine Learning 29 (1997) 103–130
Duda R. O., Hart P. E.: Pattern Classification and Scene Analysis. A Wiley-Interscience Publication (1973)
Frank E., Trigg L., Holmes G., Witten I. H.: Naive Bayes for Regression. Machine Learning 41(1) (2000) 5–15
Friedman N., Greiger D., Goldszmidt M.: Bayesian Network Classifiers. Machine Learning 29 (1997) 103–130
Henrion M.: Propagation of Uncertainty in Bayesian Networks by Probabilistic Logic Sampling. In Lemmer J. F. and Kanal L. N. (Eds): Uncertainty in Artificial Intelligence 2. Elsevier/North-Holland (1988) 149–163.
Kononenko I.: Comparison of Inductive and Naive Bayesian Learning Approaches to Automatic Knowledge Acquisition. Current Trends in Knowledge Acquisition. IOS Press (1990)
Langley P., Iba W., Thomas K.: An Analysis of Bayesian Classifiers. Proceedings of the Tenth National Conference of Artificial Intelligence. AAAI Press (1992) 223–228
Peot M. A.: Geometric Implications of the Naive Bayes Assumption. Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann (1996).
Quinlan J. R.: C4.5: Programs for Machine Learning. Morgan Kaufmann: San Mateo, CA (1993)
Saks M. E.: Slicing the Hypercube. Survey in Combinatorics 1993. Cambridge University Press (1993) 211–255
Zhang H., Ling, C. X., Zhao Z.: The Learnability of Naive Bayes. In Hamilton H. J. and Yang Q. (Eds.): Advances in Artificial Intelligence. Springer (2000) 432–441
Zhang H., Ling, C. X.: Learnability of Augmented Naive Bayes in Nominal Domains. Proceedings of the Eighteenth International Conference on Machine Learning (to appear). Morgan Kaufmann (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Ling, C.X. (2001). Geometric Properties of Naive Bayes in Nominal Domains. In: De Raedt, L., Flach, P. (eds) Machine Learning: ECML 2001. ECML 2001. Lecture Notes in Computer Science(), vol 2167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44795-4_50
Download citation
DOI: https://doi.org/10.1007/3-540-44795-4_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42536-6
Online ISBN: 978-3-540-44795-5
eBook Packages: Springer Book Archive