{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:19Z","timestamp":1750307959068,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273549","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"417-423","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Infinite mixtures of trees"],"prefix":"10.1145","author":[{"given":"Sergey","family":"Kirshner","sequence":"first","affiliation":[{"name":"University of Alberta, Edmonton, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padhraic","family":"Smyth","sequence":"additional","affiliation":[{"name":"University of California, Irvine, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342871"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342372"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63516"},{"key":"e_1_3_2_1_4_1","volume-title":"D. Fisher and H.-J","author":"Chickering D. M.","year":"1996","unstructured":"Chickering , D. M. ( 1996 ). Learning Bayesian networks is NP-complete . In D. Fisher and H.-J . Lenz (Eds.), Learning from data: AI and statistics V, 121--130. New York : Springer-Verlag. Chickering, D. M. (1996). Learning Bayesian networks is NP-complete. In D. Fisher and H.-J. Lenz (Eds.), Learning from data: AI and statistics V, 121--130. New York: Springer-Verlag."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022649401552"},{"key":"e_1_3_2_1_8_1","series-title":"The MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"1990","unstructured":"Cormen , T. H. , Leiserson , C. E. , & Rivest , R. L. ( 1990 ). Introduction to algorithms . The MIT Electrical Engineering and Computer Science Series . MIT Press\/McGraw Hill . Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press\/McGraw Hill."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via EM algorithm","volume":"39","author":"Dempster A. P.","year":"1977","unstructured":"Dempster , A. P. , Laird , N. M. , & Rubin , D. B. ( 1977 ). Maximum likelihood from incomplete data via EM algorithm . Journal of the Royal Statistical Society Series B-Methodological , 39 , 1 -- 38 . Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via EM algorithm. Journal of the Royal Statistical Society Series B-Methodological, 39, 1--38.","journal-title":"Journal of the Royal Statistical Society Series B-Methodological"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342360"},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"On structural approximating multivariate discrete probability-distributions","volume":"20","author":"Grim J.","year":"1984","unstructured":"Grim , J. ( 1984 ). On structural approximating multivariate discrete probability-distributions . Kybernetika , 20 , 1 -- 17 . Grim, J. (1984). On structural approximating multivariate discrete probability-distributions. Kybernetika, 20, 1--17.","journal-title":"Kybernetika"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1994.tb00166.x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-006-5535-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753344605"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1080\/10618600.2000.10474879","article-title":"Markov chain sampling methods for Dirichlet process mixture models","volume":"9","author":"Neal R. M.","year":"2000","unstructured":"Neal , R. M. ( 2000 ). Markov chain sampling methods for Dirichlet process mixture models . Journal of Computational and Graphical Staitistics , 9 , 249 -- 265 . Neal, R. M. (2000). Markov chain sampling methods for Dirichlet process mixture models. Journal of Computational and Graphical Staitistics, 9, 249--265.","journal-title":"Journal of Computational and Graphical Staitistics"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00360-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000000302"},{"key":"e_1_3_2_1_18_1","volume-title":"echnical Report)","author":"West M.","year":"1992","unstructured":"West , M. ( 1992 ). Hyperparameter estimation in Dirichlet process mixture models ( T echnical Report) . Institute of Statistics and Decision Sciences, Duke University . West, M. (1992). Hyperparameter estimation in Dirichlet process mixture models (Technical Report). Institute of Statistics and Decision Sciences, Duke University."}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","sponsor":["Machine Learning Journal"],"location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07"},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273549","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:01Z","timestamp":1750258681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":18,"alternative-id":["10.1145\/1273496.1273549","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273549","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}