Discrete Bayesian Network Classifiers: A Survey
Open accessThe DOI matches its Crossref record; 191 of the 193 references it cites were found in a registry or an index.
Abstract
We have had to wait over 30 years since the naive Bayes model was first introduced in 1960 for the so-called Bayesian network classifiers to resurge. Based on Bayesian networks, these classifiers have many strengths, like model interpretability, accommodation to complex data and classification problem settings, existence of efficient algorithms for learning and classification tasks, and successful applicability in real-world problems. In this article, we survey the whole set of discrete Bayesian network classifiers devised to date, organized in increasing order of structure complexity: naive Bayes, selective naive Bayes, seminaive Bayes, one-dependence Bayesian classifiers, k -dependence Bayesian classifiers, Bayesian network-augmented naive Bayes, Markov blanket-based Bayesian classifier, unrestricted Bayesian classifiers, and Bayesian multinets. Issues of feature subset selection and generative and discriminative structure and parameter learning are also covered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“These classifiers have several advantages, including model interpretation, compliance with complex data and classification problem environments, efficient learning and classification algorithms, and successful application to real-world problems [64].”
From Cost Overrun Risk Assessment and Prediction in Construction Projects: A Bayesian Network Classifier Approach (2022) · cites this paper as [64]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444 · cited 1×
“This structure is learned using a hill-climbing algorithm that compares candidate models with the Bayesian information criterion (BIC), whereas its parameters parameters are estimated using the EM algorithm [Dempster et al. 1977].”
MethodLecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750 · cited 1×
“…three — breast : left-or right-sided breast cancer — breast-quad : location of the tumor upper-outer, lower-outer, upper-inner, and lower-inner) plus the nipple as a central point — size : maximum excised tumor diameter (in mm), discretized into three equal-width WEKA [Hall et al. 2009] software.”
Method(1988) · Cited by 16,582
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947 · cited 1×
“The authors prove that the Markov blanket corresponds to the strongly relevant features as defined by Kohavi and John [1997].”
BackgroundProceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
Research works printed but not linked: 16
- 10.5555/2073946.2073952 · doi:10.5555/2073946.2073952
- C. M. Bishop and J. Lasserre . 2007. Generative or discriminative? Getting the best of both worlds . In Bayesian Statistics , Vol. 8 . Oxford University Press, 3--23. C. M. Bishop and J. Lasserre. 2007. Generative or discriminative? Getting the best of both worlds. In Bayesian Statistics, Vol. 8. Oxford University Press, 3--23.
- 10.5555/2100662.2100669 · doi:10.5555/2100662.2100669
- 10.5555/1781238.1781244 · doi:10.5555/1781238.1781244
- 10.5555/1005332.1044703 · doi:10.5555/1005332.1044703
- 10.1023/A:1022649401552 · doi:10.1023/a:1022649401552 · Paper page
- 10.5555/2010978.2010980 · doi:10.5555/2010978.2010980
- International Statistical Review 69 3 (2001) 385--398. · DOI · Paper page
- P. Kontkanen , P. Myllymäki , and H. Tirri . 1996 . Constructing Bayesian Finite Mixture Models by the EM Algorithm . Technical Report C-1996-9. Department of Computer Science , University of Helsinki . P. Kontkanen, P. Myllymäki, and H. Tirri. 1996. Constructing Bayesian Finite Mixture Models by the EM Algorithm. Technical Report C-1996-9. Department of Computer Science, University of Helsinki.
- 10.5555/645323.649601 · doi:10.5555/645323.649601
- 10.5555/647301.721482 · doi:10.5555/647301.721482
- M. Narasimhan and J. A. Bilmes . 2005. A submodular-supermodular procedure with applications to discriminative structure learning . In Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence (UAI-2005) . AUAI Press, 404--412. M. Narasimhan and J. A. Bilmes. 2005. A submodular-supermodular procedure with applications to discriminative structure learning. In Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence (UAI-2005). AUAI Press, 404--412.
- J. Pearl . 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann , Palo Alto, CA . J. Pearl. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Palo Alto, CA.
- 10.5555/3121646.3121662 · doi:10.5555/3121646.3121662
- B. Poulin , R. Eisner , D. Szafron , Paul Lu , R. Greiner , D. S. Wishart , A. Fyshe , B. Pearcy , C. MacDonell , and J. Anvik . 2006. Visual explanation of evidence with additive classifiers . In Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-2006) . AAAI Press/MIT Press , 1822 --1829. B. Poulin, R. Eisner, D. Szafron, Paul Lu, R. Greiner, D. S. Wishart, A. Fyshe, B. Pearcy, C. MacDonell, and J. Anvik. 2006. Visual explanation of evidence with additive classifiers. In Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-2006). AAAI Press/MIT Press, 1822--1829.
- 10.5555/645326.649714 · doi:10.5555/645326.649714
Cited by
Big IoT data analytics: Architecture, opportunities, and open research challenges
(2017) · IEEE Access · doi:10.1109/access.2017.2689040 · Cited by 980
“and edges denote conditional dependency [47].”
Data Mining for the Internet of Things: Literature Review and Challenges
Chen, F., Deng, P., Wan, J., Zhang, D., Vasilakos, A. V., & Rong, X. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/431047 · Cited by 528
Machine Learning Methods in Drug Discovery
Patel, L., Shukla, T., Huang, X., Ussery, D. W., & Wang, S. (2020) · Molecules · doi:10.3390/molecules25225277 · Cited by 460
Advances in Bayesian network modelling: Integration of modelling technologies
Marcot, B. G., & Penman, T. D. (2019) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2018.09.016 · Cited by 429
“BN classifiers include a wide variety of algorithms starting with naive Bayes and variants thereof (Bielza and Larrañaga, 2014).”
Sentiment analysis of Twitter data during critical events through Bayesian networks classifiers
Ruz, G. A., Henríquez, P. A., & Mascareño, A. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.01.005 · Cited by 332
Metadata
- Authors
- Bielza, C., & Larrañaga, P.
- Affiliations
- Universidad Politécnica de Madrid (ES)
- Venue
- ACM Computing Surveys
- Published
- 2014-07
- Volume
- 47
- Issue
- 1
- Pages
- 1-43
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2090347203
- Semantic Scholar
- e4aca79cd916f67b5ebde5676b2cab9ef5644dd0
- Cited by
- 248
- References
- 193
- Citations by year
- 2026: 16 · 2025: 19 · 2024: 20 · 2023: 27 · 2022: 25 · 2021: 26 · 2020: 16 · 2019: 24 · 2018: 16 · 2017: 14 · 2016: 17 · 2015: 20 · 2014: 8
- FWCI
- 19.76
- Type
- journal article
- Language
- en
- Open access
- green
- oa.upm.es
- Licence
- Locations
- ACM Computing Surveys (publishedVersion)
- Hispana (submittedVersion, cc-by-nc-nd)
- Archivo Digital UPM (Universidad Politécnica de Madrid) (submittedVersion, cc-by-nc-nd)
- Funders
- Ministerio de Economía y Competitividad
- Cajal Blue Brain
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- naive Bayes, feature selection, structure learning, parameter learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discrete Bayesian Network Classifiers: A Survey. https://app.cochat.ai/papers/10.1145/2576868
- The paper
- Bielza, C., & Larrañaga, P. (2014). Discrete Bayesian Network Classifiers: A Survey. ACM Computing Surveys. https://doi.org/10.1145/2576868
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.