The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
Efficient Structure Learning of Bayesian Networks using Constraints
Open accessAbstract
This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum Description Length (or Bayesian Information Criterion), Akaike Information Criterion and Bayesian Dirichlet Criterion. Then a branch-and-bound algorithm is presented that integrates structural constraints with data in a way to guarantee global optimality. As an example, structural constraints are used to map the problem of structure learning in Dynamic Bayesian networks into a corresponding augmented Bayesian network. Finally, we show empirically the benefits of using the properties with state-of-the-art methods and with the new algorithm, which is able to handle larger data sets than before.
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
Recognizing action units for facial expression analysis
Tian, Y.-I., Kanade, T., & Cohn, J. F. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.908962 · Cited by 1,745
Cited by
A survey of Bayesian Network structure learning
Kitson, N. K., Constantinou, A. C., Guo, Z., Liu, Y., & Chobtham, K. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10351-w · Cited by 379
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
A survey on Bayesian network structure learning from data
Scanagatta, M., Salmerón, A., & Stella, F. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00194-y · Cited by 274
Survey on Models and Techniques for Root-Cause Analysis
Solé, M., Muntés-Mulero, V., Rana, A. I., & Estrada, G. (2017) · arXiv · doi:10.48550/arxiv.1701.08546 · Cited by 74
A unified probabilistic framework for measuring the intensity of spontaneous facial action units
Li, Y., Mavadati, S. M., Mahoor, M. H., & Ji, Q. (2013) · 2013 10th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG) · doi:10.1109/fg.2013.6553757 · Cited by 36
Self-citation
Metadata
- Authors
- de Campos, C. P., & Ji, Q.
- Venue
- Research Portal (Queen's University Belfast)
- Publisher
- Queen's University Belfast
- Published
- 2011-02-01
- Volume
- 12
- Issue
- 20
- Pages
- 663-689
- DOI
- 10.5555/1953048.2021027
- OpenAlex
- W2249676289
- Cited by
- 246
- References
- 1
- FWCI
- 18.63
- 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: Efficient Structure Learning of Bayesian Networks using Constraints. https://app.cochat.ai/papers/10.5555/1953048.2021027
- The paper
- de Campos, C. P., & Ji, Q. (2011). Efficient Structure Learning of Bayesian Networks using Constraints. Research Portal (Queen's University Belfast). https://doi.org/10.5555/1953048.2021027
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.