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).”
BackgroundMethod
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
Items 101–113 of 113
Duering, M., Gonik, M., Malik, R., Zieren, N., Reyes, S., Jouvent, E., Hervé, D., Gschwendtner, A., Opherk, C., Chabriat, H., et al. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2012.10.084 · Cited by 89
Learning Spatiotemporal Failure Dependencies for Resilient Edge Computing Services
Aral, A., & Brandic, I. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3046188 · Cited by 68
Faisal, A., Dondelinger, F., Husmeier, D., & Beale, C. M. (2010) · Ecological Informatics · doi:10.1016/j.ecoinf.2010.06.005 · Cited by 61
Marini, S., Trifoglio, E., Barbarini, N., Sambo, F., Di Camillo, B., Malovini, A., Manfrini, M., Cobelli, C., & Bellazzi, R. (2015) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2015.08.021 · Cited by 61
Modeling asynchronous event sequences with RNNs
Wu, S., Liu, S., Sohn, S., Moon, S., Wi, C.-I., Juhn, Y., & Liu, H. (2018) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2018.05.016 · Cited by 45
Binary Classifier Calibration Using an Ensemble of Near Isotonic Regression Models
Naeini, M. P., & Cooper, G. F. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0047 · Cited by 46
Realization of a service for the long-term risk assessment of diabetes-related complications
Lagani, V., Chiarugi, F., Manousos, D., Verma, V., Fursse, J., Marias, K., & Tsamardinos, I. (2015) · Journal of Diabetes and its Complications · doi:10.1016/j.jdiacomp.2015.03.011 · Cited by 34
A Bayesian Belief Network to assess rate of changes in coral reef ecosystems
Franco, C., Hepburn, L. A., Smith, D. J., Nimrod, S., & Tucker, A. (2016) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2016.02.029 · Cited by 25
Binary Classifier Calibration Using a Bayesian Non-Parametric Approach
Naeini, M. P., Cooper, G. F., & Hauskrecht, M. (2015) · Proceedings of the 2015 SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.24 · Cited by 19
Discovering study-specific gene regulatory networks
Bo, V., Curtis, T., Lysenko, A., Saqi, M., Swift, S., & Tucker, A. (2014) · PLoS ONE · doi:10.1371/journal.pone.0106524 · Cited by 10
Causal analysis of network logs with layered protocols and topology knowledge
Kobayashi, S., Otomo, K., & Fukuda, K. (2019) · 2019 15th International Conference on Network and Service Management (CNSM) · doi:10.23919/cnsm46954.2019.9012718 · Cited by 13
Modeling Uncertainty by Learning a Hierarchy of Deep Neural Connections
Rohekar, R. Y., Gurwicz, Y., Nisimov, S., & Novik, G. (2019) · arXiv · doi:10.48550/arxiv.1905.13195 · Cited by 10
(2014) · International Conference on Artificial Intelligence and Statistics · Cited by 3
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.