Bayesian Network Classifiers-英文文献.pdf

Machine Learning, 29, 131–163 (1997) c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. Bayesian Network Classifiers* nir@ Computer Science Division, 387 Soda Hall, University of California, Berkeley, CA 94720 dang@cs.technion.ac.il Computer Science Department, Technion, Haifa, Israel, 32000 moises@ SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025 Editor: G. Provan, P. Langley, and P. Smyth Abstract. Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with state-of-the-art classifiers such as C4.5. This fact raises the question of whether a classifier with less restrictive assumptions can perform even better. In this paper we evaluate approaches for inducing classifiers from data, based on the theory of learning Bayesian networks . These networks are factored representations of probability distributions that generalize the naive Bayesian classifier and explicitly represent statements about independence. Among these approaches we single out a method we call Tree Augmented Naive Bayes (TAN), which outperforms naive Bayes, yet at the same time maintains the computational simplicity (no search involved) and robustness that characterize naive Bayes. We experimentally tested these approaches, using problems from the University of California at Irvine repository, and compared them to C4.5, naive Bayes, and wrapper methods for feature selection. Keywords: Bayesian n