{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T12:20:43Z","timestamp":1783167643908,"version":"3.54.6"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2024-00336424"],"award-info":[{"award-number":["RS-2024-00336424"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2020R1A2C1A01008767"],"award-info":[{"award-number":["2020R1A2C1A01008767"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ijar.2026.109717","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T02:25:28Z","timestamp":1778552728000},"page":"109717","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A sequential approach for combining model structures of undirected graphical models"],"prefix":"10.1016","volume":"196","author":[{"given":"Gang-hoo","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Namgil","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8401-771X","authenticated-orcid":false,"given":"Sung-Ho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2026.109717_bib0001","first-page":"35","article-title":"Causation, regression, and path analysis","author":"Tukey","year":"1954"},{"key":"10.1016\/j.ijar.2026.109717_bib0002","doi-asserted-by":"crossref","first-page":"236","DOI":"10.2307\/2527672","article-title":"The regression analysis of causal paths","volume":"15","author":"Turner","year":"1959","journal-title":"Biometrics"},{"key":"10.1016\/j.ijar.2026.109717_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1086\/224256","article-title":"Path analysis: Sociological examples","volume":"72","author":"Duncan","year":"1966","journal-title":"Am. J. Sociol."},{"issue":"1","key":"10.1016\/j.ijar.2026.109717_bib0004","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1093\/biomet\/60.1.179","article-title":"The analysis of multidimensional contingency tables when some variables are posterior to others: A modified path analysis approach","volume":"60","author":"Goodman","year":"1966","journal-title":"Biometrika"},{"key":"10.1016\/j.ijar.2026.109717_bib0005","first-page":"121","article-title":"Learning Bayesian networks is NP-Complete","volume":"V","author":"Chickering","year":"1996"},{"key":"10.1016\/j.ijar.2026.109717_bib0006","series-title":"Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA","first-page":"504","article-title":"Maximum likelihood bounded tree-width Markov networks","author":"Srebro","year":"2001"},{"key":"10.1016\/j.ijar.2026.109717_bib0007","first-page":"181","article-title":"Causality from probability","author":"Spirtes","year":"1990","journal-title":"Evol. Knowl. Nat. Artif. Intell."},{"key":"10.1016\/j.ijar.2026.109717_bib0008","first-page":"507","article-title":"Optimal structure identification with greedy search","volume":"3","author":"Chickering","year":"2002","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10.1016\/j.ijar.2026.109717_bib0009","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","article-title":"The max-min hill-climbing bayesian network structure learning algorithm","volume":"65","author":"Tsamardinos","year":"2006","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2026.109717_bib0010","first-page":"1","article-title":"Integrating locally learned causal structures with overlapping variables","volume":"21","author":"Tillman","year":"2008","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ijar.2026.109717_bib0011","first-page":"355","article-title":"Searching model structures based on marginal model structures","author":"Kim","year":"2008","journal-title":"New Dev. Robot. Autom. Control"},{"key":"10.1016\/j.ijar.2026.109717_bib0012","series-title":"Learning model structures based on marginal model structures of undirected graphs","author":"Kim","year":"2009"},{"issue":"8","key":"10.1016\/j.ijar.2026.109717_bib0013","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.csda.2005.03.009","article-title":"Conditional log-linear structures for log-linear modelling","volume":"50","author":"Kim","year":"2006","journal-title":"Comput. Stat. Data Anal."},{"key":"10.1016\/j.ijar.2026.109717_bib0014","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1214\/aos\/1176349260","article-title":"Hyper Markov laws in the statistical analysis of decomposable graphical models","volume":"21","author":"Dawid","year":"1993","journal-title":"Ann. Stat."},{"issue":"455","key":"10.1016\/j.ijar.2026.109717_bib0015","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/01621459.1999.10473838","article-title":"Combining conditional log-linear structures","volume":"94","author":"Fienberg","year":"1999","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.ijar.2026.109717_bib0016","series-title":"MICAI 2006, Lecture Notes in Artificial Intelligence, LNAI 4293. Advances in Artificial Intelligence.","first-page":"15","article-title":"Properties of markovian subgraphs of a decomposable graph","author":"Kim","year":"2006"},{"key":"10.1016\/j.ijar.2026.109717_bib0017","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1090\/conm\/516\/10179","article-title":"Combining statistical models","volume":"516","author":"Massa","year":"2010","journal-title":"Contemp. Math."},{"issue":"9","key":"10.1016\/j.ijar.2026.109717_bib0018","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1080\/00949655.2012.667216","article-title":"Effectiveness of combinations of Gaussian graphical models for model building","volume":"83","author":"Massa","year":"2013","journal-title":"J. Stat. Comput. Simul."},{"issue":"1","key":"10.1016\/j.ijar.2026.109717_bib0019","doi-asserted-by":"crossref","first-page":"626","DOI":"10.3150\/15-BEJ759","article-title":"Algebraic representations of Gaussian Markov combinations","volume":"23","author":"Massa","year":"2017","journal-title":"Bernoulli"},{"key":"10.1016\/j.ijar.2026.109717_bib0020","series-title":"Proceedings of FLAIRS-34","article-title":"Constraint-Based Bayesian network structure learning using uncertain Experts\u2019 knowledge","volume":"34","author":"Gonzales","year":"2021"},{"issue":"2","key":"10.1016\/j.ijar.2026.109717_bib0021","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s11222-019-09877-x","article-title":"Marginal information for structure learning","volume":"30","author":"Kim","year":"2020","journal-title":"Stat. Comput."},{"key":"10.1016\/j.ijar.2026.109717_bib0022","series-title":"Proceedings of the 18th International Conference on Artificial Intelligence and Statistics (AISTATS) 2015, San Diego, CA, USA","first-page":"977","article-title":"Missing at random in graphical models","volume":"38","author":"Tian","year":"2015"},{"key":"10.1016\/j.ijar.2026.109717_bib0023","series-title":"Proceedings of the 39th International Conference on Machine Learning, Baltimore, Maryland, USA, PMLR 162, 2022","article-title":"Causal inference through the structural causal marginal problem","volume":"34","author":"Gresele","year":"2022"},{"issue":"1","key":"10.1016\/j.ijar.2026.109717_bib0024","doi-asserted-by":"crossref","first-page":"41","DOI":"10.2333\/bhmk.41.41","article-title":"Learning causal structure from multiple datasets with similar variable sets","volume":"41","author":"Tillman","year":"2014","journal-title":"Behaviormetrika"},{"key":"10.1016\/j.ijar.2026.109717_bib0025","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"10153","article-title":"Causal discovery from multiple datasets with non-identical variable sets","volume":"34","author":"Huang","year":"2020"},{"key":"10.1016\/j.ijar.2026.109717_bib0026","first-page":"290","article-title":"On random graphs","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math."},{"key":"10.1016\/j.ijar.2026.109717_bib0027","series-title":"Encyclopedia of Computer Science","first-page":"260","article-title":"Computational complexity","author":"Papadimitriou","year":"2003"},{"key":"10.1016\/j.ijar.2026.109717_bib0028","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1-2","key":"10.1016\/j.ijar.2026.109717_bib0029","article-title":"The decision problem for a class of first-order formulas in which all disjunctions are binary","volume":"13","author":"Krom","year":"1967","journal-title":"Z. f\u201dur math. Log. Grundl. Math."},{"key":"10.1016\/j.ijar.2026.109717_bib0030","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inf. Process. Lett."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26000939?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26000939?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T12:04:20Z","timestamp":1783166660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X26000939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":30,"alternative-id":["S0888613X26000939"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109717","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A sequential approach for combining model structures of undirected graphical models","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109717","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109717"}}