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. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Zhang, H., & Ling, C. X. (2001). Geometric properties of naive bayes in nominal domains. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2167, 588–599. https://doi.org/10.1007/3-540-44795-4_50
Mendeley helps you to discover research relevant for your work.