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
Items 201–247 of 247
Datum-Wise Inference in Structured Environments
Ekanayake, S. P., & Zois, D. (2023) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2023.3271616 · Cited by 1
A Cloud-Based Urban Monitoring System by Using a Quadcopter and Intelligent Learning Techniques
Khanmohammadi, S., & Gharajeh, M. S. (2023) · Journal of Automation Mobile Robotics & Intelligent Systems · doi:10.14313/jamris/2-2022/11 · Cited by 1
Efficient search for relevance explanations using MAP-independence in Bayesian networks
Valero-Leal, E., Bielza, C., Larrañaga, P., & Renooij, S. (2023) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2023.108965 · Cited by 1
Self-citationImproving the Accuracy of Oncology Diagnosis: A Machine Learning-Based Approach to Cancer Prediction
Cabanillas-Carbonell, M., & Zapata-Paulini, J. E. (2024) · International Journal of Online and Biomedical Engineering (iJOE) · doi:10.3991/ijoe.v20i11.49139 · Cited by 6
Attribute Value Weighted Averaged One-Dependence Estimators with Kullback–Leibler Divergence
Zhu, C., Chen, S., Ke, H., & Zhang, C. (2024) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126625500392 · Cited by 1
One-Hot Logistic Regression for Radiomics-Based Classification
Schall, B., Anty, R., & Fillatre, L. (2024) · Proceedings - International Conference on Image Processing · doi:10.1109/icip51287.2024.10647849 · Cited by 1
A Novel Approach for Web Service Recommendation
Barod, P., Bhamare, M., & Patankar, R. (2016) · International Conference on Information and Communication Technology for Competitive Strategies (ICTCS) · doi:10.1145/2905055.2905345 · Cited by 1
Movement Detection Algorithm for Patients with Hip Surgery
Guevara, C., Santos, M., & Jadán-Guerrero, J. L. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-94120-2_42 · Cited by 1
Universal Target Learning: An Efficient and Effective Technique for Semi-Naive Bayesian Learning
Gao, S., Lou, H., Wang, L., Liu, Y., & Fan, T. (2019) · Entropy · doi:10.3390/e21080729 · Cited by 1
“Bayesian Network Classifiers (BNCs) [11] are such tools for indicating the probabilistic dependency relationships graphically and inferring under uncertainty conditions.”
BackgroundLocalisation of Persons by Means of Impulse-Radar Sensors: Advanced Methods
Wagner, J., Mazurek, P., & Morawski, R. Z. (2022) · Health information science · doi:10.1007/978-3-030-96009-4_3 · Cited by 1
Petty, G. W. (2022) · doi:10.1002/essoar.10510188.1 · Cited by 1
“A number of distinct methods for supervised classification exist, including artificial neural networks, classification trees, support vector machines, k-nearest neighbor, random forest, and naive Bayes (Abiodun et al. 2018; Hush and Horne 1993; Loh 2011; Maulik and Chakraborty 2017; Prasath et al. 2017; Belgiu and Dră…”
MethodScaling up machine learning algorithms to handle big data
Jadda, K. A. (2014)
A Predictive Model for Video Lectures Classification
Silva, P., Costa, E. D. B., & Pinheiro, R. (2014) · Anais do ... Simpósio Brasileiro de Informática na Educação/Anais do Simpósio Brasileiro de Informática na Educação · doi:10.5753/cbie.sbie.2014.21
“The classifiers Naive Bayes [Bielza and Larrañaga 2014], SVM [Chang and Lin 2011] and C4.”
MethodBermejo, P., Gámez, J. A., Puerta, J. M., Esquivias, M. A., & Tarraga, P. J. (2016) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2016.0040
“In order to avoid this complexity, a series of alleviations have appeared in the literature [10], [11].”
BackgroundDewi, R. K., Iriawan, N., & Irhamah (2018) · International Conference on Information and Communications Technology (ICOIACT) · doi:10.1109/icoiact.2018.8350802
“NB is the simplest form of Bayesian Network classification where the predictive/classification variable is assumed to be conditional independent [10].”
BackgroundBayesian Networks: A State-Of-The-Art Survey.
Kote, N., Biba, M., & Canaj, E. (2018)
A Review on Data Mining Algorithms for Internet of Things
S, B. M., Jeba, K. M., & Srividhya, V. (2016) · World Scientific News
A Compressed Hidden Naive Bayesian Classifier
Ou, G., He, Y., & Huang, J. Z. (2021) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn52387.2021.9534201
Comments on: hybrid semiparametric Bayesian networks
Sperlich, S. (2022) · Test · doi:10.1007/s11749-022-00817-y
“For reviews on this, we can simply consult the author’s publication list, see (Blanco et al. 2003; Bielza et al. 2011; Bielza and Larrañaga 2014a, b), to mention only some of the various reviews.”
MethodIdentification of informational and probabilistic independence by adaptive thresholding
Li, K., Wang, A., Wang, L., Fan, H., & Zhang, S. (2022) · Intelligent Data Analysis · doi:10.3233/ida-215942
Moreno-Rodríguez, J. L., Larrañaga, P., & Bielza, C. (2023) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2023.1092967
“First, it is possible to run some Bayesian classifiers (Bielza and Larrañaga, 2014) already coded using the bnlearn package, such as the naive Bayes and the tree augmented naive Bayes (TAN) classifiers (Friedman et al.”
BackgroundSelf-citationRetractedEmpowering Interpretable, Explainable Machine Learning Using Bayesian Network Classifiers
Lerner, B. (2023) · Springer eBooks · doi:10.1007/978-3-031-24628-9_7 · Cited by 1
Valero-Leal, E., Larrañaga, P., & Bielza, C. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-54303-6_5
Self-citationMishra, S. K., Selvasundaram, K., Mohan, C. R., Raman, P., Bukhari, S. N., & Sisodia, D. R. (2024) · Smart innovation, systems and technologies · doi:10.1007/978-981-97-2716-2_10
Singh, G., Bajaj, R., & Singh, A. (2024) · IEEE International Conference on Communications workshops · doi:10.1109/iccworkshops59551.2024.10615763
Instance–wise Feature Acquisition with Classifier Selection Option for Structured Data Instances
Ekanayake, S. P., & Zois, D. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10889339
Comparison of Quantitative Methods for Set‐Based Design When Information Is Uncertain
Dullen, S., Verma, D., Blackburn, M., & Whitcomb, C. A. (2025) · Systems Engineering · doi:10.1002/sys.21811
Li, M., Li, C., Huang, R., 谷, 滋., Wang, J., Wang, Y., Fan, J., Zhao, Z., & Wang, Y. (2025) · Computers & Industrial Engineering · doi:10.1016/j.cie.2025.111486
Holistic interference management for wireless networks in the era of artificial intelligence
Husen, A., Nisar, S., Chaudary, M. H., & Khan, Z. A. (2025) · Cluster Computing · doi:10.1007/s10586-025-05658-6
Gohari, K., Kazemnejad, A., Mohammadi, M., Eskandari, F., Saberi, S., Esmaieli, M., & Sheidaei, A. (2023) · Figshare · doi:10.6084/m9.figshare.24002690
Disentangling childhood asthma risk structure via Bayesian network topology
Gu, C., Ge, H., Wang, H., Sun, C., & Yang, H. (2026) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2026.131306
Visualization-Based and Machine Learning-Based Analysis for Sentiment Analysis on Twitter Data
Cheng, R., & Jing, S. (2024) · International Conference on Applied Machine Learning (ICAML) · doi:10.1109/icaml64299.2024.00079
Ci, Q., Wang, W., Wu, C., Han, Y., Wang, Y., Chen, X., Lu, Y., Li, D., Chen, S., & Fu, J. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6118167
Bandwidth selectors on semiparametric Bayesian networks
Alejandre, V., Bielza, C., & Larrañaga, P. (2026) · Information Sciences · doi:10.1016/j.ins.2026.123198
Self-citationQasem, M. H., Ghaben, A., Bishtawi, T., Ibrahim, D. R., Mrayat, O. I. A., Alyanbaawi, A., Habeeb, F., & Atlam, E.-S. (2026) · Algorithms · doi:10.3390/a19030174 · Cited by 1
Design and Implementation of a Bayesian Classifier with Automatic Complexity Regulation
Hawas, E., & Ruz, G. A. (2025) · International Conference of the Chilean Computer Science Society (SCCC) · doi:10.1109/sccc67219.2025.11420388
INTERPLAY OF HUMAN CAPITAL AND SUSTAINABLE DEVELOPMENT: A NETWORK APPROACH
LIASHENKO, O., Shubala, I., & Dluhopolskyi, O. V. (2026) · JOURNAL OF EUROPEAN ECONOMY · doi:10.35774/jee2026.01.044
Luo, Z.-Y., Guo, L., Xu, T., Zhi, J., Zhang, Y. J., Huang, S.-N., Zheng, H., Lü, J., & Di, J.-Z. (2026) · BMC Psychology · doi:10.1186/s40359-026-04429-1
Alaoui-Belghiti, A. (2021) · theses.fr (ABES) · doi:10.70675/4159a0c9ze1caz4724z9296zf379ebec64dc · Cited by 1
A Backend-Agnostic Compiler for Approximate Query Processing with Probabilistic Tensor Algebra
Pan, J., Cheney, J., & Shaikhha, A. (2026) · Proceedings of the ACM on Management of Data · doi:10.1145/3802003
Ha, D. M. F., Schlender, T., van der Linden, Y. M., Bosman, P. A. N., & Alderliesten, T. (2026) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3795101.3814711
Probabilistic multi-label classification via a divide-and-conquer and fusion approach
Nguyen, V.-L., Hoang, X.-T., Hoang, A., & Huynh, V. (2026) · Information Fusion · doi:10.1016/j.inffus.2026.104517
Towards neurosymbolic network intrusion detection
Scaraggi, V., Passarella, A., & Conti, M. (2026) · IEEE International Conference on Smart Computing Workshops and Other Affiliated Events (SMARTCOMP Companion) · doi:10.1109/smartcomp-companion70724.2026.00063
Uchiyama, Y., Fujiki, S., Nomoto, K., Kawase, T., Aoyagi, K., Higuchi, Y., Nakano, J., & Kansaku, K. (2026) · Frontiers in Neuroscience · doi:10.3389/fnins.2026.1864936
Semiparametric Bayesian network classifiers
Li-Hu, C., Larrañaga, P., & Bielza, C. (2026) · Pattern Recognition · doi:10.1016/j.patcog.2026.114740
Self-citationFederated discretization for supervised classification
Flores, J. L., Calvo, B., & Pérez, A. (2026) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-026-01247-2
“Taking into account that we want to evaluate the performance of a discretization policy specifically for supervised classification problems, the evaluation will be based on the performance of a naive Bayes classifier (Bielza and Larrañaga 2014 ) trained on the disctretized data.”
Park, H., Park, Y.-S., & Park, S.-W. (2026) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2026.113586
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
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.