{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:09Z","timestamp":1750309509345,"version":"3.41.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:00Z","timestamp":1740182400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071308"],"award-info":[{"award-number":["12071308"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Youth Academic Innovation Team Construction project of the Capital University of Economics and Business, China","award":["QNTD202303"],"award-info":[{"award-number":["QNTD202303"]}]},{"name":"Natural Science Foundation of Fujian Province, China","award":["2022J02050"],"award-info":[{"award-number":["2022J02050"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,4,30]]},"abstract":"<jats:p>Hybrid Bayesian networks (HBN) contain complex conditional probability distributions (CPD) specified as partitioned expressions over discrete and continuous variables. The size of these CPDs grows exponentially with the number of parent nodes, and when using discrete inference methods, it results in significant execution time and space inefficiency. To reduce the CPD size, a binary factorization (BF) algorithm can be used to decompose the statistical or arithmetic functions in the CPD by factorizing the number of connected parent nodes into sets of size two. However, the BF algorithm was not designed to handle partitioned expressions. Therefore, we propose a new stacking factorization (SF) algorithm to decompose partitioned expressions. The SF algorithm creates intermediate nodes to incrementally reconstruct the conditional densities in the original partitioned expression, ensuring that no more than two continuous parent nodes are connected to each child node in the resulting HBN. It generally applies to both discrete and continuous child nodes with complex partitioned expressions. When we combine SF with a dynamic discretization (DD) inference algorithm, we achieve a significant improvement in inference efficiency. Experimental results demonstrate that the combination of SF and DD can effectively manage HBNs with complex CPDs that may challenge other algorithms, which also outperform competing inference algorithms in accuracy.<\/jats:p>","DOI":"10.1145\/3714473","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T14:40:11Z","timestamp":1737643211000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Stacking Factorizing Partitioned Expressions in Hybrid Bayesian Network Models"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7589-3160","authenticated-orcid":false,"given":"Peng","family":"Lin","sequence":"first","affiliation":[{"name":"School of Statistics, Capital University of Economics and Business, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4922-0843","authenticated-orcid":false,"given":"Martin","family":"Neil","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, London, United Kingdom of Great Britain and Northern Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2924-0510","authenticated-orcid":false,"given":"Norman","family":"Fenton","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, London, United Kingdom of Great Britain and Northern Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Agena.AI. 2024. Agena.AI. Retrieved from https:\/\/www.agena.ai\/"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48650-0_19"},{"key":"e_1_3_2_4_2","unstructured":"Bayesfusion. 2024. Genie. Retrieved from https:\/\/www.bayesfusion.com\/genie\/"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.3390\/jpm12081325"},{"key":"e_1_3_2_6_2","unstructured":"Elvira. 2010. Elvira. Retrieved from https:\/\/leo.ugr.es\/elvira\/"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40854-019-0144-2"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1201\/b21982"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1073"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2638586"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2023.109630"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/1795555"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/2074226.2074263"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2011.10.004"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1992.10476265"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1988.tb01721.x"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/2074022.2074062"},{"key":"e_1_3_2_20_2","volume-title":"Hybrid Bayesian Networks for Reasoning about Complex Systems","author":"Lerner Uri N.","year":"2002","unstructured":"Uri N. Lerner. 2002. Hybrid Bayesian Networks for Reasoning about Complex Systems. Stanford University. Retrieved from https:\/\/books.google.co.jp\/books?id=MSnVHgAACAAJ"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12198"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22973"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.09.019"},{"key":"e_1_3_2_24_2","unstructured":"Andr\u00e9s R. Masegosa Ana M. Marti\u0307\u00e9nez Helge Langseth Thomas D. Nielsen Antonio Salmer\u00f3n Dar\u00edo Ramos-L\u00f3pez and Anders L. Madsen. 2016. d-VMP: Distributed variational message passing 321\u2013 332 pages."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/1861751.1861759"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.5555\/2811305"},{"key":"e_1_3_2_27_2","unstructured":"T. Minka J. M. Winn J. P. Guiver Y. Zaykov D. Fabian and J. Bronskill. 2018. \/Infer.NET 0.3. Microsoft Research Cambridge. Retrieved from http:\/\/dotnet.github.io\/infer"},{"key":"e_1_3_2_28_2","first-page":"362","volume-title":"Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI \u201901)","author":"Minka Thomas P.","year":"2001","unstructured":"Thomas P. Minka. 2001. Expectation propagation for approximate Bayesian inference. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI \u201901). Morgan Kaufmann Publishers Inc., San Francisco, CA, 362\u2013369."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.envsoft.2020.104655"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44652-4_15"},{"key":"e_1_3_2_31_2","unstructured":"Kevin Murphy. 2014. BNT Toolbox. Retrieved from https:\/\/github.com\/bayesnet\/bnt"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.87"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.21314\/JOP.2009.057"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9018-y"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2007.03.009"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1516"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/52121"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2010.09.003"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11228"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.21700"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2011.02.005"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.101659"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2007.08.005"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088695"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3522589"},{"key":"e_1_3_2_46_2","first-page":"652","volume-title":"Proceedings of the 11th International Conference on Artificial Intelligence and Statistics","author":"Yuan Changhe","year":"2007","unstructured":"Changhe Yuan and Marek J. Druzdzel. 2007. Importance sampling for general hybrid Bayesian networks. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics. Marina Meila and Xiaotong Shen (Eds.), PMLR, San Juan, Puerto Rico, 652\u2013659."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.5555\/1622756.1622765"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3714473","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3714473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:56Z","timestamp":1750295876000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3714473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,22]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4,30]]}},"alternative-id":["10.1145\/3714473"],"URL":"https:\/\/doi.org\/10.1145\/3714473","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2025,2,22]]},"assertion":[{"value":"2024-05-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}