The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Learning Bayesian networks: approaches and issues
Open accessAbstract
Bayesian networks have become a widely used method in the modelling of uncertain knowledge. Owing to the difficulty domain experts have in specifying them, techniques that learn Bayesian networks from data have become indispensable. Recently, however, there have been many important new developments in this field. This work takes a broad look at the literature on learning Bayesian networks—in particular their structure—from data. Specific topics are not focused on in detail, but it is hoped that all the major fields in the area are covered. This article is not intended to be a tutorial—for this, there are many books on the topic, which will be presented. However, an effort has been made to locate all the relevant publications, so that this paper can be used as a ready reference to find the works on particular sub-topics.
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.
Integrity signals
Registry
Cites
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.
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
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Hoeting, J. A., Madigan, D., Raftery, A. E., & Volinsky, C. T. (1999) · Statistical Science · doi:10.1214/ss/1009212519 · Cited by 4,118 · cited 1×
“A good introduction to these ideas, that looks at model averaging in general, can be found in Hoeting et al. (1999).”
BackgroundAn Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
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 2×
“One of the earliest algorithms used to find Bayesian network structures to average over, was provided by Madigan and Raftery (1994) with their Occam’s window principle.”
MethodA model for reasoning about persistence and causation
Dean, T., & Kanazawa, K. (1989) · Computational Intelligence · doi:10.1111/j.1467-8640.1989.tb00324.x · Cited by 999
Cited by
Farahani, F. V., Karwowski, W., & Lighthall, N. R. (2019) · Frontiers in Neuroscience · doi:10.3389/fnins.2019.00585 · Cited by 718
In silico methods for drug repurposing and pharmacology
Hodos, R. A., Kidd, B. A., Shameer, K., Readhead, B. P., & Dudley, J. T. (2016) · WIREs Systems Biology and Medicine · doi:10.1002/wsbm.1337 · Cited by 326
Ren, F., Wei, J., Chen, Q., Hu, M., Yu, L., Mi, J., Zhou, X., Qin, D., Wu, J., & Wu, A. (2025) · Acta Pharmaceutica Sinica B · doi:10.1016/j.apsb.2025.07.030 · Cited by 97
Causal Structure Learning: A Combinatorial Perspective
Squires, C., & Uhler, C. (2023) · Foundations of Computational Mathematics · doi:10.1007/s10208-022-09581-9 · Cited by 31
Metadata
- Authors
- Daly, R., Shen, Q., & Aitken, S.
- Venue
- The Knowledge Engineering Review
- Publisher
- Maximum Academic Press
- Published
- 2011-05-12
- Volume
- 26
- Issue
- 2
- Pages
- 99-157
- ISSN
- 0269-8889 (ISSN-L)
- 1469-8005
- OpenAlex
- W2171620180
- Cited by
- 319
- References
- 7
- FWCI
- 16.56
- Type
- journal article
- Language
- en
- Open access
- green
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: approaches and issues. https://app.cochat.ai/papers/10.1017/s0269888910000251
- The paper
- Daly, R., Shen, Q., & Aitken, S. (2011). Learning Bayesian networks: approaches and issues. The Knowledge Engineering Review. https://doi.org/10.1017/s0269888910000251
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.