{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T22:13:41Z","timestamp":1759702421639,"version":"3.34.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,16]],"date-time":"2008-05-16T00:00:00Z","timestamp":1210896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10618-008-0099-9","type":"journal-article","created":{"date-parts":[[2008,5,15]],"date-time":"2008-05-15T10:07:45Z","timestamp":1210846065000},"page":"431-456","source":"Crossref","is-referenced-by-count":32,"title":["Parallell interacting MCMC for learning of topologies of graphical models"],"prefix":"10.1007","volume":"17","author":[{"given":"Jukka","family":"Corander","sequence":"first","affiliation":[]},{"given":"Magnus","family":"Ekdahl","sequence":"additional","affiliation":[]},{"given":"Timo","family":"Koski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,16]]},"reference":[{"unstructured":"Andersson SA, Madigan D, Perlman MD (1996) An alternative Markov property for chain graphs. In: Uncertainty in artificial intelligence: proceedings of the twelfth conference. Morgan Kaufmann, San Francisco, pp 40\u201348","key":"99_CR1"},{"key":"99_CR2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1214\/aos\/1031833662","volume":"25","author":"SA Andersson","year":"1997","unstructured":"Andersson SA, Madigan D and Perlman MD (1997). A characterization of Markov equivalence classes for acyclic digraphs. Ann Statist 25: 505\u2013541","journal-title":"Ann Statist"},{"key":"99_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1111\/1467-9469.00224","volume":"28","author":"SA Andersson","year":"2001","unstructured":"Andersson SA, Madigan D and Perlman MD (2001). Alternative Markov properties for chain graphs. Scand J Stat 28: 33\u201385","journal-title":"Scand J Stat"},{"unstructured":"Chickering DM (1995) A transformational characterization of equivalent Bayesian network structures. In: Uncertainty in artificial intelligence: proceedings of the eleventh conference. Morgan Kaufmann, San Francisco, pp 87\u201398","key":"99_CR4"},{"key":"99_CR5","first-page":"445","volume":"2","author":"DM Chickering","year":"2002","unstructured":"Chickering DM (2002a). Learning equivalence classes of Bayesian network structures. J Mach Learn Res 2: 445\u2013498","journal-title":"J Mach Learn Res"},{"key":"99_CR6","first-page":"507","volume":"3","author":"DM Chickering","year":"2002","unstructured":"Chickering DM (2002b). Optimal structure identification with greedy search. J Mach Learn Res 3: 507\u2013554","journal-title":"J Mach Learn Res"},{"key":"99_CR7","first-page":"309","volume":"9","author":"G Cooper","year":"1992","unstructured":"Cooper G and Hershkovitz E (1992). A bayesian method for the induction of probabilistic networks from data. Mach Learn 9: 309\u2013347","journal-title":"Mach Learn"},{"key":"99_CR8","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0047-259X(02)00033-7","volume":"85","author":"J Corander","year":"2003","unstructured":"Corander J (2003). Bayesian graphical model determination using decision theory. J Multivariate Anal 85: 253\u2013266","journal-title":"J Multivariate Anal"},{"key":"99_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11222-006-9391-y","volume":"16","author":"J Corander","year":"2006","unstructured":"Corander J, Gyllenberg M and Koski T (2006). Bayesian model learning based on parallel mcmc strategy. Stat Comput 16: 355\u2013362","journal-title":"Stat Comput"},{"key":"99_CR10","volume-title":"Probabilistic networks and expert systems","author":"RG Cowell","year":"1999","unstructured":"Cowell RG, Dawid AP, Lauritzen SL and Spiegelhalter DJ (1999). Probabilistic networks and expert systems. Springer, New York"},{"key":"99_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1979.tb01052.x","volume":"41","author":"AP Dawid","year":"1979","unstructured":"Dawid AP (1979). Conditional independence in statistical theory. J Roy Stat Soc B 41: 1\u201331","journal-title":"J Roy Stat Soc B"},{"key":"99_CR12","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1214\/aos\/1176349260","volume":"21","author":"AP Dawid","year":"1993","unstructured":"Dawid AP and Lauritzen SL (1993). Hyper-Markov laws in the statistical analysis of decomposable graphical models. Ann Statist 21: 1272\u20131317","journal-title":"Ann Statist"},{"key":"99_CR13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1093\/biomet\/86.3.615","volume":"86","author":"P Dellaportas","year":"1999","unstructured":"Dellaportas P and Forster J (1999). Markov chain monte carlo model determination for hierarchical and graphical log-linear models. Biometrika 86: 615\u2013633","journal-title":"Biometrika"},{"key":"99_CR14","volume-title":"Probability: theory and examples","author":"R Durrett","year":"1996","unstructured":"Durrett R (1996). Probability: theory and examples. Duxbury Press, CA"},{"key":"99_CR15","first-page":"333","volume":"17","author":"M Frydenberg","year":"1990","unstructured":"Frydenberg M (1990). The chain graph Markov property. Scand J Stat 17: 333\u2013353","journal-title":"Scand J Stat"},{"key":"99_CR16","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1093\/biomet\/76.3.539","volume":"76","author":"M Frydenberg","year":"1989","unstructured":"Frydenberg M and Lauritzen SL (1989). Decomposition of maximum likelihood in mixed graphical interaction models. Biometrika 76: 539\u2013555","journal-title":"Biometrika"},{"key":"99_CR17","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1080\/01621459.1995.10476590","volume":"90","author":"CJ Geyer","year":"1995","unstructured":"Geyer CJ and Thompson EA (1995). Annealing Markov chain Monte Carlo with applications to ancestral inference. J Am Stat Assoc 90: 909\u2013920","journal-title":"J Am Stat Assoc"},{"unstructured":"Gillispie SB, Perlman MD (2001) Enumerating Markov equivalence classes of acyclic digraph models. In: Uncertainty in artificial intelligence: proceedings of the seventeeth conference. Morgan Kaufmann, San Francisco, pp 171\u2013177","key":"99_CR18"},{"key":"99_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1020202028934","volume":"50","author":"P Giudici","year":"2003","unstructured":"Giudici P and Castelo R (2003). Improving Markov chain Monte Carlo model search for data mining. Mach Learn 50: 127\u2013158","journal-title":"Mach Learn"},{"key":"99_CR20","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1093\/biomet\/86.4.785","volume":"86","author":"P Giudici","year":"1999","unstructured":"Giudici P and Green PJ (1999). Decomposable graphical Gaussian model determination. Biometrika 86: 785\u2013801","journal-title":"Biometrika"},{"key":"99_CR21","volume-title":"Markov Chains: theory and applications","author":"DL Isaacson","year":"1976","unstructured":"Isaacson DL and Madsen RW (1976). Markov Chains: theory and applications. Wiley, New York"},{"key":"99_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/int.20138","volume":"21","author":"M Janzura","year":"2006","unstructured":"Janzura M and Nielsen J (2006). A simulated annealing-based method for learning Bayesian networks from statistical data. Int J Intell Syst 21: 335\u2013348","journal-title":"Int J Intell Syst"},{"key":"99_CR23","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1214\/088342305000000304","volume":"20","author":"B Jones","year":"2005","unstructured":"Jones B, Carvalho C and Dobra A et al (2005). Experiments in stochastic computation for high-dimensional graphical models. Stat Sci 20: 388\u2013400","journal-title":"Stat Sci"},{"key":"99_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-5014-9","volume-title":"Learning in graphical models","author":"MI Jordan","year":"1998","unstructured":"Jordan MI (1998). Learning in graphical models. MIT Press, Cumberland"},{"key":"99_CR25","first-page":"549","volume":"5","author":"M Koivisto","year":"2004","unstructured":"Koivisto M and Sood K (2004). Exact Bayesian structure discovery in Bayesian networks. J Mach Learn Res 5: 549\u2013573","journal-title":"J Mach Learn Res"},{"key":"99_CR26","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1111\/j.1467-8640.1994.tb00166.x","volume":"10","author":"W Lam","year":"1994","unstructured":"Lam W and Bacchus F (1994). Learning Bayesian belief networks: An approach based on the MDL principle. Comput Intell 10: 269\u2013293","journal-title":"Comput Intell"},{"key":"99_CR27","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1080\/03610929608831853","volume":"25","author":"D Madigan","year":"1996","unstructured":"Madigan D, Andersson S, Perlman M and Volinsky C (1996). Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Communtat Theor Meth 25: 2493\u20132519","journal-title":"Communtat Theor Meth"},{"key":"99_CR28","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1080\/01621459.1994.10476894","volume":"89","author":"D Madigan","year":"1994","unstructured":"Madigan D and Raftery A (1994). Model selection and accounting for model uncertainly in graphicalmodels using Occam\u2019s window. J Am Stat Assoc 89: 1535\u20131546","journal-title":"J Am Stat Assoc"},{"unstructured":"Pe\u00f1a JM (2007) Approximate counting of graphical models via MCMC. In: Proceedings of the 11th international conference on artificial intelligence, pp 352\u2013359","key":"99_CR29"},{"key":"99_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF03178929","volume":"2","author":"I Poli","year":"1998","unstructured":"Poli I and Roverato A (1998). A genetic algorithm for graphical model selection. J Italian Stat Soc 2: 197\u2013208","journal-title":"J Italian Stat Soc"},{"key":"99_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/11564096_33","volume-title":"MCMC learning of Bayesian network models by markov blanket decomposition","author":"C Riggelsen","year":"2005","unstructured":"Riggelsen C (2005). MCMC learning of Bayesian network models by markov blanket decomposition. Springer, New York"},{"key":"99_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo statistical methods","author":"C Robert","year":"2004","unstructured":"Robert C and Casella G (2004). Monte Carlo statistical methods, 2nd edn. Springer, New York","edition":"2"},{"key":"99_CR33","first-page":"1045","volume":"7","author":"A Roverato","year":"2006","unstructured":"Roverato A and Studen\u00fd M (2006). A graphical representation of equivalence classes of AMP chain graphs. J Mach Learn Res 7: 1045\u20131078","journal-title":"J Mach Learn Res"},{"key":"99_CR34","first-page":"1","volume":"4","author":"R Sanguesa","year":"1997","unstructured":"Sanguesa R and Cortes U (1997). Learning causal networks from data: a survey and a new algorithm to learn possibilistic causal networks from data.. AI Commun 4: 1\u201331","journal-title":"AI Commun"},{"key":"99_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2748-9","volume-title":"Causation, prediction and search","author":"P Spirtes","year":"1993","unstructured":"Spirtes P, Glymour C and Scheines R (1993). Causation, prediction and search. Springer, New York"},{"unstructured":"Studen\u00fd M (1998) Bayesian networks from the point of view of chain graphs. Uncertainty in Artificial Intelligence: In: proceedings of the twelfth conference. Morgan Kaufmann, San Francisco, pp 496\u2013503","key":"99_CR36"},{"key":"99_CR37","first-page":"771","volume":"2","author":"R Sundberg","year":"1975","unstructured":"Sundberg R (1975). Some results about decomposable (or markov-type) models for multidimensional contingency tables: distribution of marginals and partitioning of tests. Scand J Stat 2: 771\u2013779","journal-title":"Scand J Stat"},{"unstructured":"Suzuki J (1996) Learning Bayesian belief networks based on the minimum description length principle. In: International Conference Machine on Learning, Morgan Kaufmann, San Francisco, pp 462\u2013470","key":"99_CR38"},{"key":"99_CR39","doi-asserted-by":"crossref","first-page":"4767","DOI":"10.1109\/TIT.2006.883611","volume":"52","author":"J Suzuki","year":"2006","unstructured":"Suzuki J (2006). On strong consistency of model selection in classification. IEEE Trans Inform Theory 52: 4767\u20134774","journal-title":"IEEE Trans Inform Theory"},{"key":"99_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: theory and applications","author":"PJM Laarhoven van","year":"1987","unstructured":"van Laarhoven PJM, Aarts EHJ (1987). Simulated annealing: theory and applications. Kluwer, Norwell"},{"unstructured":"Verma E, Pearl J (1990) Equivalence and synthesis of causal models. In: Uncertainty in artificial intelligence: proceedings of the sixth conference. Elsevier, New York, pp 220\u2013227","key":"99_CR41"},{"key":"99_CR42","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0888-613X(99)00003-1","volume":"20","author":"M Volf","year":"1999","unstructured":"Volf M and Studen\u00fd M (1999). A graphical characterization of the largest chain graphs. Int J Approx Reason 20: 209\u2013236","journal-title":"Int J Approx Reason"},{"key":"99_CR43","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF00143552","volume":"6","author":"D Wedelin","year":"1996","unstructured":"Wedelin D (1996). Efficient estimation and model selection in large graphical models. Stat Comput 6: 313\u2013323","journal-title":"Stat Comput"},{"key":"99_CR44","volume-title":"Graphical models in applied multivariate statistics","author":"J Whittaker","year":"1990","unstructured":"Whittaker J (1990). Graphical models in applied multivariate statistics. Wiley, Chichester"},{"key":"99_CR45","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1093\/biomet\/90.4.809","volume":"90","author":"F Wong","year":"2003","unstructured":"Wong F, Carter C and Kohn R (2003). Efficient estimation of covariance selection models. Biometrika 90: 809\u2013830","journal-title":"Biometrika"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0099-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-008-0099-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0099-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T08:46:12Z","timestamp":1738226772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-008-0099-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,16]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["99"],"URL":"https:\/\/doi.org\/10.1007\/s10618-008-0099-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2008,5,16]]}}}