{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T01:44:47Z","timestamp":1775612687781,"version":"3.50.1"},"reference-count":41,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Nature Science Foundation of China","award":["61573285"],"award-info":[{"award-number":["61573285"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Bayesian Networks structure learning (BNSL) is a troublesome problem that aims to search for an optimal structure. An exact search tends to sacrifice a significant amount of time and memory to promote accuracy, while the local search can tackle complex networks with thousands of variables but commonly gets stuck in a local optimum. In this paper, two novel and practical operators and a derived operator are proposed to perturb structures and maintain the acyclicity. Then, we design a framework, incorporating an influential perturbation factor integrated by three proposed operators, to escape current local optimal and improve the dilemma that outcomes trap in local optimal. The experimental results illustrate that our algorithm can output competitive results compared with the state-of-the-art constraint-based method in most cases. Meanwhile, our algorithm reaches an equivalent or better solution found by the state-of-the-art exact search and hybrid methods.<\/jats:p>","DOI":"10.3390\/e23060750","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T11:00:33Z","timestamp":1623754833000},"page":"750","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Local Search with Momentum for Bayesian Networks Structure Learning"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0009-1008","authenticated-orcid":false,"given":"Xiaohan","family":"Liu","sequence":"first","affiliation":[{"name":"School of Electronics and Information, Northwestern Polytechnical University, Xi\u2019an 710129, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoguang","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Electronics and Information, Northwestern Polytechnical University, Xi\u2019an 710129, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zidong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electronics and Information, Northwestern Polytechnical University, Xi\u2019an 710129, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinxin","family":"Ru","sequence":"additional","affiliation":[{"name":"School of Electronics and Information, Northwestern Polytechnical University, Xi\u2019an 710129, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"ref_1","unstructured":"Pearl, J. (2014). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Elsevier."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/69.868904","article-title":"Constructing Bayesian networks for medical diagnosis from incomplete and partially correct statistics","volume":"12","author":"Nikovski","year":"2000","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"779","DOI":"10.2174\/138161213804581936","article-title":"Exploring patterns of epigenetic information with data mining techniques","volume":"19","author":"Gestal","year":"2013","journal-title":"Curr. Pharm. Des."},{"key":"ref_4","unstructured":"Maas, R., Huemmer, C., Hofmann, C., and Kellermann, W. (2014, January 24\u201326). On Bayesian networks in speech signal processing. Proceedings of the Speech Communication; 11. ITG Symposium, Erlangen, Germany."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.knosys.2013.01.003","article-title":"Assessment of adaptive human\u2013robot interactions","volume":"42","author":"Sekmen","year":"2013","journal-title":"Knowl.-Based Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1756-0381-6-6","article-title":"Using Bayesian networks to discover relations between genes, environment, and disease","volume":"6","author":"Su","year":"2013","journal-title":"Biodata Min."},{"key":"ref_7","first-page":"1287","article-title":"Large-sample learning of Bayesian networks is NP-hard","volume":"5","author":"Chickering","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Spirtes, P., Glymour, C.N., Scheines, R., and Heckerman, D. (2000). Causation, Prediction, and Search, MIT Press.","DOI":"10.7551\/mitpress\/1754.001.0001"},{"key":"ref_9","first-page":"3741","article-title":"Order-independent constraint-based causal structure learning","volume":"15","author":"Colombo","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","article-title":"The max-min hill-climbing Bayesian network structure learning algorithm","volume":"65","author":"Tsamardinos","year":"2006","journal-title":"Mach. Learn."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ijar.2019.10.003","article-title":"Who learns better Bayesian network structures: Accuracy and speed of structure learning algorithms","volume":"115","author":"Scutari","year":"2019","journal-title":"Int. J. Approx. Reason."},{"key":"ref_12","first-page":"549","article-title":"Exact Bayesian structure discovery in Bayesian networks","volume":"5","author":"Koivisto","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"ref_13","unstructured":"Silander, T., and Myllymaki, P. (2012). A simple approach for finding the globally optimal Bayesian network structure. arXiv."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"106515","DOI":"10.1016\/j.knosys.2020.106515","article-title":"Learning Bayesian networks based on order graph with ancestral constraints","volume":"211","author":"Wang","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"ref_15","first-page":"663","article-title":"Efficient structure learning of Bayesian networks using constraints","volume":"12","author":"Ji","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref_16","unstructured":"Cussens, J. (2012). Bayesian network learning with cutting planes. arXiv."},{"key":"ref_17","unstructured":"Jaakkola, T., Sontag, D., Globerson, A., and Meila, M. (2010, January 13\u201315). Learning Bayesian network structure using LP relaxations. Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, Sardinia, Italy."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Guo, Z., and Constantinou, A.C. (2020). Approximate learning of high dimensional Bayesian network structures via pruning of Candidate Parent Sets. Entropy, 22.","DOI":"10.3390\/e22101142"},{"key":"ref_19","unstructured":"Yuan, C., Malone, B., and Wu, X. (2011, January 16\u201322). Learning optimal Bayesian networks using A* search. Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, Barcelona, Spain."},{"key":"ref_20","unstructured":"Malone, B., and Yuan, C. (2013). Evaluating anytime algorithms for learning optimal Bayesian networks. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.neucom.2020.10.049","article-title":"Bidirectional heuristic search to find the optimal Bayesian network structure","volume":"426","author":"Tan","year":"2021","journal-title":"Neurocomputing"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Heckerman, D. (2008). A tutorial on learning with Bayesian networks. Innovations in Bayesian Networks, Springer.","DOI":"10.1007\/978-3-540-85066-3_3"},{"key":"ref_23","unstructured":"Chickering, D.M. (2013). A transformational characterization of equivalent Bayesian network structures. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ijar.2012.09.004","article-title":"Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes","volume":"54","author":"Puerta","year":"2013","journal-title":"Int. J. Approx. Reason."},{"key":"ref_25","unstructured":"Teyssier, M., and Koller, D. (2012). Ordering-based search: A simple and effective algorithm for learning Bayesian networks. arXiv."},{"key":"ref_26","unstructured":"Scanagatta, M., Corani, G., and Zaffalon, M. (2017, January 20\u201322). Improved local search in Bayesian networks structure learning. Proceedings of the 3rd International Workshop on Advanced Methodologies for Bayesian Networks, Kyoto, Japan."},{"key":"ref_27","unstructured":"Hoos, H.H., and St\u00fctzle, T. (2004). Stochastic local search: Foundations and applications, Elsevier."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Lee, C., and van Beek, P. (2017). Metaheuristics for score-and-search Bayesian network structure learning. Canadian Conference on Artificial Intelligence, Springer.","DOI":"10.1007\/978-3-319-57351-9_17"},{"key":"ref_29","unstructured":"Scanagatta, M., de Campos, C.P., Corani, G., and Zaffalon, M. (2015, January 7\u201312). Learning Bayesian Networks with Thousands of Variables. Proceedings of the 28th International Conference on Neural Information Processing Systems, Montreal, QC, Canada."},{"key":"ref_30","unstructured":"Koller, D., and Friedman, N. (2009). Probabilistic Graphical Models: Principles and Techniques, MIT Press."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Buntine, W. (1991). Theory refinement on Bayesian networks. Uncertainty Proceedings 1991, Elsevier.","DOI":"10.1016\/B978-1-55860-203-8.50010-3"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Suzuki, J. (1993). A construction of Bayesian networks from databases based on an MDL principle. Uncertainty in Artificial Intelligence, Elsevier.","DOI":"10.1016\/B978-1-4832-1451-1.50037-8"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","article-title":"Estimating the dimension of a model","volume":"6","author":"Schwarz","year":"1978","journal-title":"Ann. Stat."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Akaike, H. (1998). Information theory and an extension of the maximum likelihood. principle. Selected Papers of Hirotugu Akaike, Springer.","DOI":"10.1007\/978-1-4612-1694-0_15"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Scutari, M., and Denis, J.B. (2014). Bayesian Networks: With Examples in R, CRC Press.","DOI":"10.1201\/b17065"},{"key":"ref_36","unstructured":"Constantinou, A. (2019). Evaluating structure learning algorithms with a balanced scoring function. arXiv."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s13748-019-00194-y","article-title":"A survey on Bayesian network structure learning from data","volume":"8","author":"Scanagatta","year":"2019","journal-title":"Prog. Artif. Intell."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Pena, J.M. (2008). Learning gaussian graphical models of gene networks with false discovery rate control. European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, Springer.","DOI":"10.1007\/978-3-540-78757-0_15"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"6755","DOI":"10.1016\/j.eswa.2014.04.032","article-title":"A hybrid algorithm for Bayesian network structure learning with application to multi-label learning","volume":"41","author":"Gasse","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3385655","article-title":"Learning Bayesian networks with the Saiyan algorithm","volume":"14","author":"Constantinou","year":"2020","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"124845","DOI":"10.1109\/ACCESS.2020.3006472","article-title":"Learning Bayesian Networks that enable full propagation of evidence","volume":"8","author":"Constantinou","year":"2020","journal-title":"IEEE Access"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/6\/750\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:14:20Z","timestamp":1760163260000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/6\/750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":41,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,6]]}},"alternative-id":["e23060750"],"URL":"https:\/\/doi.org\/10.3390\/e23060750","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,15]]}}}