Answers are grounded in this paper and cite their sources.
Experimental study shows this hyper-heuristic algorithm improves structure learning in Bayesian networks, suggesting enhanced accuracy and robustness.
Bayesian networks (BNs) are effective and universal tools for addressing uncertain knowledge. BN learning includes structure learning and parameter learning, and structure learning is its core. The topology of a BN can be determined by expert domain knowledge or obtained through data analysis. However, when many variables exist in a BN, relying only on expert knowledge is difficult and infeasible. Therefore, the current research focus is to build a BN via data analysis. However, current data learning methods have certain limitations. In this work, we consider a combination of expert knowledge and data learning methods. In our algorithm, the hard constraints are derived from highly reliable expert knowledge, and some conditional independent information is mined by feature selection as a soft constraint. These structural constraints are reasonably integrated into an exponential Monte Carlo with counter (EMCQ) hyper-heuristic algorithm. A comprehensive experimental study demonstrates that our proposed method exhibits more robustness and accuracy compared to alternative algorithms.
No takes yet. Share an insight, caveat, or question.
Dang et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: