{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T13:10:27Z","timestamp":1707052227803},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,5,17]],"date-time":"2006-05-17T00:00:00Z","timestamp":1147824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10994-006-8366-8","type":"journal-article","created":{"date-parts":[[2006,5,17]],"date-time":"2006-05-17T22:11:03Z","timestamp":1147903863000},"page":"199-227","source":"Crossref","is-referenced-by-count":3,"title":["Learning decomposable markov networks in pseudo-independent domains with local evaluation"],"prefix":"10.1007","volume":"65","author":[{"given":"Y.","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"8366_CR1","unstructured":"Buntine, W. (1991). Classifiers: A theoretical and empirical study. In Proc. 1991 Inter. Joint Conf. on Artificial Intelligence (pp. 638\u2013644), Sydney."},{"key":"8366_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.62","volume":"2","author":"W. Buntine","year":"1994","unstructured":"Buntine, W. (1994). Operations for learning with graphical models. J. Artificial Intelligence Research, 2, 159\u2013225.","journal-title":"J. Artificial Intelligence Research"},{"key":"8366_CR3","doi-asserted-by":"crossref","unstructured":"Castillo, E., Gutierrez, J., & Hadi, A. (1997). Expert systems and probabilistic network models. Springer.","DOI":"10.1007\/978-1-4612-2270-5"},{"key":"8366_CR4","first-page":"309","volume":"9","author":"G. F. Cooper","year":"1992","unstructured":"Cooper, G. F., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9, 309\u2013347.","journal-title":"Machine Learning"},{"key":"8366_CR5","doi-asserted-by":"crossref","unstructured":"Chow, C. K., & Liu, C. N. (1968). Approximating discrete probability distributions with dependence trees. IEEE Trans. on Information Theory, (14), 462\u2013467.","DOI":"10.1109\/TIT.1968.1054142"},{"issue":"4","key":"8366_CR6","first-page":"97","volume":"18","author":"T. G. Dietterich","year":"1997","unstructured":"Dietterich, T. G. (1997). Machine-learning research. AI Magazine, 18(4), 97\u2013136.","journal-title":"AI Magazine"},{"issue":"3","key":"8366_CR7","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1214\/aos\/1176349260","volume":"21","author":"A. P. Dawid","year":"1993","unstructured":"Dawid, A. P., & Lauritzen S. L. (1993). Hyper Markov laws in the statistical analysis of decomposable graphical models. Annals of Statistics, 21(3), 1272\u20131317.","journal-title":"Annals of Statistics"},{"key":"8366_CR8","doi-asserted-by":"crossref","unstructured":"Edwards D. (1995). Introduction to graphical modelling. Springer-Verlag.","DOI":"10.1007\/978-1-4684-0481-4"},{"issue":"3","key":"8366_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. L. (1989). Decomposition of maximum likelihood in mixed graphical interaction models. Biometrika, 76(3), 539\u2013555.","journal-title":"Biometrika"},{"key":"8366_CR10","unstructured":"Center for Studying Health System Change. (1999). Community tracking study physician survey (pp. 96\u201397), Washington, DC."},{"issue":"2","key":"8366_CR11","first-page":"11","volume":"20","author":"P. Haddawy","year":"1999","unstructured":"Haddawy, P. (1999). An overview of some recent developments in Bayesian problem-solving techniques. AI Magazine, 20(2), 11\u201319.","journal-title":"AI Magazine"},{"key":"8366_CR12","unstructured":"Heckerman D. (1995). A tutorial on learning Bayesian networks. Technical report MSR-TR-95-06, Microsoft Research, Mocrisoft."},{"key":"8366_CR13","first-page":"197","volume":"20","author":"D. Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., & Chickering D. M. (1995). Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20, 197\u2013243.","journal-title":"Machine Learning"},{"key":"8366_CR14","doi-asserted-by":"crossref","unstructured":"Huffman, D. (1952). A method for the construction of minimum redundancy codes. IRE Proceedings, 40, 1098\u20131101.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"8366_CR15","unstructured":"Hu, J., & Xiang, Y. (1997). Learning belief networks in domains with recursively embedded pseudo independent submodels. In: Proc. 13th Conf. on Uncertainty in Artificial Intelligence (pp. 258\u2013265), Providence."},{"key":"8366_CR16","doi-asserted-by":"crossref","unstructured":"Huang, Y., & Xiang, Y. (1999). Learning Bayesian networks by learning decomposable Markov networks first. In: Proc. IEEE Canadian Conf. on Electrical and Computer Engineering, 1704\u20131709 Edmonton.","DOI":"10.1109\/CCECE.1999.804974"},{"key":"8366_CR17","unstructured":"Jensen, F. V., Lauritzen, S. L., & Olesen K. G. (1990). Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, (4), 269\u2013282."},{"key":"8366_CR18","unstructured":"Lauritzen, S. L. (1989). Lectures on contingency tables. Technical Report R 89-24, Aalborg University, Aalborg, Denmark."},{"key":"8366_CR19","doi-asserted-by":"crossref","unstructured":"Lauritzen, S. L. (1996). Graphical models. Oxford.","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"issue":"3","key":"8366_CR20","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., & Bacchus, F. (1994). Learning Bayesian networks: an approach based on the MDL principle. Computational Intelligence, 10(3), 269\u2013293.","journal-title":"Computational Intelligence"},{"key":"8366_CR21","doi-asserted-by":"crossref","unstructured":"Lauritzen, S. L., & Spiegelhalter D. J. (1988). Local computation with probabilities on graphical structures and their application to expert systems. J. Royal Statistical Society, Series B, (50), 157\u2013244.","DOI":"10.1111\/j.2517-6161.1988.tb01721.x"},{"key":"8366_CR22","doi-asserted-by":"crossref","unstructured":"Malvestuto F. M. (1991). Approximating discrete probability distributions with decomposable models. IEEE Tran. on Systems, Man, and Cybernetics, 21(5).","DOI":"10.1109\/21.120082"},{"issue":"428","key":"8366_CR23","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. E. (1994). Model selection and accounting for model uncertainty in graphical models using Occam\u2019s window. J. Amer. Stat. Association, 89(428), 1535\u20131546.","journal-title":"J. Amer. Stat. Association"},{"key":"8366_CR24","unstructured":"Neapolitan, R. E. (2004). Learning Bayesian networks. Prentice Hall."},{"key":"8366_CR25","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann."},{"key":"8366_CR26","doi-asserted-by":"crossref","unstructured":"Rissanen (1978). Modeling by shortest data description. Automatica, 14, 465\u2013471.","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"8366_CR27","unstructured":"Rebane, G., & Pearl, J. (1987). The recovery of causal ploy-trees from statistical data. In L. N. Kanal, J. F. Lemmer, & T. S. Levitt (Eds.), Proc. of Workshop on Uncertainty in Artificial Intelligence. (pp. 222\u2013228), Seattle, Elsevier Science, Amsterdam."},{"issue":"1","key":"8366_CR28","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1177\/089443939100900106","volume":"9","author":"P. Spirtes","year":"1991","unstructured":"Spirtes, P., & Glymour, C. (1991). An algorithm for fast recovery of sparse causal graphs. Social Science Computer Review, 9(1), 62\u201373.","journal-title":"Social Science Computer Review"},{"key":"8366_CR29","doi-asserted-by":"crossref","unstructured":"Shafer, G. (1996). Probabilistic expert systems. Society for industrial and applied mathematics, Philadelphia.","DOI":"10.1137\/1.9781611970043"},{"issue":"1","key":"8366_CR30","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0004-3702(02)00360-0","volume":"143","author":"N. Srebro","year":"2003","unstructured":"Srebro, N. (2003). Maximum likelihood bounded tree-width markov networks. Artificial Intelligence, 143(1), 123\u2013138.","journal-title":"Artificial Intelligence"},{"key":"8366_CR31","unstructured":"Whittaker, J. (1990). Graphical models in applied multivariate statistics. Wiley."},{"key":"8366_CR32","unstructured":"Wong, S. K. M., & Xiang, Y. (1994). Construction of a Markov network from data for probabilistic inference. In: Proc. 3rd Inter. Workshop on Rough Sets and Soft Computing (pp. 562\u2013569), San Jose."},{"key":"8366_CR33","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Hu, J., Cercone, N., & Hamilton, H. (2000). Learning pseudo-independent models: analytical and experimental results. In: H. Hamilton (Eds.), Advances in Artificial Intelligence., (pp. 227\u2013239) Springer.","DOI":"10.1007\/3-540-45486-1_19"},{"key":"8366_CR34","unstructured":"Xiang, Y. (1998). A characterization of single-link search in learning belief networks. In P. Compton H. Motoda, R. Mizoguchi, & H. Liu (Eds.), Proc. Pacific Rim Knowledge Acquisition Workshop (pp. 218\u2013233), Singapore."},{"key":"8366_CR35","doi-asserted-by":"crossref","unstructured":"Xiang, Y. (2002). Probabilistic reasoning in multi-agent systems: A graphical models approach. Cambridge University Press.","DOI":"10.1017\/CBO9780511546938"},{"key":"8366_CR36","unstructured":"Xiang, Y., Wong, S. K. M., & Cercone, N. (1996). Critical remarks on single link search in learning belief networks. In: Proc. 12th Conf. on Uncertainty in Artificial Intelligence (pp. 564\u2013571), Portland."},{"issue":"1","key":"8366_CR37","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1007324100110","volume":"26","author":"Y. Xiang","year":"1997","unstructured":"Xiang, Y., Wong, S. K. M., & Cercone, N. (1997). A \u2018microscopic\u2019 study of minimum entropy search in learning decomposable Markov networks. Machine Learning, 26(1), 65\u201392.","journal-title":"Machine Learning"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-8366-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-006-8366-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-8366-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T12:43:53Z","timestamp":1707050633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-006-8366-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,17]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["8366"],"URL":"https:\/\/doi.org\/10.1007\/s10994-006-8366-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,17]]}}}