Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 2,017

The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.

Learning Bayesian networks: The combination of knowledge and statistical data

Open access
Heckerman, David, Geiger, Dan, Chickering, David M.·1995·Machine Learning

Abstract

We describe a Bayesian approach for learning Bayesian networks from a combination of prior knowledge and statistical data. First and foremost, we develop a methodology for assessing informative priors needed for learning. Our approach is derived from a set of assumptions made previously as well as the assumption oflikelihood equivalence, which says that data should not help to discriminate network structures that represent the same assertions of conditional independence. We show that likelihood equivalence when combined with previously made assumptions implies that the user's priors for network parameters can be encoded in a single Bayesian network for the next case to be seen—aprior network—and a single measure of confidence for that network. Second, using these priors, we show how to compute the relative posterior probabilities of network structures given data. Third, we describe search methods for identifying network structures with high posterior probabilities. We describe polynomial algorithms for finding the highest-scoring network structures in the special case where every node has at mostk=1 parent. For the general case (k>1), which is NP-hard, we review heuristic search algorithms including local search, iterative local search, and simulated annealing. Finally, we describe a methodology for evaluating Bayesian-network learning algorithms, and apply this approach to a comparison of various approaches.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1007/bf00994016

Cites

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

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 51 references

Research works printed but not linked: 7

  1. Chickering, D. (March, 1995b). Search operators for learning equivalence classes of Bayesian- network structures. Technical Report R231, Cognitive Systems Laboratory, University of California, Los Angeles.
  2. Edmonds, J. (1967). Optimum brachching.J. Res. NBS 71B:233?240.
  3. Gabow, H. (1977). Siam journal of computing.Networks 6:139?150.
  4. Good, I. (1965).The Estimation of Probabilities. MIT Press, Cambridge, MA.
  5. Howard, R. & Matheson, J. (1981). Influence diagrams. In Howard, R. and Matheson, J., editors,Readings on the Principles and Applications of Decision Analysis, volume II, pages 721?762. Strategic Decisions Group, Menlo Park, CA.
  6. Matzkevich, I. & Abramson, B. (1993). Deriving a minimal I-map of a belief network relative to a target ordering of its nodes. InProceedings of Ninth Conference on Uncertainty in Artificial Intelligence, Washington, DC, pages 159?165. Morgan Kaufmann.
  7. York, J. (1992).Bayesian methods for the analysis of misclassified or incomplete multivariate discrete data. PhD thesis. Department of Statistics, University of Washington, Seattle.

Cited by

Metadata

Authors
Heckerman, D., Geiger, D., & Chickering, D. M.
Venue
Machine Learning
Published
1995-09
Volume
20
Issue
3
Pages
197-243
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W1517993545
Cited by
2,017
References
51
FWCI
27.77
Type
journal article
Language
en
Open access
bronze
Licence
www.springer.com/tdm (tdm)

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.