Evaluation of the Performance of the Markov Blanket Bayesian Classifier Algorithm
Michael G. Madden

TL;DR
This paper empirically compares the Markov Blanket Bayesian Classifier (MBBC) with other Bayesian classifiers, evaluating their accuracy and speed on benchmark datasets, and finds MBBC to be competitive.
Contribution
It provides the first empirical evaluation of MBBC against established Bayesian classifiers using standard benchmarks.
Findings
MBBC is competitive in accuracy with Naive Bayes, TAN, and Bayesian networks.
MBBC demonstrates comparable speed to other classifiers.
Performance varies depending on dataset characteristics.
Abstract
The Markov Blanket Bayesian Classifier is a recently-proposed algorithm for construction of probabilistic classifiers. This paper presents an empirical comparison of the MBBC algorithm with three other Bayesian classifiers: Naive Bayes, Tree-Augmented Naive Bayes and a general Bayesian network. All of these are implemented using the K2 framework of Cooper and Herskovits. The classifiers are compared in terms of their performance (using simple accuracy measures and ROC curves) and speed, on a range of standard benchmark data sets. It is concluded that MBBC is competitive in terms of speed and accuracy with the other algorithms considered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Anomaly Detection Techniques and Applications · Machine Learning and Data Classification
