{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T07:28:20Z","timestamp":1779262100427,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1020202028934","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:37:24Z","timestamp":1047717444000},"page":"127-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":106,"title":["Improving Markov Chain Monte Carlo Model Search for Data Mining"],"prefix":"10.1007","volume":"50","author":[{"given":"Paolo","family":"Giudici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Castelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5096740_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1111\/1467-9884.00117","volume":"47","author":"S. Brooks","year":"1998","unstructured":"Brooks, S. (1998). Markov chain Monte Carlo method and its application. The Statistician, 47, 69-100.","journal-title":"The Statistician"},{"key":"5096740_CR2","doi-asserted-by":"crossref","unstructured":"Buntine, W. (1991). Theory refinement on bayesian networks. In P. S. B. D'Ambrosio, &; P. Bonissone (Eds.), Proc. of the Conf. on Uncertainty in Artificial Intelligence (pp. 52-60). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-203-8.50010-3"},{"key":"5096740_CR3","unstructured":"Chickering, D. (1995). A transformational characterization of equivalent Bayesian networks. In P. Besnard, &; S. Hanks (Eds.), Proc. of the Conf. on Uncertainty in Artificial Intelligence. (pp. 87-98). Morgan Kaufmann."},{"key":"5096740_CR4","volume-title":"Probabilistic networks and expert systems","author":"R. Cowell","year":"1999","unstructured":"Cowell, R., Dawid, A., Lauritzen, S., &; Spiegelhalter, D. (1999). Probabilistic networks and expert systems. New York: Springer-Verlag."},{"issue":"1","key":"5096740_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1979.tb01052.x","volume":"41","author":"A. Dawid","year":"1979","unstructured":"Dawid, A. (1979). Conditional independence in statistical theory (with discussion). Journal of the Royal Statistical Society B, 41:1, 1-31.","journal-title":"Journal of the Royal Statistical Society B"},{"issue":"3","key":"5096740_CR6","first-page":"1272","volume":"21","author":"A. Dawid","year":"1993","unstructured":"Dawid, A., &; Lauritzen, S. (1993). Hyper-Markov laws in the statistical analysis of decomposable graphical models. Annals of Statistics,21:3, 1272-1317.","journal-title":"Annals of Statistics"},{"issue":"3","key":"5096740_CR7","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1093\/biomet\/86.3.615","volume":"86","author":"P. Dellaportas","year":"1999","unstructured":"Dellaportas, P., &; Forster, J. (1999). Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models. Biometrika, 86:3, 615-633.","journal-title":"Biometrika"},{"issue":"2","key":"5096740_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1093\/biomet\/72.2.339","volume":"72","author":"D. Edwards","year":"1985","unstructured":"Edwards, D., &; Havr\u00e1nek, T. (1985). A fast procedure for model search in multidimensional contingency tables. Biometrika, 72:2, 339-351.","journal-title":"Biometrika"},{"issue":"3","key":"5096740_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1093\/biomet\/76.3.539","volume":"76","author":"M. Frydenberg","year":"1989","unstructured":"Frydenberg, M., &; Lauritzen, S. (1989). Decomposition of maximum likelihood in mixed interaction models. Biometrika, 76:3, 539-555.","journal-title":"Biometrika"},{"key":"5096740_CR10","unstructured":"Gillispie, S., &; Perlman, M. (2001). Enumerating Markov equivalence classes of acyclic digraph models. In J. Breese, &; D. Koller (Eds.), Proc. of the Conf. on Uncertainty in Artificial Intelligence (pp. 171-177). Morgan Kaufmann."},{"issue":"4","key":"5096740_CR11","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1093\/biomet\/86.4.785","volume":"86","author":"P. Giudici","year":"1999","unstructured":"Giudici, P., &; Green, P. (1999). Decomposable graphical gaussian model determination. Biometrika, 86:4, 785-801.","journal-title":"Biometrika"},{"key":"5096740_CR12","doi-asserted-by":"crossref","unstructured":"Giudici, P., &; Passerone, G. (2001). Data mining of association structures to model consumer behaviour. Journal of Computational Statistics and Data Analysis, to appear.","DOI":"10.1016\/S0167-9473(01)00077-9"},{"key":"5096740_CR13","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1023\/A:1022623210503","volume":"20","author":"D. Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., &; Chickering, D. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20, 194-243.","journal-title":"Machine Learning"},{"issue":"430","key":"5096740_CR14","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1080\/01621459.1995.10476572","volume":"90","author":"R. Kass","year":"1995","unstructured":"Kass, R., &; Raftery, A. (1995). Bayes factors. Journal of the American Statistical Association, 90:430, 773-795.","journal-title":"Journal of the American Statistical Association"},{"key":"5096740_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"S. Lauritzen","year":"1996","unstructured":"Lauritzen, S. (1996). Graphical models. Oxford: Oxford University Press."},{"key":"5096740_CR16","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1002\/net.3230200503","volume":"20","author":"S. Lauritzen","year":"1990","unstructured":"Lauritzen, S., Dawid, A., Larsen, B., &; Leimer, H. (1990). Independence properties of directed Markov fields. Networks, 20, 491-505.","journal-title":"Networks"},{"issue":"11","key":"5096740_CR17","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., &; Volinsky, C. (1996). Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs. Communications in Statistics (theory and methods), 25:11, 2493-2512.","journal-title":"Communications in Statistics (theory and methods)"},{"issue":"428","key":"5096740_CR18","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1080\/01621459.1994.10476894","volume":"89","author":"D. Madigan","year":"1994","unstructured":"Madigan, D., &; Raftery, A. (1994). Model selection and accounting for model uncertainty in graphical models using Occam's window. Journal of the American Statistical Association, 89:428, 1535-1546.","journal-title":"Journal of the American Statistical Association"},{"key":"5096740_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2307\/1403615","volume":"63","author":"D. Madigan","year":"1995","unstructured":"Madigan, D., &; York, J. (1995). Bayesian graphical models for discrete data. International Statistical Review, 63, 215-232.","journal-title":"International Statistical Review"},{"key":"5096740_CR20","volume-title":"Probabilistic reasoning in intelligent systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems. San Mateo, California: Morgan Kaufmann."},{"key":"5096740_CR21","unstructured":"Pearl, J., &; Verma, T. (1987). The logic of representing dependencies by directed graphs. In Proc. of the Conf. of the American Association of Artificial Intelligence (pp. 374-379)."},{"key":"5096740_CR22","first-page":"239","volume-title":"New directions in the theory of graphs","author":"R. Robinson","year":"1973","unstructured":"Robinson, R. (1973). Counting labeled acyclic digraphs. In F. Harary (Ed.), New directions in the theory of graphs (pp. 239-273). Academic Press: New York."},{"key":"5096740_CR23","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., &; Yannakakis, M. (1984). Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduc acyclic hypergraphs. SIAM Journal of Computing, 13, 566-579.","journal-title":"SIAM Journal of Computing"},{"key":"5096740_CR24","unstructured":"Verma, T., &; Pearl, J. (1990). Equivalence and synthesis of causal models. In P. Bonissone, M. Henrion, L. Kanal,&; J. Lemmer (Eds.), Proc. of the Conf. on Uncertainty in Artificial Intelligence (pp. 255-268). Morgan Kaufmann."},{"key":"5096740_CR25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02582944","volume":"1","author":"N. Wormald","year":"1985","unstructured":"Wormald, N. (1985). Counting labeled chordal graphs. Graphs and Combinatorics, 1, 193-200.","journal-title":"Graphs and Combinatorics"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020202028934.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020202028934\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020202028934.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:44:19Z","timestamp":1752147859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020202028934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5096740"],"URL":"https:\/\/doi.org\/10.1023\/a:1020202028934","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}