{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:58:33Z","timestamp":1775674713870,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"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"}]},{"DOI":"10.13039\/501100004772","name":"Natural Science Foundation of Ningxia Province","doi-asserted-by":"publisher","award":["2024AAC03334"],"award-info":[{"award-number":["2024AAC03334"]}],"id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10489-025-06601-3","type":"journal-article","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T21:11:59Z","timestamp":1746652319000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Structural decomposition-based learning of large bayesian networks for detecting conditionally independent overlapping superstructure communities"],"prefix":"10.1007","volume":"55","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"}]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"key":"6601_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-021-09891-0","author":"CF He","year":"2021","unstructured":"He CF, Yu H, Gu SE, Zhang W (2021) A multi-granularity information-based method for learning high-dimensional bayesian network structures. Cognit Comput. https:\/\/doi.org\/10.1007\/s12559-021-09891-0","journal-title":"Cognit Comput"},{"issue":"4","key":"6601_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s13748-019-00194-y","volume":"8","author":"M Scanagatta","year":"2019","unstructured":"Scanagatta M, Salmer\u00f3n A, Stella F (2019) A survey on bayesian network structure learning from data. Progress Artif Intell 8(4):425\u2013439. https:\/\/doi.org\/10.1007\/s13748-019-00194-y","journal-title":"Progress Artif Intell"},{"key":"6601_CR3","doi-asserted-by":"publisher","unstructured":"Yang G, Zhao YL, Gu XH (2021) A novel bayesian framework with enhanced principal component analysis for chemical fault diagnosis. IEEE Trans Instrument Measure 70. https:\/\/doi.org\/10.1109\/TIM.2020.3034975","DOI":"10.1109\/TIM.2020.3034975"},{"issue":"15","key":"6601_CR4","doi-asserted-by":"publisher","first-page":"7570","DOI":"10.1016\/j.jfranklin.2018.07.035","volume":"355","author":"L Ma","year":"2018","unstructured":"Ma L, Dong J, Peng KX (2018) A practical propagation path identification scheme for quality-related faults based on nonlinear dynamic latent variable model and partitioned bayesian network. J Franklin Institute-Eng Appl Math 355(15):7570\u20137594. https:\/\/doi.org\/10.1016\/j.jfranklin.2018.07.035","journal-title":"J Franklin Institute-Eng Appl Math"},{"key":"6601_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10351-w","author":"NK Kitson","year":"2023","unstructured":"Kitson NK, Constantinou AC, Guo ZG, Liu Y, Chobtham K (2023) A survey of bayesian network structure learning. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-022-10351-w","journal-title":"Artif Intell Rev"},{"key":"6601_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00623-3","author":"HP Guo","year":"2022","unstructured":"Guo HP, Li HR (2022) A decomposition structure learning algorithm in bayesian network based on a two-stage combination method. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00623-3","journal-title":"Complex Intell Syst"},{"key":"6601_CR7","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1007\/s10883-008-9053-9","volume":"9","author":"E Perrier","year":"2008","unstructured":"Perrier E, Imoto S, Miyano S (2008) Finding optimal bayesian network given a super-structure. J Mach Learn Res 9:2251\u20132286. https:\/\/doi.org\/10.1007\/s10883-008-9053-9","journal-title":"J Mach Learn Res"},{"key":"6601_CR8","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"},{"issue":"1","key":"6601_CR9","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(1):62\u201372. https:\/\/doi.org\/10.1177\/089443939100900106","journal-title":"Soc Sci Comput Rev"},{"issue":"1\u20132","key":"6601_CR10","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(1\u20132):43\u201390. https:\/\/doi.org\/10.1016\/S0004-3702(02)00191-1","journal-title":"Artif Intell"},{"key":"6601_CR11","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 Recognit Lett 111:23\u201329. https:\/\/doi.org\/10.1016\/j.patrec.2018.04.019","journal-title":"Pattern Recognit Lett"},{"key":"6601_CR12","doi-asserted-by":"publisher","unstructured":"Zhang X, Xue Y, Lu X, Jia S (2018) Differential-evolution-based coevolution ant colony optimization algorithm for bayesian network structure learning. Algorithms 11(11). https:\/\/doi.org\/10.3390\/a11110188","DOI":"10.3390\/a11110188"},{"issue":"1","key":"6601_CR13","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(1):245\u2013272. https:\/\/doi.org\/10.1007\/s10462-018-9615-5","journal-title":"Artif Intell Rev"},{"key":"6601_CR14","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":"6601_CR15","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5203","author":"J Cussens","year":"2016","unstructured":"Cussens J, Jrvisalo M, Korhonen JH, Bartlett M (2016) Bayesian network structure learning with integer programming: Polytopes, facets, and complexity. J Artif Intell Res. https:\/\/doi.org\/10.1613\/jair.5203","journal-title":"J Artif Intell Res"},{"key":"6601_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/B:JMMA.0000049426.06305.d8","volume":"3","author":"T Schiavinotto","year":"2004","unstructured":"Schiavinotto T, St\u00fctzle T (2004) The linear ordering problem: Instances, search space analysis and algorithms. J Math Modell Algorithms 3:367\u2013402. https:\/\/doi.org\/10.1023\/B:JMMA.0000049426.06305.d8","journal-title":"J Math Modell Algorithms"},{"key":"6601_CR17","doi-asserted-by":"crossref","unstructured":"Lee C, Beek P (2017) Metaheuristics for score-and-search bayesian network structure learning. In: Mouhoub M, Langlais P (eds) Advances in Artificial Intelligence. Springer, Cham, pp 129\u2013141","DOI":"10.1007\/978-3-319-57351-9_17"},{"key":"6601_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5701-9","author":"M Scanagatta","year":"2018","unstructured":"Scanagatta M, Corani G, De Campos CP, Zaffalon M (2018) Approximate structure learning for large bayesian networks. Mach Learn. https:\/\/doi.org\/10.1007\/s10994-018-5701-9","journal-title":"Mach Learn"},{"issue":"4\u20135","key":"6601_CR19","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(4\u20135):422\u2013439. https:\/\/doi.org\/10.1016\/j.artint.2005.12.004","journal-title":"Artif Intell"},{"key":"6601_CR20","doi-asserted-by":"crossref","unstructured":"Li S, Zhang J, Huang K, Gao C (2014) A graph partitioning approach for bayesian network structure learning. In: Proceedings of the 33rd Chinese control conference, pp 1196\u20131201","DOI":"10.1109\/ChiCC.2014.6897098"},{"key":"6601_CR21","doi-asserted-by":"publisher","unstructured":"Gu JY, Zhou Q (2020) Learning big gaussian bayesian networks: Partition, estimation and fusion. J Mach Learn Res 21. https:\/\/doi.org\/10.48550\/arXiv.1904.10900","DOI":"10.48550\/arXiv.1904.10900"},{"key":"6601_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72150-7_21","author":"MS Chaudhary","year":"2017","unstructured":"Chaudhary MS, Ranshous S, Samatova NF (2017) A community-driven graph partitioning method for constraint-based causal discovery. The Sixth International Conference on Complex Networks and Their Applications. https:\/\/doi.org\/10.1007\/978-3-319-72150-7_21","journal-title":"The Sixth International Conference on Complex Networks and Their Applications"},{"key":"6601_CR23","doi-asserted-by":"publisher","unstructured":"Li X, Gao X, Wang C (2020) A novel bn learning algorithm based on block learning strategy. Sensors (Basel) 20(21). https:\/\/doi.org\/10.3390\/s20216357","DOI":"10.3390\/s20216357"},{"key":"6601_CR24","doi-asserted-by":"publisher","unstructured":"Wang M, Wang L, Wang C, Wang X, Di R (2018) Finding community structure of bayesian networks by improved k-means algorithm. In: 2018 IEEE 3rd international conference on image, vision and computing (ICIVC), 865\u2013869. https:\/\/doi.org\/10.1109\/ICIVC.2018.8492807","DOI":"10.1109\/ICIVC.2018.8492807"},{"key":"6601_CR25","doi-asserted-by":"publisher","unstructured":"Jung S, Lee KH, Lee D (2007) Enabling large-scale bayesian network learning by preserving intercluster directionality. Ieice Trans Inf Syst E90d(7):1018\u20131027. https:\/\/doi.org\/10.1093\/ietisy\/e90-d.7.1018","DOI":"10.1093\/ietisy\/e90-d.7.1018"},{"issue":"7043","key":"6601_CR26","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818. https:\/\/doi.org\/10.1038\/nature03607","journal-title":"Nature"},{"key":"6601_CR27","doi-asserted-by":"publisher","unstructured":"Lancichinetti A, Fortunato S, Kert\u00e9sz J (2009) Detecting the overlapping and hierarchical community structure of complex networks. New J Phys 11. https:\/\/doi.org\/10.1088\/1367-2630\/11\/3\/033015","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"6601_CR28","doi-asserted-by":"publisher","unstructured":"Steve G (2007) An algorithm to find overlapping community structure in networks. In: European conference on principles & practice of knowledge discovery in databases, pp 91\u2013102. https:\/\/doi.org\/10.1007\/978-3-540-74976-9_12","DOI":"10.1007\/978-3-540-74976-9_12"},{"key":"6601_CR29","doi-asserted-by":"publisher","unstructured":"Kumpula JM, Kivela M, Kaski K, Saramaki J (2008) Sequential algorithm for fast clique percolation. Physical review, E. Statistical, nonlinear, and soft matter physics (2 Pt.2), 78. https:\/\/doi.org\/10.1103\/PhysRevE.78.026109","DOI":"10.1103\/PhysRevE.78.026109"},{"key":"6601_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.neucom.2012.10.035","volume":"123","author":"E Villanueva","year":"2014","unstructured":"Villanueva E, Maciel CD (2014) Efficient methods for learning bayesian network super-structures. Neurocomputing 123:3\u201312. https:\/\/doi.org\/10.1016\/j.neucom.2012.10.035","journal-title":"Neurocomputing"},{"key":"6601_CR31","doi-asserted-by":"publisher","unstructured":"Shen H, Cheng X, Cai K, Hu MB (2009) Detect overlapping and hierarchical community structure in networks. PHYSICA A 388(8):1706\u20131712. https:\/\/doi.org\/10.1016\/j.physa.2008.12.021","DOI":"10.1016\/j.physa.2008.12.021"},{"key":"6601_CR32","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.future.2024.03.047","volume":"158","author":"C Wang","year":"2024","unstructured":"Wang C, Gao X, Li X, Li B, Wan K (2024) Finding community structure in bayesian networks by heuristic k-standard deviation method. Future Generation Comput Syst 158:556\u2013568. https:\/\/doi.org\/10.1016\/j.future.2024.03.047","journal-title":"Future Generation Comput Syst"},{"key":"6601_CR33","doi-asserted-by":"publisher","unstructured":"Dai J, Ren J, Du W (2020) Decomposition-based bayesian network structure learning algorithm using local topology information. Knowl-Based Syst 195. https:\/\/doi.org\/10.1016\/j.knosys.2020.105602","DOI":"10.1016\/j.knosys.2020.105602"},{"key":"6601_CR34","doi-asserted-by":"publisher","unstructured":"Cheng J, Bell DA, Liu W (1997) Learning belief networks from data: an information theory based approach. In: Proceedings of the Sixth international conference on information and knowledge management. CIKM \u201997, pp 325\u2013331. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/266714.266920","DOI":"10.1145\/266714.266920"},{"issue":"7","key":"6601_CR35","doi-asserted-by":"publisher","first-page":"2149","DOI":"10.1007\/s10846-006-9082-0","volume":"7","author":"LMD Campos","year":"2006","unstructured":"Campos LMD (2006) A scoring function for learning bayesian networks based on mutual information and conditional independence tests. J Mach Learn Res 7(7):2149\u20132187. https:\/\/doi.org\/10.1007\/s10846-006-9082-0","journal-title":"J Mach Learn Res"},{"issue":"6062","key":"6601_CR36","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1205438","volume":"334","author":"DN Reshef","year":"2011","unstructured":"Reshef DN, Reshef YA, Finucane HK, Grossman SR, McVean G, Turnbaugh PJ, Lander ES, Mitzenmacher M, Sabeti PC (2011) Detecting novel associations in large data sets. Science 334(6062):1518\u201324. https:\/\/doi.org\/10.1126\/science.1205438","journal-title":"Science"},{"key":"6601_CR37","doi-asserted-by":"publisher","unstructured":"Reshef D, Reshef Y, Mitzenmacher M, Sabeti P (2013) Equitability analysis of the maximal information coefficient, with comparisons. Comput Sci. https:\/\/doi.org\/10.48550\/arXiv.1301.6314","DOI":"10.48550\/arXiv.1301.6314"},{"key":"6601_CR38","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ijar.2019.02.004","volume":"107","author":"J Zhao","year":"2019","unstructured":"Zhao J, Ho S-S (2019) Improving bayesian network local structure learning via data-driven symmetry correction methods. Int J Approximate Reason 107:101\u2013121. https:\/\/doi.org\/10.1016\/j.ijar.2019.02.004","journal-title":"Int J Approximate Reason"},{"issue":"2","key":"6601_CR39","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz G (1978) Estimating the dimension of a model. Annal Stat 6(2):461\u20134644. https:\/\/doi.org\/10.1214\/aos\/1176344136","journal-title":"Annal Stat"},{"key":"6601_CR40","first-page":"459","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","journal-title":"J Mach Learn Res"},{"issue":"12","key":"6601_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1011443","volume":"19","author":"N Bernaola","year":"2023","unstructured":"Bernaola N, Michiels M, Larra\u00f1aga P, Bielza C (2023) Learning massive interpretable gene regulatory networks of the human brain by merging bayesian networks. PLOS Comput Biol 19(12):1\u201325. https:\/\/doi.org\/10.1371\/journal.pcbi.1011443","journal-title":"PLOS Comput Biol"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06601-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06601-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06601-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T13:57:59Z","timestamp":1758290279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06601-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":41,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["6601"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06601-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"27 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","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 there are no conflicts of interest related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent statement"}}],"article-number":"728"}}