The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Open accessOverview
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.
Integrity signals
Registry
Cites
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.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
(1988) · Cited by 16,582
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
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
Lectures on Functional Equations and their Applications.
Hahn, F., Aczel, J., & Oser, H. (1968) · The American Mathematical Monthly · doi:10.2307/2314998 · Cited by 2,594
Approximating discrete probability distributions with dependence trees
Chow, C., & Liu, C. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054142 · Cited by 1,720
Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
Madigan, D., & Raftery, A. E. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476894 · Cited by 1,205 · cited 3×
“Other methods for escaping local maxima include best-first search (Korf, 1993) and Gibbs' sampling (e.g., Madigan & Raftery, 1994).”
BackgroundMethodLectures on Functional Equations and Their Applications
Aczél, J., & Oser, H. (2006) · Cited by 993
Equivalence and Synthesis of Causal Models
Verma, T., & Pearl, J. (2022) · Probabilistic and Causal Inference · doi:10.1145/3501714.3501732 · Cited by 964
Beinlich, I. A., Suermondt, H. J., Chavez, R. M., & Cooper, G. F. (1989) · Lecture Notes in Medical Informatics · doi:10.1007/978-3-642-93437-7_28 · Cited by 724
Bayesian Analysis in Expert Systems
Spiegelhalter, D. J., Dawid, A. P., Lauritzen, S. L., & Cowell, R. G. (1993) · Statistical Science · doi:10.1214/ss/1177010888 · Cited by 684
Theory Refinement on Bayesian Networks
Buntine, W. (1991) · Uncertainty Proceedings 1991 · doi:10.1016/b978-1-55860-203-8.50010-3 · Cited by 647
(2014) · SIAM Journal on Computing · doi:10.1137/sicomp · Cited by 618
(1991) · Cited by 563
Sequential updating of conditional probabilities on directed graphical structures
Spiegelhalter, D. J., & Lauritzen, S. L. (1990) · Networks · doi:10.1002/net.3230200507 · Cited by 521
Hyper Markov Laws in the Statistical Analysis of Decomposable Graphical Models
Dawid, A. P., & Lauritzen, S. L. (1993) · The Annals of Statistics · doi:10.1214/aos/1176349260 · Cited by 479
Studies in Subjective Probability
Huber, P. J., Kyburg, H. E., & Smokler, H. E. (1966) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1401270 · Cited by 468
The Assessment of Prior Distributions in Bayesian Analysis
Winkler, R. L. (1967) · Journal of the American Statistical Association · doi:10.1080/01621459.1967.10500894 · Cited by 430
Geiger, D., & Heckerman, D. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50035-3 · Cited by 426
Self-citationOptimization Algorithms for Networks and Graphs.
Coullard, C. R., Evans, J. R., & Minieka, E. (1994) · Mathematics of Computation · doi:10.2307/2153592 · Cited by 419
Tarjan, R. E. (1977) · Networks · doi:10.1002/net.3230070103 · Cited by 365
Reasoning about beliefs and actions under computational resource constraints
(1988) · International Journal of Approximate Reasoning · doi:10.1016/0888-613x(88)90148-x · Cited by 309
Linear-space best-first search
Korf, R. E. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90045-d · Cited by 305
A Transformational Characterization of Equivalent Bayesian Network Structures
Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4938 · Cited by 296
Self-citationLearning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50042-0 · Cited by 261
Self-citationModel Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
Madigan, D., & Raftery, A. E. (1994) · Journal of the American Statistical Association · doi:10.2307/2291017 · Cited by 212
Learning Bayesian Networks: Search Methods and Experimental Results
Chickering, M., Geiger, D., & Heckerman, D. E. (1995) · Cited by 211
Self-citationLearning Bayesian networks with discrete variables from data
Spirtes, P., & Meek, C. (1995) · Cited by 162
A Construction of Bayesian Networks from Databases Based on an MDL Principle
Suzuki, J. (1993) · Uncertainty in Artificial Intelligence · doi:10.1016/b978-1-4832-1451-1.50037-8 · Cited by 150
A Bayesian Approach to Learning Causal Networks
Heckerman, D. E. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511611308.012 · Cited by 141
Self-citationLearning Bayesian Networks: A Unification for Discrete and Gaussian DomainsPreprint
Heckerman, D. E., & Geiger, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4957 · Cited by 135
Self-citationCausality in Bayesian Belief Networks
Drużdżel, M. J., & Simon, H. A. (1993) · Uncertainty in Artificial Intelligence · doi:10.1016/b978-1-4832-1451-1.50005-6 · Cited by 131
A simple derivation of edmonds' algorithm for optimum branchings
Karp, R. M. (1971) · Networks · doi:10.1002/net.3230010305 · Cited by 97
Lectures on Contingency Tables
Lauritzen, S. L. (2002) · Cited by 86
Uncertainty about Probability: A Decision Analysis Perspective
Howard, R. A. (1988) · Risk Analysis · doi:10.1111/j.1539-6924.1988.tb01156.x · Cited by 71
Using Causal Information and Local Measures to Learn Bayesian Networks
Lam, W. P., & Bacchus, F. (1993) · Uncertainty in Artificial Intelligence · doi:10.1016/b978-1-4832-1451-1.50034-2 · Cited by 67
An evaluation of the diagnostic accuracy of Pathfinder
Heckerman, D. E., & Nathwani, B. N. (1992) · Computers and Biomedical Research · doi:10.1016/0010-4809(92)90035-9 · Cited by 62
Self-citationLearning and robust learning of product distributions
Höffgen, K.-U. (1993) · Conference on Learning Theory · doi:10.1145/168304.168314 · Cited by 59
Updating a Diagnostic System Using Unconfirmed Cases
Titterington, D. M. (1976) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2347231 · Cited by 56
A Characterization of the Dirichlet Distribution with Application to Learning Bayesian Networks
Geiger, D., & Heckerman, D. E. (1996) · Springer eBooks · doi:10.1007/978-94-011-5430-7_7 · Cited by 53
Self-citationReasoning About Beliefs and Actions Under Computational Resource ConstraintsPreprint
Horvitz, E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.2759 · Cited by 51
The k best spanning arborescences of a network
Camerini, P. M., Fratta, L., & Maffioli, F. (1980) · Networks · doi:10.1002/net.3230100202 · Cited by 47
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.31 · Cited by 47
Efficient Implementation Of Graph Algorithms Using Contraction
Gabow, H. N., Galil, Z., & Spencer, T. H. (1984) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715935 · Cited by 39
A Definition and Graphical Representation for CausalityPreprint
Heckerman, D. E., & Shachter, R. D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4956 · Cited by 17
Self-citationMatzkevich, I., & Abramson, B. D. (1993) · Uncertainty in Artificial Intelligence · doi:10.1016/b978-1-4832-1451-1.50024-x · Cited by 14
Research works printed but not linked: 7
- 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.
- 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.
- Edmonds, J. (1967). Optimum brachching. J. Res. NBS, 71B:233–240.
- Gabow, H. (1977). Siam journal of computing. Networks, 6:139–150.
- Good, I. (1965). The Estimation of Probabilities. MIT Press, Cambridge, MA.
- 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.
- 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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Self-citationHoeting, J. A., Madigan, D., Raftery, A. E., & Volinsky, C. T. (1999) · Statistical Science · doi:10.1214/ss/1009212519 · Cited by 4,118
Bayesian Networks and Decision Graphs
Jensen, F. V., & Nielsen, T. D. (2007) · Information Science and Statistics · doi:10.1007/978-0-387-68282-2 · Cited by 4,129
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
- W2170112109
- Cited by
- 3,231
- References
- 49
- FWCI
- 46.92
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
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.