{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T11:17:49Z","timestamp":1767611869070,"version":"3.41.2"},"reference-count":34,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T00:00:00Z","timestamp":1536710400000},"content-version":"vor","delay-in-days":254,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Regional Operational Programme CENTRO2020","award":["CENTRO-01-0145-FEDER-000006"],"award-info":[{"award-number":["CENTRO-01-0145-FEDER-000006"]}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>One of the most challenging tasks when adopting Bayesian networks (BNs) is the one of learning their structure from data. This task is complicated by the huge search space of possible solutions and by the fact that the problem is <jats:italic>NP<\/jats:italic>\u2010hard. Hence, a full enumeration of all the possible solutions is not always feasible and approximations are often required. However, to the best of our knowledge, a quantitative analysis of the performance and characteristics of the different heuristics to solve this problem has never been done before. For this reason, in this work, we provide a detailed comparison of many different state\u2010of\u2010the\u2010art methods for structural learning on simulated data considering both BNs with discrete and continuous variables and with different rates of noise in the data. In particular, we investigate the performance of different widespread scores and algorithmic approaches proposed for the inference and the statistical pitfalls within them.<\/jats:p>","DOI":"10.1155\/2018\/1591878","type":"journal-article","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T23:30:58Z","timestamp":1536795058000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Learning the Structure of Bayesian Networks: A Quantitative Assessment of the Effect of Different Algorithmic Schemes"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4375-004X","authenticated-orcid":false,"given":"Stefano","family":"Beretta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8793-1451","authenticated-orcid":false,"given":"Mauro","family":"Castelli","sequence":"additional","affiliation":[]},{"given":"Ivo","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Henriques","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6087-2666","authenticated-orcid":false,"given":"Daniele","family":"Ramazzotti","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2018,9,12]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-016-1316-8"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-012-5311-x"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1186\/1752-0509-8-47"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.494161"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888910000251"},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques","year":"2009","author":"Koller D.","key":"e_1_2_9_6_2"},{"key":"e_1_2_9_7_2","doi-asserted-by":"crossref","unstructured":"SaptawatiG. A. P.andSitohangB. Hybrid algorithm for learning structure of Bayesian network from incomplete databases IEEE International Symposium on Communications and Information Technology 2005. ISCIT 2005 2005 Beijing China 741\u2013744 IEEEhttps:\/\/doi.org\/10.1109\/ISCIT.2005.1566960 2-s2.0-33750118078.","DOI":"10.1109\/ISCIT.2005.1566960"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.12.051"},{"volume-title":"Causation, Prediction, and Search","year":"2000","author":"Spirtes P.","key":"e_1_2_9_9_2"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2404-4_12"},{"key":"e_1_2_9_11_2","first-page":"1287","article-title":"Large-sample learning of Bayesian networks is NP-hard","volume":"5","author":"Chickering D. M.","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-060116-053803"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/749150"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-031017-100630"},{"key":"e_1_2_9_15_2","doi-asserted-by":"crossref","unstructured":"BerettaS. CastelliM. Gon\u00e7alvesI. MerelliI. andRamazzottiD. Combining Bayesian approaches and evolutionary techniques for the inference of breast cancer networks Proceedings of the 8th International Joint Conference on Computational Intelligence 2016 Porto Portugal 217\u2013224 https:\/\/doi.org\/10.5220\/0006064102170224.","DOI":"10.5220\/0006064102170224"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.011"},{"key":"e_1_2_9_17_2","unstructured":"VermaT. S.andPearlJ. Equivalence and synthesis of causal models Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence (UAI \u203290) 1991 Cambridge MA USA 220\u2013227."},{"key":"e_1_2_9_18_2","unstructured":"TsamardinosI. AliferisC. F. StatnikovA. R. andStatnikovE. Algorithms for large scale Markov blanket discovery 2 FLAIRS Conference 2003 St. Augustine FL USA 376\u2013380."},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00047572"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/inte.20.4.74"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760200696"},{"key":"e_1_2_9_25_2","unstructured":"TeyssierM.andKollerD. Ordering-based search: a simple and effective algorithm for learning Bayesian networks 2012 https:\/\/arxiv.org\/abs\/1207.1429."},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022602019183"},{"key":"e_1_2_9_27_2","doi-asserted-by":"crossref","unstructured":"CottaC.andMuruz\u00e1balJ. Towards a more E.cient evolutionary induction of Bayesian networks International Conference on Parallel Problem Solving from Nature 2002 Granada Spain 730\u2013739 https:\/\/doi.org\/10.1007\/3-540-45712-7_70.","DOI":"10.1007\/3-540-45712-7_70"},{"key":"e_1_2_9_28_2","doi-asserted-by":"crossref","unstructured":"van DijkS. ThierensD. andvan der GaagL. C. Building a GA from design principles for learning Bayesian networks Genetic and Evolutionary Computation Conference 2003 Chicago IL USA 886\u2013897 https:\/\/doi.org\/10.1007\/3-540-45105-6_101.","DOI":"10.1007\/3-540-45105-6_101"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00106-2"},{"key":"e_1_2_9_30_2","doi-asserted-by":"crossref","unstructured":"KimK.-J. YooJ.-O. andChoS.-B. Robust inference of Bayesian networks using speciated evolution and ensemble International Symposium on Methodologies for Intelligent Systems 2005 Saratoga Springs NY USA 92\u2013101 https:\/\/doi.org\/10.1007\/11425274_10.","DOI":"10.1007\/11425274_10"},{"key":"e_1_2_9_31_2","doi-asserted-by":"crossref","unstructured":"MascheriniM.andStefaniniF. M. M-GA: a genetic algorithm to search for the best conditional Gaussian Bayesian network International Conference on Computational Intelligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and Internet Commerce (CIMCA-IAWTIC\u203206) 2005 Vienna Austria 61\u201367 https:\/\/doi.org\/10.1109\/CIMCA.2005.1631446.","DOI":"10.1109\/CIMCA.2005.1631446"},{"key":"e_1_2_9_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.537345"},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1694-0_15"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730491"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/1591878.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/1591878.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/1591878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T22:49:00Z","timestamp":1723157340000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/1591878"}},"subtitle":[],"editor":[{"given":"Eulalia","family":"Mart\u00ednez","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/1591878"],"URL":"https:\/\/doi.org\/10.1155\/2018\/1591878","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-06-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1591878"}}