The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Learning Bayesian Networks is NP-Complete
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“It should be noted that the search for the best BN is an NP-hard problem [84], and therefore heuristic methods are used for solving it.”
From Reverse engineering and identification in systems biology: strategies, perspectives and challenges (2014) · cites this paper as [84]
Citations
Cites
(1979) · Cited by 43,841
A Bayesian method for the induction of probabilistic networks from data
Cooper, G. F., & Herskovits, E. (1992) · Machine Learning · doi:10.1007/bf00994110 · Cited by 4,204
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Self-citationLearning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
Self-citationSome NP-complete problems on graphs
Gavril, F. (2011) · Cited by 77
Learning and robust learning of product distributions
Höffgen, K.-U. (1993) · Conference on Learning Theory · doi:10.1145/168304.168314 · Cited by 59
Research works printed but not linked: 2
- Chickering, D. M. (1995). A Transformational characterization of Bayesian network structures. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence,Montreal, QU. Morgan Kaufman.
- Heckerman, D., Geiger, D., and Chickering, D. (1995). Learning discrete Bayesian networks. Machine Learning, 20: 197–243.
Cited by
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Using Bayesian Networks to Analyze Expression Data
Friedman, N., Linial, M., Nachman, I., & Pe'er, D. (2000) · Journal of Computational Biology · doi:10.1089/106652700750050961 · Cited by 3,266
Margolin, A. A., Nemenman, I., Basso, K., Wiggins, C., Stolovitzky, G., Favera, R. D., & Califano, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-s1-s7 · Cited by 2,420
Stochastic Backpropagation and Approximate Inference in Deep Generative Models
Rezende, D. J., Mohamed, S., & Wierstra, D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.4082 · Cited by 2,405
Margolin, A. A., Nemenman, I. M., Basso, K., Wiggins, C. H., Stolovitzky, G. A., Favera, R. D., & Califano, A. (2006) · BMC Bioinformatics · doi:10.7916/d8g15zbp · Cited by 2,246
Metadata
- Authors
- Chickering, D. M.
- Affiliations
- University of California, Los Angeles (US)
- Corresponding author
- Chickering, David Maxwell
- Venue
- Lecture Notes in Statistics
- Publisher
- Springer New York
- Published
- 1996
- Pages
- 121-130
- ISSN
- 0930-0325 (ISSN-L)
- OpenAlex
- W1530964327
- Cited by
- 1,001
- References
- 5
- Citations by year
- 2026: 15 · 2025: 29 · 2024: 18 · 2023: 30 · 2022: 27 · 2021: 58 · 2020: 64 · 2019: 40 · 2018: 39 · 2017: 46 · 2016: 33 · 2015: 64 · 2014: 64 · 2013: 79 · 2012: 70
- FWCI
- 7.73
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in statistics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- Bayesian network structure learning, NP-completeness, search complexity, computational complexity, posterior probability
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: Learning Bayesian Networks is NP-Complete. https://app.cochat.ai/papers/10.1007/978-1-4612-2404-4_12
- The paper
- Chickering, D. M. (1996). Learning Bayesian Networks is NP-Complete. Lecture Notes in Statistics. https://doi.org/10.1007/978-1-4612-2404-4_12
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.