{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:11Z","timestamp":1740107831891,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61973067"],"award-info":[{"award-number":["61973067"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00500-022-07647-y","type":"journal-article","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T02:02:21Z","timestamp":1670810541000},"page":"3673-3687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A recursive local search method of separators for Bayesian network decomposition structure learning algorithm"],"prefix":"10.1007","volume":"27","author":[{"given":"Xiaolong","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4700-962X","authenticated-orcid":false,"given":"Hongru","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiping","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,12]]},"reference":[{"key":"7647_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/1756006.1756013","volume":"11","author":"CF Aliferis","year":"2010","unstructured":"Aliferis CF, Statnikov AR, Tsamardinos I, Mani S, Koutsoukos XD (2010) Local causal and markov blanket induction for causal discovery and feature selection for classification part I: algorithms and empirical evaluation. J Mach Learn Res 11:171\u2013234. https:\/\/doi.org\/10.1145\/1756006.1756013","journal-title":"J Mach Learn Res"},{"key":"7647_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3390\/a3020197","volume":"3","author":"A Berry","year":"2010","unstructured":"Berry A, Pogorelcnik R, Simonet G (2010) an introduction to clique minimal separator decomposition. Algorithms 3:197\u2013215. https:\/\/doi.org\/10.3390\/a3020197","journal-title":"Algorithms"},{"key":"7647_CR3","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jocs.2017.09.002","volume":"24","author":"O Chatrabgoun","year":"2018","unstructured":"Chatrabgoun O, Hosseinian-Far A, Chang V, Stocks NG, Daneshkhah A (2018) Approximating non-Gaussian Bayesian networks using minimum information vine model with applications in financial modelling. J Comput Sci 24:266\u2013276. https:\/\/doi.org\/10.1016\/j.jocs.2017.09.002","journal-title":"J Comput Sci"},{"key":"7647_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00191-1","volume":"137","author":"J Cheng","year":"2002","unstructured":"Cheng J, Greiner R, Kelly J, Bell D, Liu WR (2002) Learning Bayesian networks from data: An information-theory based approach. Artif Intell 137:43\u201390. https:\/\/doi.org\/10.1016\/S0004-3702(02)00191-1","journal-title":"Artif Intell"},{"key":"7647_CR5","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.48550\/arXiv.1212.2468","volume":"5","author":"DM Chickering","year":"2004","unstructured":"Chickering DM, Heckerman D, Mee C (2004) Large-sample learning of Bayesian networks is NP-hard. J Mach Learn Res 5:1287\u20131330. https:\/\/doi.org\/10.48550\/arXiv.1212.2468","journal-title":"J Mach Learn Res"},{"key":"7647_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10462-018-9615-5","volume":"52","author":"C Contaldi","year":"2019","unstructured":"Contaldi C, Vafaee F, Nelson PC (2019) Bayesian network hybrid learning using an elite-guided genetic algorithm. Artif Intell Rev 52:245\u2013272. https:\/\/doi.org\/10.1007\/s10462-018-9615-5","journal-title":"Artif Intell Rev"},{"key":"7647_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1023\/A:1022649401552","volume":"9","author":"GF Cooper","year":"1992","unstructured":"Cooper GF, Herskovits E (1992) A Bayesian method for the induction of probabilistic networks from data. Mach Learn 9:309\u2013347. https:\/\/doi.org\/10.1023\/A:1022649401552","journal-title":"Mach Learn"},{"key":"7647_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105602","author":"JG Dai","year":"2020","unstructured":"Dai JG, Ren J, Du WC (2020) Decomposition-based Bayesian network structure learning algorithm using local topology information. Knowl-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2020.105602","journal-title":"Knowl-Based Syst"},{"key":"7647_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11615-001-0048-3","volume":"42","author":"V Di De Lez","year":"2001","unstructured":"Di De Lez V, Pigeot I (2001) Judea Pearl: Causality: Models, reasoning, and inference. Politische Vierteljahresschrift 42:313\u2013315. https:\/\/doi.org\/10.1007\/s11615-001-0048-3","journal-title":"Politische Vierteljahresschrift"},{"key":"7647_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A Set of Measures of Centrality Based on Betweenness. Sociometry 40:35\u201341. https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"key":"7647_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994016","author":"D Heckerman","year":"1995","unstructured":"Heckerman D (1995) Learning Bayesian networks: the combination of knowledge and statistical data. Mach Learn. https:\/\/doi.org\/10.1007\/BF00994016","journal-title":"Mach Learn"},{"key":"7647_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen SL (1996) Graphical models. Oxford, Clarendon Press"},{"key":"7647_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1002\/net.3230200503","volume":"20","author":"SL Lauritzen","year":"1990","unstructured":"Lauritzen SL, Dawid AP, Larsen BN, Leimer H-G (1990) Independence properties of directed Markov fields. Networks 20:491\u2013505. https:\/\/doi.org\/10.1002\/net.3230200503","journal-title":"Networks"},{"key":"7647_CR14","doi-asserted-by":"publisher","DOI":"10.1142\/s0218213015500128","author":"Y Li","year":"2015","unstructured":"Li Y, Yang Y, Wang W, Yang W (2015) An algorithm for learning the skeleton of large Bayesian network. Int J Artif Intell Tools. https:\/\/doi.org\/10.1142\/s0218213015500128","journal-title":"Int J Artif Intell Tools"},{"key":"7647_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.knosys.2017.01.029","volume":"121","author":"H Liu","year":"2017","unstructured":"Liu H, Zhou S, Lam W, Guan J (2017) A new hybrid method for learning bayesian networks: separation and reunion. Knowl-Based Syst 121:185\u2013197. https:\/\/doi.org\/10.1016\/j.knosys.2017.01.029","journal-title":"Knowl-Based Syst"},{"key":"7647_CR16","doi-asserted-by":"publisher","first-page":"40963","DOI":"10.1109\/ACCESS.2021.3065532","volume":"9","author":"K Liu","year":"2021","unstructured":"Liu K, Cui YN, Ren J, Li PR (2021) An improved particle swarm optimization algorithm for Bayesian network structure learning via local information constraint. IEEE Access 9:40963\u201340971. https:\/\/doi.org\/10.1109\/ACCESS.2021.3065532","journal-title":"IEEE Access"},{"key":"7647_CR17","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.neucom.2021.01.138","volume":"456","author":"B Mihaljevi\u0107","year":"2021","unstructured":"Mihaljevi\u0107 B, Bielza C, Larra\u00f1aga P (2021) Bayesian networks for interpretable machine learning and optimization. Neurocomputing 456:648\u2013665. https:\/\/doi.org\/10.1016\/j.neucom.2021.01.138","journal-title":"Neurocomputing"},{"key":"7647_CR18","doi-asserted-by":"publisher","DOI":"10.1101\/2020.05.25.20112466","author":"M Neil","year":"2020","unstructured":"Neil M, Fenton N, Osman M, McLachlan S (2020) Bayesian network analysis of Covid-19 data reveals higher infection prevalence rates and lower fatality rates than widely reported. J Risk Res. https:\/\/doi.org\/10.1101\/2020.05.25.20112466","journal-title":"J Risk Res"},{"key":"7647_CR19","doi-asserted-by":"publisher","DOI":"10.1109\/3477979956","author":"GK Olesen","year":"2002","unstructured":"Olesen GK, Madsen AL (2002) Maximal prime subgraph decomposition of Bayesian networks. IEEE Trans Syst Man Cybern Part B. https:\/\/doi.org\/10.1109\/3477979956","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"7647_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-05735-z","author":"H Pan","year":"2021","unstructured":"Pan H, Yang X (2021) Intelligent recommendation method integrating knowledge graph and Bayesian network. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-021-05735-z","journal-title":"Soft Comput"},{"issue":"461\u201364","key":"7647_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz G (1978) Estimating the dimension of a model. Ann Stat 6(461\u201364):4. https:\/\/doi.org\/10.1214\/aos\/1176344136","journal-title":"Ann Stat"},{"key":"7647_CR22","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1177\/089443939100900106","volume":"9","author":"P Spirtes","year":"2016","unstructured":"Spirtes P, Glymour C (2016) An algorithm for fast recovery of sparse causal graphs. Soc Sci Comput Rev 9:62\u201372. https:\/\/doi.org\/10.1177\/089443939100900106","journal-title":"Soc Sci Comput Rev"},{"key":"7647_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.patrec.2018.04.019","volume":"111","author":"VR Tabar","year":"2018","unstructured":"Tabar VR, Eskandari F, Salimi S, Zareifard H (2018) Finding a set of candidate parents using dependency criterion for the K2 algorithm. Pattern Recogn Lett 111:23\u201329. https:\/\/doi.org\/10.1016\/j.patrec.2018.04.019","journal-title":"Pattern Recogn Lett"},{"key":"7647_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","volume":"65","author":"I Tsamardinos","year":"2006","unstructured":"Tsamardinos I, Brown LE, Aliferis CF (2006) The max-min hill-climbing Bayesian network structure learning algorithm. Mach Learn 65:31\u201378. https:\/\/doi.org\/10.1007\/s10994-006-6889-7","journal-title":"Mach Learn"},{"key":"7647_CR25","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.knosys.2017.07.003","volume":"133","author":"D Varshney","year":"2017","unstructured":"Varshney D, Kumar S, Gupta V (2017) Predicting information diffusion probabilities in social networks: a Bayesian networks based approach. Knowl-Based Syst 133:66\u201376. https:\/\/doi.org\/10.1016\/j.knosys.2017.07.003","journal-title":"Knowl-Based Syst"},{"key":"7647_CR26","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/1390681.1390695","volume":"9","author":"X Xie","year":"2008","unstructured":"Xie X, Zhi G (2008) A recursive method for structural learning of directed acyclic graphs. J Mach Learn Res 9:459\u2013483. https:\/\/doi.org\/10.1145\/1390681.1390695","journal-title":"J Mach Learn Res"},{"key":"7647_CR27","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.artint.2005.12.004","volume":"170","author":"X Xie","year":"2006","unstructured":"Xie X, Geng Z, Zhao Q (2006) Decomposition of structural learning about directed acyclic graphs. Artif Intell 170:422\u2013439. https:\/\/doi.org\/10.1016\/j.artint.2005.12.004","journal-title":"Artif Intell"},{"key":"7647_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.neucom.2020.01.021","volume":"389","author":"C Yan","year":"2020","unstructured":"Yan C, Zhou S (2020) Effective and scalable causal partitioning based on low-order conditional independent tests. Neurocomputing 389:146\u2013154. https:\/\/doi.org\/10.1016\/j.neucom.2020.01.021","journal-title":"Neurocomputing"},{"key":"7647_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.patrec.2019.02.002","volume":"122","author":"XL Yang","year":"2019","unstructured":"Yang XL, Wang YJ, Ou Y, Tong YH (2019) Three-fast-inter incremental association Markov blanket learning algorithm. Pattern Recogn Lett 122:73\u201378. https:\/\/doi.org\/10.1016\/j.patrec.2019.02.002","journal-title":"Pattern Recogn Lett"},{"key":"7647_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_39","author":"Y Zeng","year":"2008","unstructured":"Zeng Y, Hernandez JC (2008) A decomposition algorithm for learning Bayesian network structures from data. Adv Knowl Discov Data Min. https:\/\/doi.org\/10.1007\/978-3-540-68125-0_39","journal-title":"Adv Knowl Discov Data Min"},{"key":"7647_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107371","author":"X Zhang","year":"2021","unstructured":"Zhang X, Mahadevan S (2021) Bayesian network modeling of accident investigation reports for aviation safety assessment. Reliab Eng Syst Saf. https:\/\/doi.org\/10.1016\/j.ress.2020.107371","journal-title":"Reliab Eng Syst Saf"},{"key":"7647_CR32","doi-asserted-by":"publisher","DOI":"10.3390\/a11110188","author":"X Zhang","year":"2018","unstructured":"Zhang X, Xue Y, Xingyang Lu, Jia S (2018) Differential-evolution-based coevolution ant colony optimization algorithm for Bayesian network structure learning. Algorithms. https:\/\/doi.org\/10.3390\/a11110188","journal-title":"Algorithms"},{"key":"7647_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2012\/974063","volume":"2012","author":"M Zhu","year":"2012","unstructured":"Zhu M, Liu S (2012) A decomposition algorithm for learning Bayesian networks based on scoring function. J Appl Math 2012:1\u201317. https:\/\/doi.org\/10.1155\/2012\/974063","journal-title":"J Appl Math"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07647-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07647-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07647-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T20:07:37Z","timestamp":1701547657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07647-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,12]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["7647"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07647-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2022,12,12]]},"assertion":[{"value":"9 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors of this research paper declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}