{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:13:41Z","timestamp":1750911221577,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JST CREST","award":["JPMJCR1304"],"award-info":[{"award-number":["JPMJCR1304"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098110","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"1165-1174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models"],"prefix":"10.1145","author":[{"given":"Tianyi","family":"Wu","sequence":"first","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinya","family":"Sugawara","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Yamanishi","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100705"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860460"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9046-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276036"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.81"},{"volume-title":"Learning systems of concepts with an infinite relational model AAAI","author":"Kemp C.","key":"e_1_3_2_1_9_1","unstructured":"C. Kemp , J. B. Tenenbaum , T. L. Griffiths , T. Yamada , and N. Ueda 2006. Learning systems of concepts with an infinite relational model AAAI , Vol. Vol. 3 . 5. C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda 2006. Learning systems of concepts with an infinite relational model AAAI, Vol. Vol. 3. 5."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.04.003"},{"volume-title":"An MDL Framework for Data Clustering. Advances in Minimum Description Length: Theory and Applications","author":"Kontkanen P.","key":"e_1_3_2_1_11_1","unstructured":"P. Kontkanen , P. Myllym\"aki, W. Buntine , J. Rissanen , and H. Tirri 2005. An MDL Framework for Data Clustering. Advances in Minimum Description Length: Theory and Applications . MIT Press , 323. P. Kontkanen, P. Myllym\"aki, W. Buntine, J. Rissanen, and H. Tirri 2005. An MDL Framework for Data Clustering. Advances in Minimum Description Length: Theory and Applications. MIT Press, 323."},{"key":"e_1_3_2_1_12_1","unstructured":"J. W. Miller and M. T. Harrison 2013. A simple example of Dirichlet process mixture inconsistency for the number of components Advances in neural information processing systems. 199--206.  J. W. Miller and M. T. Harrison 2013. A simple example of Dirichlet process mixture inconsistency for the number of components Advances in neural information processing systems. 199--206."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/0822"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791635"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1036843.1036902"},{"volume-title":"An NML-based model selection criterion for general relational data modeling 2013 IEEE International Conference on Big Data","author":"Sakai Y.","key":"e_1_3_2_1_17_1","unstructured":"Y. Sakai and K. Yamanishi 2013. An NML-based model selection criterion for general relational data modeling 2013 IEEE International Conference on Big Data . IEEE , 421--429. Y. Sakai and K. Yamanishi 2013. An NML-based model selection criterion for general relational data modeling 2013 IEEE International Conference on Big Data. IEEE, 421--429."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_3_2_1_19_1","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"Shtar'kov Y. M.","year":"1987","unstructured":"Y. M. Shtar'kov . 1987 . Universal sequential coding of single messages . Problemy Peredachi Informatsii Vol. 23 , 3 (1987), 3 -- 17 . Y. M. Shtar'kov. 1987. Universal sequential coding of single messages. Problemy Peredachi Informatsii Vol. 23, 3 (1987), 3--17.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003579900004"},{"key":"e_1_3_2_1_21_1","unstructured":"M. Taddy 2012. On Estimation and Selection for Topic Models.. In AISTATS. 1184--1193.  M. Taddy 2012. On Estimation and Selection for Topic Models.. In AISTATS. 1184--1193."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000000302"},{"key":"e_1_3_2_1_23_1","unstructured":"H. M. Wallach D. M. Mimno and A. McCallum. 2009. Rethinking LDA: Why priors matter. In Advances in neural information processing systems. 1973--1981.  H. M. Wallach D. M. Mimno and A. McCallum. 2009. Rethinking LDA: Why priors matter. In Advances in neural information processing systems. 1973--1981."},{"key":"e_1_3_2_1_24_1","unstructured":"T. Wu S. Sugawara and K. Yamanishi 2017. Supplemental materials for \"Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models\". (2017). shownotehttps:\/\/sites.google.com\/site\/shinyasugawara2012\/wu17_supp2.pdf.endthebibliography  T. Wu S. Sugawara and K. Yamanishi 2017. Supplemental materials for \"Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models\". (2017). shownotehttps:\/\/sites.google.com\/site\/shinyasugawara2012\/wu17_supp2.pdf.endthebibliography"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Halifax NS Canada","acronym":"KDD '17"},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:26Z","timestamp":1750217426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":23,"alternative-id":["10.1145\/3097983.3098110","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098110","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}