Next Article in Journal
On Extended d-D Kappa Distribution
Next Article in Special Issue
Resource Allocation and Minmax Scheduling Under Group Technology and Different Due-Window Assignments
Previous Article in Journal
Modal Regression Estimation by Local Linear Approach in High-Dimensional Data Case
Previous Article in Special Issue
Integrating Group Setup Time Deterioration Effects and Job Processing Time Learning Effects with Group Technology in Single-Machine Green Scheduling
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Hyper-Heuristic Algorithm for Bayesian Network Structure Learning Based on Feature Selection

School of Electronic and Information, Northwestern Polytechnical University, Xi’an 710129, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(7), 538; https://doi.org/10.3390/axioms14070538
Submission received: 30 March 2025 / Revised: 20 June 2025 / Accepted: 15 July 2025 / Published: 17 July 2025
(This article belongs to the Special Issue Advances in Mathematical Optimization Algorithms and Its Applications)

Abstract

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.
Keywords: Bayesian network; soft constraint; hard constraint; feature selection; hyper-heuristics Bayesian network; soft constraint; hard constraint; feature selection; hyper-heuristics

Share and Cite

MDPI and ACS Style

Dang, Y.; Gao, X.; Wang, Z. A Novel Hyper-Heuristic Algorithm for Bayesian Network Structure Learning Based on Feature Selection. Axioms 2025, 14, 538. https://doi.org/10.3390/axioms14070538

AMA Style

Dang Y, Gao X, Wang Z. A Novel Hyper-Heuristic Algorithm for Bayesian Network Structure Learning Based on Feature Selection. Axioms. 2025; 14(7):538. https://doi.org/10.3390/axioms14070538

Chicago/Turabian Style

Dang, Yinglong, Xiaoguang Gao, and Zidong Wang. 2025. "A Novel Hyper-Heuristic Algorithm for Bayesian Network Structure Learning Based on Feature Selection" Axioms 14, no. 7: 538. https://doi.org/10.3390/axioms14070538

APA Style

Dang, Y., Gao, X., & Wang, Z. (2025). A Novel Hyper-Heuristic Algorithm for Bayesian Network Structure Learning Based on Feature Selection. Axioms, 14(7), 538. https://doi.org/10.3390/axioms14070538

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop