An Algorithm for the Construction of Bayesian Network Structures from Data
Not on the map. Why?
Abstract (arXiv)
Previous algorithms for the construction of Bayesian belief network structures from data have been either highly dependent on conditional independence (CI) tests, or have required an ordering on the nodes to be supplied by the user. We present an algorithm that integrates these two approaches - CI tests are used to generate an ordering on the nodes from the database which is then used to recover the underlying Bayesian network structure using a non CI based method. Results of preliminary evaluation of the algorithm on two networks (ALARM and LED) are presented. We also discuss some algorithm performance issues and open problems.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Mar 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
5 papers.
- 2022Score matching enables causal discovery of nonlinear additive noise modelscited by 108
- 2021A survey of Bayesian Network structure learningcited by 85
- 2023Order-based Structure Learning with Normalizing Flowscited by 4
- 2023Neural Graph Revealerscited by 3
- 2026I-FLOP: Fast Learning of Order and Parents from Interventional Datacited by 1
- 2026I-FLOP: Fast Learning of Order and Parents from Interventional Data28 Aug 2026
- 2023Order-based Structure Learning with Normalizing Flows14 Aug 2023
- 2023Neural Graph Revealers27 Feb 2023
- 2022Score matching enables causal discovery of nonlinear additive noise models8 Mar 2022
- 2021A survey of Bayesian Network structure learning23 Sep 2021