{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T23:35:58Z","timestamp":1772321758737,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T00:00:00Z","timestamp":1642291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T00:00:00Z","timestamp":1642291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"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":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Decomposition hybrid algorithms with the recursive framework which recursively decompose the structural task into structural subtasks to reduce computational complexity are employed to learn Bayesian network (BN) structure. Merging rules are commonly adopted as the combination method in the combination step. The direction determination rule of merging rules has problems in using the idea of keeping v-structures unchanged before and after combination to determine directions of edges in the whole structure. It breaks down in one case due to appearances of wrong v-structures, and is hard to operate in practice. Therefore, we adopt a novel approach for direction determination and propose a two-stage combination method. In the first-stage combination method, we determine nodes, links of edges by merging rules and adopt the idea of permutation and combination to determine directions of contradictory edges. In the second-stage combination method, we restrict edges between nodes that do not satisfy the decomposition property and their parent nodes by determining the target domain according to the decomposition property. Simulation experiments on four networks show that the proposed algorithm can obtain BN structure with higher accuracy compared with other algorithms. Finally, the proposed algorithm is applied to the thickening process of gold hydrometallurgy to solve the practical problem.<\/jats:p>","DOI":"10.1007\/s40747-021-00623-3","type":"journal-article","created":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T21:05:45Z","timestamp":1642367145000},"page":"2151-2165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A decomposition structure learning algorithm in Bayesian network based on a two-stage combination method"],"prefix":"10.1007","volume":"8","author":[{"given":"Huiping","family":"Guo","sequence":"first","affiliation":[]},{"given":"Hongru","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,16]]},"reference":[{"key":"623_CR1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0092600","volume":"9","author":"R Aghdam","year":"2014","unstructured":"Aghdam R, Ganjali M, Eslahchi C (2014) IPCA-CMI: an algorithm for inferring gene regulatory networks based on a combination of PCA-CMI and MIT score. PLoS ONE 9:e92600. https:\/\/doi.org\/10.1371\/journal.pone.0092600","journal-title":"PLoS ONE"},{"key":"623_CR2","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1039\/c4mb00413b","volume":"11","author":"R Aghdam","year":"2015","unstructured":"Aghdam R, Ganjali M, Zhang X, Eslahchi C (2015) CN: a consensus algorithm for inferring gene regulatory networks using the SORDER algorithm and conditional mutual information test. Mol Biosyst 11:942\u2013949. https:\/\/doi.org\/10.1039\/c4mb00413b","journal-title":"Mol Biosyst"},{"key":"623_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1111\/coin.12182","volume":"35","author":"R Aghdam","year":"2018","unstructured":"Aghdam R, Tabar VR, Pezeshk H (2018) Some node ordering methods for the K2 algorithm: node ordering methods. Comput Intell 35:42\u201358. https:\/\/doi.org\/10.1111\/coin.12182","journal-title":"Comput Intell"},{"key":"623_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/s0373463319000109","volume":"72","author":"F CalleAlonso","year":"2019","unstructured":"CalleAlonso F, P\u00e9rez C, Ayra E (2019) A Bayesian-network-based approach to risk analysis in runway excursions. J Navig 72:1\u201319. https:\/\/doi.org\/10.1017\/s0373463319000109","journal-title":"J Navig"},{"key":"623_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1080\/15472450.2018.1486192","volume":"23","author":"X Chen","year":"2019","unstructured":"Chen X, Zhou L, Li L (2019) Bayesian network for red-light-running prediction at signalized intersections. J Intell Transport Syst 23:120\u2013132. https:\/\/doi.org\/10.1080\/15472450.2018.1486192","journal-title":"J Intell Transport Syst"},{"key":"623_CR6","first-page":"1","volume":"15","author":"D Colombo","year":"2014","unstructured":"Colombo D, Maathuis M (2014) Order-independent constraint-based causal structure learning. J Mach Learn Res 15:1\u201340","journal-title":"J Mach Learn Res"},{"key":"623_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00994110","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.1007\/BF00994110","journal-title":"Mach Learn"},{"key":"623_CR8","unstructured":"Cowie J, Oteniya L, Coles R (2007) Particle swarm optimisation for learning Bayesian networks. In: Proceedings of the world congress on engineering, London, UK, pp 7\u201312"},{"key":"623_CR9","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":"623_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1613\/jair.2681","volume":"35","author":"R Daly","year":"2009","unstructured":"Daly R, Shen Q (2009) Learning Bayesian network equivalence classes with ant colony optimization. J Artif Intell Res 35:391\u2013447. https:\/\/doi.org\/10.1613\/jair.2681","journal-title":"J Artif Intell Res"},{"key":"623_CR11","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jmva.2004.10.012","volume":"96","author":"Z Geng","year":"2005","unstructured":"Geng Z, Wang C, Zhao Q (2005) Decomposition of search for v-structures in DAGs. J Multivar Anal 96:282\u2013294. https:\/\/doi.org\/10.1016\/j.jmva.2004.10.012","journal-title":"J Multivar Anal"},{"key":"623_CR12","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":"623_CR13","doi-asserted-by":"publisher","first-page":"7381","DOI":"10.1007\/s00500-016-2281-0","volume":"21","author":"Y Hong","year":"2016","unstructured":"Hong Y, Liu Z, Mai G (2016) 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":"623_CR14","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1080\/15732479.2019.1569070","volume":"15","author":"G Kabir","year":"2019","unstructured":"Kabir G, Suda H, Cruz AM, Giraldo FM, Tesfamariam S (2019) Earthquake-related Natech risk assessment using a Bayesian belief network model. Struct Infrastruct Eng 15:725\u2013739. https:\/\/doi.org\/10.1080\/15732479.2019.1569070","journal-title":"Struct Infrastruct Eng"},{"key":"623_CR15","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1109\/TKDE.2019.2899096","volume":"32","author":"S Lee","year":"2020","unstructured":"Lee S, Kim S (2020) Parallel simulated annealing with a greedy algorithm for Bayesian network structure learning. IEEE Trans Knowl Data Eng 32:1157\u20131166. https:\/\/doi.org\/10.1109\/TKDE.2019.2899096","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"623_CR16","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 20:1\u201320. https:\/\/doi.org\/10.3390\/e20080620","journal-title":"Entropy"},{"key":"623_CR17","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.knosys.2016.11.026","volume":"119","author":"H Li","year":"2017","unstructured":"Li H, Wang F, Li H (2017) A safe control scheme under the abnormity for the thickening process of gold hydrometallurgy based on Bayesian network. Knowl Based Syst 119:10\u201319. https:\/\/doi.org\/10.1016\/j.knosys.2016.11.026","journal-title":"Knowl Based Syst"},{"key":"623_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, Nanjing, pp 2887\u20132892","DOI":"10.1109\/ChiCC.2014.6897098"},{"key":"623_CR19","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":"623_CR20","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":"623_CR21","doi-asserted-by":"publisher","first-page":"7605","DOI":"10.1038\/s41598-021-87074-5","volume":"11","author":"SH Mahmoodi","year":"2021","unstructured":"Mahmoodi SH, Aghdam R, Eslahchi C (2021) An order independent algorithm for inferring gene regulatory network using quantile value for conditional independence tests. Sci Rep 11:7605. https:\/\/doi.org\/10.1038\/s41598-021-87074-5","journal-title":"Sci Rep"},{"key":"623_CR22","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s13748-019-00194-y","volume":"8","author":"S Mauro","year":"2019","unstructured":"Mauro S, Antonio S, Fabio S (2019) A survey on Bayesian network structure learning from data. Prog Artif Intell 8:425\u2013439. https:\/\/doi.org\/10.1007\/s13748-019-00194-y","journal-title":"Prog Artif Intell"},{"key":"623_CR23","doi-asserted-by":"crossref","unstructured":"N\u00e4gele A, Dejori M, Stetter M (2007) Bayesian substructure learning\u2014approximate learning of very large network structures. In: European conference on machine learning, Warsaw, Poland, pp 238\u2013249","DOI":"10.1007\/978-3-540-74958-5_24"},{"key":"623_CR24","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":"623_CR25","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s11590-014-0793-z","volume":"11","author":"J S\u00e1nchez-Oro","year":"2017","unstructured":"S\u00e1nchez-Oro J, Mladenovi\u0107 N, Duarte A (2017) General variable neighborhood search for computing graph separators. Optim Lett 11:1069\u20131089. https:\/\/doi.org\/10.1007\/s11590-014-0793-z","journal-title":"Optim Lett"},{"key":"623_CR26","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"GE Schwarz","year":"1978","unstructured":"Schwarz GE (1978) Estimating the dimension of a model. Ann Stat 6:461\u2013464. https:\/\/doi.org\/10.1214\/aos\/1176344136","journal-title":"Ann Stat"},{"key":"623_CR27","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/s11222-019-09857-1","volume":"29","author":"M Scutari","year":"2019","unstructured":"Scutari M, Vitolo C, Tucker A (2019) Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation. Stat Comput 29:1095\u20131108. https:\/\/doi.org\/10.1007\/s11222-019-09857-1","journal-title":"Stat Comput"},{"key":"623_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00356088","volume":"1","author":"P Spirtes","year":"1989","unstructured":"Spirtes P, Glymour C, Scheines R (1989) Causality from probability. Evol Knowl Nat Behav Sci 1:1\u201318. https:\/\/doi.org\/10.1007\/BF00356088","journal-title":"Evol Knowl Nat Behav Sci"},{"key":"623_CR29","doi-asserted-by":"publisher","first-page":"3383","DOI":"10.12733\/jics20105969","volume":"12","author":"C Wang","year":"2015","unstructured":"Wang C (2015) Learning Bayesian network structure based on topological potential. J Inf Comput Sci 12:3383\u20133393. https:\/\/doi.org\/10.12733\/jics20105969","journal-title":"J Inf Comput Sci"},{"key":"623_CR30","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":"623_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2202\/1544-6115.1170","volume":"5","author":"A Wille","year":"2006","unstructured":"Wille A, B\u00fchlmann P (2006) Low-order conditional independence graphs for inferring genetic networks. Stat Appl Genet Mol Biol 5:1\u201332. https:\/\/doi.org\/10.2202\/1544-6115.1170","journal-title":"Stat Appl Genet Mol Biol"},{"key":"623_CR32","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":"623_CR33","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.ijar.2015.11.003","volume":"69","author":"C Yang","year":"2016","unstructured":"Yang C, Ji J, Liu J, Liu J, Yin B (2016) Structural learning of Bayesian networks by bacterial foraging optimization. Int J Approx Reason 69:147\u2013167. https:\/\/doi.org\/10.1016\/j.ijar.2015.11.003","journal-title":"Int J Approx Reason"},{"key":"623_CR34","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1007\/s40747-021-00279-z","volume":"7","author":"M Y\u00fccesan","year":"2021","unstructured":"Y\u00fccesan M, G\u00fcl M, Celik E (2021) A holistic FMEA approach by fuzzy-based Bayesian network and best-worst method. Complex Intell Syst 7:1547\u20131564. https:\/\/doi.org\/10.1007\/s40747-021-00279-z","journal-title":"Complex Intell Syst"},{"key":"623_CR35","doi-asserted-by":"crossref","unstructured":"Zeng Y, Jorge CH (2008) A decomposition algorithm for learning Bayesian network structures from data. In: Advances in knowledge discovery and data mining, Berlin, Heidelberg, pp 441\u2013453","DOI":"10.1007\/978-3-540-68125-0_39"},{"key":"623_CR36","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.neucom.2017.01.092","volume":"258","author":"Y Zhao","year":"2017","unstructured":"Zhao Y, Chen Y, Tu K, Tian J (2017) Learning Bayesian network structures under incremental construction curricula. Neurocomputing 258:30\u201340. https:\/\/doi.org\/10.1016\/j.neucom.2017.01.092","journal-title":"Neurocomputing"},{"key":"623_CR37","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":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00623-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00623-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00623-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T01:13:26Z","timestamp":1653873206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00623-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,16]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00623-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,16]]},"assertion":[{"value":"3 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}