Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 3,231

The DOI matches its Crossref record; 2 of the 2 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
DOI 10.1023/a:1022623210503
Open this paper in CoChat — free account

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.1023/a:1022623210503

Cites

2 of 2 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 2 references

Research works printed but not linked: 49

  1. Aczel, J. (1966). Lectures on Functional Equations and Their Applications. Academic Press, New York.
  2. Beinlich, I., Suermondt, H., Chavez, R., & Cooper, G. (1989). The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In Proceedings of the Second European Conference on Artificial Intelligence in Medicine, London. Springer Verlag, Berlin.
  3. Buntine, W. (1991). Theory refinement on Bayesian networks. In Proceedings of Seventh Conference on Uncertainty in Artificial Intelligence, Los Angeles, CA, pages 52–60. Morgan Kaufmann. · DOI · Paper page
  4. Camerini, P. & Maffioli, L. F. F. (1980). The κ best spanning arborescences of a network. Networks, 10:91–110. · DOI
  5. Chickering, D. (1995a). A transformational characterization of equivalent Bayesian-network structures. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, pages 87–98. Morgan Kaufmann.
  6. 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.
  7. Chickering, D., Geiger, D., & Heckerman, D. (1995). Learning Bayesian networks: Search methods and experimental results. In Proceedings of Fifth Conference on Artificial Intelligence and Statistics, Ft. Lauderdale, FL, pages 112–128. Society for Artificial Intelligence in Statistics.
  8. Chow, C. & Liu, C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462–467. · DOI · Paper page
  9. Cooper, G. & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309–347. · doi:10.1023/a:1022649401552 · Paper page
  10. Dawid, A. & Lauritzen, S. (1993). Hyper Markov laws in the statistical analysis of decomposable graphical models. Annals of Statistics, 21:1272–1317.
  11. de Finetti, B. (1937). La prévision: See lois logiques, ses sources subjectives. Annales de l'Institut Henri Poincaré, 7:1–68. Translated in Kyburg and Smokler, 1964.
  12. Druzdzel, M. & Simon, H. (1993). Causality in Bayesian belief networks. In Proceedings of Ninth Conference on Uncertainty in Artificial Intelligence, Washington, DC, pages 3–11. Morgan Kaufmann. · DOI
  13. Edmonds, J. (1967). Optimum brachching. J. Res. NBS, 71B:233–240.
  14. Evans, J. & Minieka, E. (1991). Optimization algorithms for networks and graphs. Marcel Dekker Inc., New York.
  15. Gabow, H. (1977). Siam journal of computing. Networks, 6:139–150.
  16. Gabow, H., Galil, Z., & Spencer, T. (1984). Efficient implementation of graph algorithms using contraction. In Proceedings of FOCS. · DOI
  17. Geiger, D. & Heckerman, D. (1994). Learning Gaussian networks. In Proceedings of Tenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA, pages 235–243. Morgan Kaufmann. · DOI · Paper page
  18. Geiger, D. & Heckerman, D. (1995). A characterization of the Dirichlet distribution with application to learning Bayesian networks. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, pages 196–207. Morgan Kaufmann.
  19. Good, I. (1965). The Estimation of Probabilities. MIT Press, Cambridge, MA.
  20. Heckerman, D. (1995). A Bayesian approach for learning causal networks. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, pages 285–295. Morgan Kaufmann.
  21. Heckerman, D. & Geiger, D. (1995). Learning Bayesian networks: A unification for discrete and Gaussian domains. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, pages 274–284. Morgan Kaufmann.
  22. Heckerman, D., Geiger, D., & Chickering, D. (1994). Learning Bayesian networks: The combination of knowledge and statistical data. In Proceedings of Tenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA, pages 293–301. Morgan Kaufmann. · DOI · Paper page
  23. Heckerman, D. & Nathwani, B. (1992). An evaluation of the diagnostic accuracy of Pathfinder. Computers and Biomedical Research, 25:56–74. · DOI
  24. Heckerman, D. & Shachter, R. (1995). A definition and graphical representation of causality. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, QU, pages 262–273. Morgan Kaufmann.
  25. Höffgen, K. (revised 1993). Learning and robust learning of product distributions. Technical Report 464, Fachbereich Informatik, Universität Dortmund. · DOI
  26. Horvitz, E. (1987). Reasoning about beliefs and actions under computational resource constraints. In Proceedings of the Third Workshop on Uncertainty in Artificial Intelligence, Seattle, WA. Association for Uncertainty in Artificial Intelligence, Mountain View, CA. Also in Kanal, L., Levitt, T., and Lemmer, J., editors, Uncertainty in Artificial Intelligence 3, pages 301–324. North-Holland, New York, 1989.
  27. Howard, R. (1988). Uncertainty about probability: A decision-analysis perspective. Risk Analysis, 8:91–98. · DOI
  28. 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.
  29. Johnson (1985). How fast is local search? In FOCS, pages 39–42. · DOI
  30. Karp, R. (1971). A simple derivation of Edmond's algorithm for optimal branchings. Networks, 1:265–272. · DOI
  31. Korf, R. (1993). Linear-space best-first search. Artificial Intelligence, 62:41–78. · DOI · Paper page
  32. Kullback, S. & Leibler, R. (1951). Information and sufficiency. Ann. Math. Statistics, 22:79–86. · DOI · Paper page
  33. Kyburg, H. & Smokler, H. (1964). Studies in Subjective Probability. Wiley and Sons, New York.
  34. Lam, W. & Bacchus, F. (1993). Using causal information and local measures to learn Bayesian networks. In Proceedings of Ninth Conference on Uncertainty in Artificial Intelligence, Washington, DC, pages 243–250. Morgan Kaufmann. · DOI
  35. Lauritzen, S. (1982). Lectures on Contingency Tables. University of Aalborg Press, Aalborg, Denmark.
  36. Matzkevich, I. & Abramson, B. (1993). Deriving a minimal I-map of a belief network relative to a target ordering of its nodes. In Proceedings of Ninth Conference on Uncertainty in Artificial Intelligence, Washington, DC, pages 159–165. Morgan Kaufmann. · DOI
  37. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., & Teller, E. (1953). Journal of Chemical Physics, 21:1087–1092. · DOI · Paper page
  38. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
  39. Pearl, J. & Verma, T. (1991). A theory of inferred causation. In Allen, J., Fikes, R., and Sandewall, E., editors, Knowledge Representation and Reasoning: Proceedings of the Second International Conference, pages 441–452. Morgan Kaufmann, New York.
  40. Spiegelhalter, D., Dawid, A., Lauritzen, S., & Cowell, R. (1993). Bayesian analysis in expert systems. Statistical Science, 8:219–282.
  41. Spiegelhalter, D. & Lauritzen, S. (1990). Sequential updating of conditional probabilities on directed graphical structures. Networks, 20:579–605. · DOI · Paper page
  42. Spirtes, P., Glymour, C., & Scheines, R. (1993). Causation, Prediction, and Search. Springer-Verlag, New York. · DOI · Paper page
  43. Spirtes, P. & Meek, C. (1995). Learning Bayesian networks with discrete variables from data. In Proceedings of First International Conference on Knowledge Discovery and Data Mining, Montreal, QU. Morgan Kaufmann.
  44. Suzuki, J. (1993). A construction of Bayesian networks from databases based on an MDL scheme. In Proceedings of Ninth Conference on Uncertainty in Artificial Intelligence, Washington, DC, pages 266–273. Morgan Kaufmann. · DOI
  45. Tarjan, R. (1977). Finding optimal branchings. Networks, 7:25–35. · DOI · Paper page
  46. Titterington, D. (1976). Updating a diagnostic system using unconfirmed cases. Applied Statistics, 25:238–247. · DOI
  47. Verma, T. & Pearl, J. (1990). Equivalence and synthesis of causal models. In Proceedings of Sixth Conference on Uncertainty in Artificial Intelligence, Boston, MA, pages 220–227. Morgan Kaufmann.
  48. Winkler, R. (1967). The assessment of prior distributions in Bayesian analysis. American Statistical Association Journal, 62:776–800. · DOI · Paper page
  49. 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

See all 3,231

Metadata

Authors
Heckerman, D., Geiger, D., & Chickering, D. M.
Venue
Machine Learning
Publisher
Springer Science and Business Media LLC
Published
1995-09
Volume
20
Issue
3
Pages
197-243
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
DOI
10.1023/a:1022623210503
OpenAlex
W2170112109
Cited by
3,231
References
2
FWCI
46.92
Type
journal article
Language
en
Open access
bronze
Licence

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: The Combination of Knowledge and Statistical Data. https://app.cochat.ai/papers/10.1023/a:1022623210503
The paper
Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian Networks: The Combination of Knowledge and Statistical Data. Machine Learning. https://doi.org/10.1023/a%3A1022623210503

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.