Affiliations: [a] COPPE/UFRJ, Federal University of Rio de Janeiro, Brazil | [b] DC/UFSCar, Federal University of São Carlos, Brazil | [c] ICMC/USP, University of São Paulo, Brazil
Correspondence:
[*]
Corresponding author: Estevam R. Hruschka, Jr., Computer Science Department, Federal University of Sao Carlos, Rod. Washington Luis, Km 325, Sao Carlos, SP 13565-905, Brazil. E-mail: [email protected].
Abstract: This work proposes and discusses an approach for inducing Bayesian classifiers aimed at balancing the tradeoff between the precise probability estimates produced by time consuming unrestricted Bayesian networks and the computational efficiency of Naive Bayes (NB) classifiers. The proposed approach is based on the fundamental principles of the Heuristic Search Bayesian network learning. The Markov Blanket concept, as well as a proposed “approximate Markov Blanket” are used to reduce the number of nodes that form the Bayesian network to be induced from data. Consequently, the usually high computational cost of the heuristic search learning algorithms can be lessened, while Bayesian network structures better than NB can be achieved. The resulting algorithms, called DMBC (Dynamic Markov Blanket Classifier) and A-DMBC (Approximate DMBC), are empirically assessed in twelve domains that illustrate scenarios of particular interest. The obtained results are compared with NB and Tree Augmented Network (TAN) classifiers, and confirm that both proposed algorithms can provide good classification accuracies and better probability estimates than NB and TAN, while being more computationally efficient than the widely used K2 Algorithm.
