Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Chickering, David Maxwell · 1996 · Lecture Notes in Statistics

Overview

Integrity signals

Registry

Crossref · 10.1007/978-1-4612-2404-4_12

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 5 references

Research works printed but not linked: 2

  1. 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.
  2. Heckerman, D., Geiger, D., and Chickering, D. (1995). Learning discrete Bayesian networks. Machine Learning, 20: 197–243.

Cited by

See all 1,001

Metadata

Authors
Chickering, D. M.
Affiliations
University of California, Los Angeles (US)
Corresponding author
Chickering, David Maxwell
Venue
Lecture Notes in Statistics
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.