Naive Bayes is a well-known and studied algorithm both in statistics and machine learning. Bayesian learning algorithms represent each concept with a single probabilistic summary. In this paper we present an iterative approach to naive Bayes. The Iterative Bayes begins with the distribution tables built by the naive Bayes. Those tables are iteratively updated in order to improve the probability class distribution associated with each training example. In this paper we argue that Iterative Bayes minimizes a quadratic loss function instead of the 0 -1 loss function that usually applies to classiÿcation problems. Experimental evaluation of Iterative Bayes on 27 benchmark data sets shows consistent gains in accuracy. An interesting side e ect of our algorithm is that it shows to be robust to attribute dependencies.
-Gama presented an algorithm that iteratively update the contingency tables in order to improve the probability class distribution associated with each training example REF .
Iterative Bayes
Theor. Comput. Sci.
Theor. Comput. Sci.
Computer Science