The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Learning Optimal Bayesian Networks: A Shortest Path Perspective
Open accessAbstract
In this paper, learning a Bayesian network structure that optimizes a scoring function for a given dataset is viewed as a shortest path problem in an implicit state-space search graph. This perspective highlights the importance of two research issues: the development of search strategies for solving the shortest path problem, and the design of heuristic functions for guiding the search. This paper introduces several techniques for addressing the issues. One is an A* search algorithm that learns an optimal Bayesian network structure by only searching the most promising part of the solution space. The others are mainly two heuristic functions. The first heuristic function represents a simple relaxation of the acyclicity constraint of a Bayesian network. Although admissible and consistent, the heuristic may introduce too much relaxation and result in a loose bound. The second heuristic function reduces the amount of relaxation by avoiding directed cycles within some groups of variables. Empirical results show that these methods constitute a promising approach to learning optimal Bayesian network structures.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Bozdogan, H. (1987) · Psychometrika · doi:10.1007/bf02294361 · Cited by 4,468
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_38 · Cited by 3,028
Learning Bayesian networks is NP-complete
Chickering, D. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_12 · Cited by 1,001
Learning 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
Cited by
Optimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
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
- Yuan, C., & Malone, B.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2013-10-16
- Volume
- 48
- Pages
- 23-65
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2118196167
- Cited by
- 163
- References
- 6
- FWCI
- 18.41
- Type
- journal article
- Language
- en
- Open access
- diamond
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 Optimal Bayesian Networks: A Shortest Path Perspective. https://app.cochat.ai/papers/10.1613/jair.4039
- The paper
- Yuan, C., & Malone, B. (2013). Learning Optimal Bayesian Networks: A Shortest Path Perspective. Journal of Artificial Intelligence Research. https://doi.org/10.1613/jair.4039
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.