CoChat

Discrete Bayesian Network Classifiers: A Survey

Open access
Bielza, Concha, Larrañaga, Pedro · 2014 · ACM Computing Surveys

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2576868

Cites

191 of 191 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 191 references

Research works printed but not linked: 16

  1. 10.5555/2073946.2073952 · doi:10.5555/2073946.2073952
  2. 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.
  3. 10.5555/2100662.2100669 · doi:10.5555/2100662.2100669
  4. 10.5555/1781238.1781244 · doi:10.5555/1781238.1781244
  5. 10.5555/1005332.1044703 · doi:10.5555/1005332.1044703
  6. 10.1023/A:1022649401552 · doi:10.1023/a:1022649401552 · Paper page
  7. 10.5555/2010978.2010980 · doi:10.5555/2010978.2010980
  8. International Statistical Review 69 3 (2001) 385--398. · DOI · Paper page
  9. 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. 10.5555/645323.649601 · doi:10.5555/645323.649601
  11. 10.5555/647301.721482 · doi:10.5555/647301.721482
  12. 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.
  13. 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.
  14. 10.5555/3121646.3121662 · doi:10.5555/3121646.3121662
  15. 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.
  16. 10.5555/645326.649714 · doi:10.5555/645326.649714

Cited by

See all 248

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
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
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.