{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:22Z","timestamp":1740107842007,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:00:00Z","timestamp":1723507200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:00:00Z","timestamp":1723507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973067"],"award-info":[{"award-number":["61973067"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00500-024-09943-1","type":"journal-article","created":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T16:02:16Z","timestamp":1723564936000},"page":"11895-11910","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A stage-driven construction algorithm of undirected independence graph for Bayesian network structure learning"],"prefix":"10.1007","volume":"28","author":[{"given":"Huiping","family":"Guo","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":"Xiaolong","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,13]]},"reference":[{"key":"9943_CR1","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.1109\/TPAMI.2016.2636828","volume":"39","author":"H Amirkhani","year":"2017","unstructured":"Amirkhani H, Rahmati M, Lucas PJF, Hommersom A (2017) exploiting experts\u2019 knowledge for structure learning of Bayesian Networks. IEEE Trans Pattern Anal 39:2154\u20132170. https:\/\/doi.org\/10.1109\/TPAMI.2016.2636828","journal-title":"IEEE Trans Pattern Anal"},{"key":"9943_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11831-023-09914-z","volume":"30","author":"S Anosri","year":"2023","unstructured":"Anosri S, Panagant N, Champasak P, Bureerat S, Thipyopas C, Kumar S, Pholdee N, Yildiz BS, Yildiz AR (2023) A comparative study of state-of-the-art metaheuristics for solving many-objective optimization problems of fixed wing unmanned aerial vehicle conceptual design. Arch Comput Methods Eng 30:1\u201315","journal-title":"Arch Comput Methods Eng"},{"key":"9943_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1504\/IJVD.2019.109866","volume":"80","author":"CM Aye","year":"2020","unstructured":"Aye CM, Pholdee N, Bureerat S, Sait SM, Yildiz AR (2020) Multi-surrogate-assisted metaheuristics for crashworthiness optimisation. Int J Veh Des 80:223\u2013240","journal-title":"Int J Veh Des"},{"key":"9943_CR4","first-page":"2111","volume":"137","author":"CM Aye","year":"2023","unstructured":"Aye CM, Wansaseub K, Kumar S, Tejani G-G, Bureerat S, Yildiz A-R, Pholdee N (2023) Airfoil shape optimisation using a multi-fidelity surrogate-assisted metaheuristic with a new multi-objective infill sampling technique. Comput Model Eng Sci 137:2111\u20132128","journal-title":"Comput Model Eng Sci"},{"key":"9943_CR5","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1016\/j.patrec.2012.06.013","volume":"33","author":"AT Bui","year":"2012","unstructured":"Bui AT, Jun C-H (2012) Learning Bayesian network structure using Markov blanket decomposition. Pattern Recogn Lett 33:2134\u20132140. https:\/\/doi.org\/10.1016\/j.patrec.2012.06.013","journal-title":"Pattern Recogn Lett"},{"key":"9943_CR6","unstructured":"Cai R, Zhang Z, Hao Z (2017) SADA: a general framework to support robust causation discovery. In: The 30th International conference on international conference on machine learning, pp 208\u2013216"},{"key":"9943_CR7","first-page":"2621","volume":"7","author":"R Castelo","year":"2006","unstructured":"Castelo R, Roverato A (2006) A robust procedure for gaussian graphical model search from microarray data with p larger than n. J Mach Learn Res 7:2621\u20132650","journal-title":"J Mach Learn Res"},{"key":"9943_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1089\/cmb.2008.08TT","volume":"16","author":"R Castelo","year":"2009","unstructured":"Castelo R, Roverato A (2009) Reverse engineering molecular regulatory networks from microarray data with qp-graphs. J Comput Biol 16:213\u2013227. https:\/\/doi.org\/10.1089\/cmb.2008.08TT","journal-title":"J Comput Biol"},{"key":"9943_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhary MS, Ranshous S, Samatova NF (2018) A community-driven graph partitioning method for constraint-based causal discovery. In: Complex networks & their applications, pp 253\u2013264","DOI":"10.1007\/978-3-319-72150-7_21"},{"key":"9943_CR10","first-page":"1287","volume":"5","author":"DM Chickering","year":"2012","unstructured":"Chickering DM, Heckerman D, Meek C (2012) Large-sample learning of Bayesian networks is NP-hard. J Mach Learn Res 5:1287\u20131330","journal-title":"J Mach Learn Res"},{"key":"9943_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2020.105602","volume":"195","author":"J Dai","year":"2020","unstructured":"Dai J, Ren J, Du W (2020) Decomposition-based Bayesian network structure learning algorithm using local topology information. Knowl-Based Syst 195:1\u201314. https:\/\/doi.org\/10.1016\/j.knosys.2020.105602","journal-title":"Knowl-Based Syst"},{"key":"9943_CR12","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1007\/s13042-015-0476-9","volume":"8","author":"S Gheisari","year":"2016","unstructured":"Gheisari S, Meybodi MR, Dehghan M, Ebadzadeh MM (2016) Bayesian network structure training based on a game of learning automata. Int J Mach Learn Cybern 8:1093\u20131105. https:\/\/doi.org\/10.1007\/s13042-015-0476-9","journal-title":"Int J Mach Learn Cybern"},{"key":"9943_CR13","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.3233\/IDA-194844","volume":"24","author":"H Guo","year":"2020","unstructured":"Guo H, Li H (2020) An efficient Bayesian network structure learning algorithm using the strategy of two-stage searches. Intell Data Anal 24:1087\u20131106. https:\/\/doi.org\/10.3233\/IDA-194844","journal-title":"Intell Data Anal"},{"key":"9943_CR14","doi-asserted-by":"publisher","first-page":"7381","DOI":"10.1007\/s00500-016-2281-0","volume":"21","author":"Y Hong","year":"2017","unstructured":"Hong Y, Liu Z, Mai G (2017) An efficient algorithm for large-scale causal discovery. Soft Comput 21:7381\u20137391. https:\/\/doi.org\/10.1007\/s00500-016-2281-0","journal-title":"Soft Comput"},{"key":"9943_CR15","doi-asserted-by":"publisher","first-page":"3049","DOI":"10.1007\/s00500-017-2557-z","volume":"22","author":"AR Khanteymoori","year":"2018","unstructured":"Khanteymoori AR, Olyaee M-H, Abbaszadeh O, Valian M (2018) A novel method for Bayesian networks structure learning based on Breeding Swarm algorithm. Soft Comput 22:3049\u20133060. https:\/\/doi.org\/10.1007\/s00500-017-2557-z","journal-title":"Soft Comput"},{"key":"9943_CR16","first-page":"285","volume":"11","author":"K Kojima","year":"2010","unstructured":"Kojima K, Perrier E, Imoto S, Miyano S (2010) Optimal search on clustered structural constraint for learning Bayesian network structure. J Mach Learn Res 11:285\u2013310","journal-title":"J Mach Learn Res"},{"key":"9943_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/e20080620","volume":"20","author":"H Li","year":"2018","unstructured":"Li H, Guo H (2018) A hybrid structure learning algorithm for Bayesian network using experts\u2019 knowledge. Entropy-Switz 20:1\u201320. https:\/\/doi.org\/10.3390\/e20080620","journal-title":"Entropy-Switz"},{"key":"9943_CR18","doi-asserted-by":"crossref","unstructured":"Li S, Zhang J, Huang K (2014) A graph partitioning approach for Bayesian network structure learning. In: Proceedings of the 33rd Chinese control conference, pp 2887\u20132892","DOI":"10.1109\/ChiCC.2014.6897098"},{"key":"9943_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.3233\/ida-183877","volume":"23","author":"H Li","year":"2019","unstructured":"Li H, Wang F, Li H (2019) Integrating expert knowledge for Bayesian network structure learning based on intuitionistic fuzzy set and Genetic Algorithm. Intell Data Anal 23:41\u201356. https:\/\/doi.org\/10.3233\/ida-183877","journal-title":"Intell Data Anal"},{"key":"9943_CR20","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1371\/journal.pcbi.1005024","volume":"12","author":"F Liu","year":"2016","unstructured":"Liu F, Zhang S, Guo W, Wei Z, Chen L (2016) Inference of gene regulatory network based on local Bayesian networks. Plos Comput Biol 12:1005\u20131024. https:\/\/doi.org\/10.1371\/journal.pcbi.1005024","journal-title":"Plos Comput Biol"},{"key":"9943_CR21","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":"9943_CR22","doi-asserted-by":"publisher","first-page":"116172","DOI":"10.1016\/j.cma.2023.116172","volume":"414","author":"Z Meng","year":"2023","unstructured":"Meng Z, Qian Q, Xu M, Yu B, Yldz A, Mirjalili SJCMIAM (2023a) PINN-FORM: a new physics-informed neural network for reliability analysis with partial differential equation. Comput Method Appl M 414:116172","journal-title":"Comput Method Appl M"},{"key":"9943_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00158-023-03639-0","volume":"66","author":"Z Meng","year":"2023","unstructured":"Meng Z, Y\u0131ld\u0131z BSY, Li G, Zhong C, Mirjalili S, Yildiz AR (2023b) Application of state-of-the-art multiobjective metaheuristic algorithms in reliability-based design optimization: a comparative study. Struct Multidiscip Optim 66:191. https:\/\/doi.org\/10.1007\/s00158-023-03639-0","journal-title":"Struct Multidiscip Optim"},{"key":"9943_CR24","doi-asserted-by":"publisher","first-page":"2773","DOI":"10.1093\/bioinformatics\/bty154","volume":"34","author":"C Niel","year":"2018","unstructured":"Niel C, Sinoquet C, Dina C, Rocheleau G (2018) SMMB: a stochastic Markov blanket framework strategy for epistasis detection in GWAS. Bioinformatics 34:2773\u20132780. https:\/\/doi.org\/10.1093\/bioinformatics\/bty154","journal-title":"Bioinformatics"},{"key":"9943_CR25","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ijar.2017.05.006","volume":"88","author":"P Parviainen","year":"2017","unstructured":"Parviainen P, Kaski S (2017) Learning structures of Bayesian networks for variable groups. Int J Approx Reason 88:110\u2013127. https:\/\/doi.org\/10.1016\/j.ijar.2017.05.006","journal-title":"Int J Approx Reason"},{"key":"9943_CR26","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ijar.2019.08.004","volume":"114","author":"X Qi","year":"2019","unstructured":"Qi X, Fan X, Gao Y, Liu Y (2019) Learning Bayesian network structures using weakest mutual-information-first strategy. Int J Approx Reason 114:84\u201398. https:\/\/doi.org\/10.1016\/j.ijar.2019.08.004","journal-title":"Int J Approx Reason"},{"key":"9943_CR27","doi-asserted-by":"crossref","unstructured":"Robinson RW (1977) Counting unlabeled acyclic digraphs. In: Combinatorial Mathematics V, pp 28\u201343.","DOI":"10.1007\/BFb0069178"},{"key":"9943_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.oceaneng.2018.08.052","volume":"167","author":"A Sarwar","year":"2018","unstructured":"Sarwar A, Khan F, James L, Abimbola M (2018) Integrated offshore power operation resilience assessment using Object Oriented Bayesian network. Ocean Eng 167:257\u2013266. https:\/\/doi.org\/10.1016\/j.oceaneng.2018.08.052","journal-title":"Ocean Eng"},{"key":"9943_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ijar.2019.10.003","volume":"115","author":"M Scutari","year":"2019","unstructured":"Scutari M, Graafland CE, Guti\u00e9rrez JM (2019) Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms. Int J Approx Reason 115:235\u2013253. https:\/\/doi.org\/10.1016\/j.ijar.2019.10.003","journal-title":"Int J Approx Reason"},{"key":"9943_CR30","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10614-021-10099-5","volume":"59","author":"V Sevin","year":"2022","unstructured":"Sevin V (2022) Determining the flat sales prices by flat characteristics using Bayesian Network Models. Comput Econ 59:549\u2013577. https:\/\/doi.org\/10.1007\/s10614-021-10099-5","journal-title":"Comput Econ"},{"key":"9943_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/int.22833","author":"B Sun","year":"2022","unstructured":"Sun B, Zhou Y (2022) Bayesian network structure learning with improved genetic algorithm. Int J Intell Syst. https:\/\/doi.org\/10.1002\/int.22833","journal-title":"Int J Intell Syst"},{"key":"9943_CR32","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 CFJKAP (2006) The max-min hill-climbing Bayesian network structure learning algorithm. Mach Learn 65:31\u201378","journal-title":"Mach Learn"},{"key":"9943_CR33","doi-asserted-by":"publisher","first-page":"2423","DOI":"10.1080\/00207160.2019.1566535","volume":"96","author":"J Wang","year":"2019","unstructured":"Wang J, Liu S (2019) A novel discrete particle swarm optimization algorithm for solving Bayesian network structures learning problem. Int J Comput Math 96:2423\u20132440. https:\/\/doi.org\/10.1080\/00207160.2019.1566535","journal-title":"Int J Comput Math"},{"key":"9943_CR34","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.compbiolchem.2007.08.005","volume":"31","author":"M Wang","year":"2007","unstructured":"Wang M, Chen Z, Cloutier S (2007) A hybrid Bayesian network learning method for constructing gene networks. Comput Biol Chem 31:361\u2013372. https:\/\/doi.org\/10.1016\/j.compbiolchem.2007.08.005","journal-title":"Comput Biol Chem"},{"key":"9943_CR35","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/1390681.1390695","volume":"9","author":"X Xie","year":"2008","unstructured":"Xie X, Geng Z (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":"9943_CR36","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":"9943_CR37","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":"9943_CR38","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jprocont.2021.05.003","volume":"103","author":"H Yan","year":"2021","unstructured":"Yan H, Wang F, Yan G, He D (2021) Hybrid approach integrating case-based reasoning and Bayesian network for operational adjustment in industrial flotation process. J Process Contr 103:34\u201347. https:\/\/doi.org\/10.1016\/j.jprocont.2021.05.003","journal-title":"J Process Contr"},{"key":"9943_CR39","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00158-003-0300-0","volume":"25","author":"AR Yildiz","year":"2003","unstructured":"Yildiz AR, \u00d6zt\u00fcrk N, Kaya N, \u00d6zt\u00fcrk F (2003) Integrated optimal topology design and shape optimization using neural networks. Struct Multidiscip Optim 25:251\u2013260","journal-title":"Struct Multidiscip Optim"},{"key":"9943_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/brainsci11020150","volume":"11","author":"K Yu","year":"2021","unstructured":"Yu K, Cui Z, Sui X, Qiu X, Zhang J (2021) Biological network inference with GRASP: a Bayesian network structure learning method using adaptive sequential Monte Carlo. Front Genet 11:1\u201316. https:\/\/doi.org\/10.3390\/brainsci11020150","journal-title":"Front Genet"},{"key":"9943_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2012\/974063","volume":"10","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 10: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-024-09943-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09943-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09943-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:08:44Z","timestamp":1729645724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09943-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,13]]},"references-count":41,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9943"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09943-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2024,8,13]]},"assertion":[{"value":"22 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have 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"}}]}}