A Bayesian Network Classifier that Combines a Finite Mixture Model and a Naive Bayes Model
Stefano Monti, Gregory F. Cooper · arXiv (Cornell University) · 2013
In this paper we present a new Bayesian network model for classification that combines the naive-Bayes (NB) classifier and the finite-mixture (FM) classifier. The resulting classifier aims at relaxing the strong assumptions on which the two component models are based, in an attempt to improve on their classification performance, both in terms of accuracy and in terms of calibration of the estimated probabilities. The proposed classifier is obtained by superimposing a finite mixture model on the set of feature variables of a naive Bayes model. We present experimental results that compare the predictive performance on real datasets of the new classifier with the predictive performance of the NB classifier and the FM classifier.
Cited by 24 works. doi:10.48550/arxiv.1301.6723 Open-access PDF
Authors
References
- The Nature of Statistical Learning Theory
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Pattern classification and scene analysis
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- The meaning and use of the area under a receiver operating characteristic (ROC) curve.
- Estimating the Dimension of a Model
- A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
- The EM Algorithm and Extensions
- On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
- A Prediction Rule to Identify Low-Risk Patients with Community-Acquired Pneumonia