A Comprehensively Improved Hybrid Algorithm for Learning Bayesian Networks: Multiple Compound Memory Erasing
Not on the map. Why?
Abstract (arXiv)
Using a Bayesian network to analyze the causal relationship between nodes is a hot spot. The existing network learning algorithms are mainly constraint-based and score-based network generation methods. The constraint-based method is mainly the application of conditional independence (CI) tests, but the inaccuracy of CI tests in the case of high dimensionality and small samples has always been a problem for the constraint-based method. The score-based method uses the scoring function and search strategy to find the optimal candidate network structure, but the search space increases too much with the increase of the number of nodes, and the learning efficiency is very low. This paper presents a new hybrid algorithm, MCME (multiple compound memory erasing). This method retains the advantages of the first two methods, solves the shortcomings of the above CI tests, and makes innovations in the scoring function in the direction discrimination stage. A large number of experiments show that MCME has better or similar performance than some existing algorithms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 41 references that are in the map. First posted on arXiv 5 Dec 2022.
Builds on
5 of 41 references.
References · 5
- 2013Learning Bayesian Networks: The Combination of Knowledge and Statistical Datacited by 185
- 2020Large-scale empirical validation of Bayesian Network structure learning algorithms with noisy datacited by 29
- 2013The Recovery of Causal Poly-Trees from Statistical Datacited by 19
- 2014The Grow-Shrink strategy for learning Markov network structures constrained by context-specific independencescited by 4
- 2013A Hybrid Anytime Algorithm for the Constructiion of Causal Models From Sparse Datacited by 1
Built on by
Not cited yet.