{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T02:07:15Z","timestamp":1777342035077,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"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":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401960","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"569-577","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":341,"title":["Fast collapsed gibbs sampling for latent dirichlet allocation"],"prefix":"10.1145","author":[{"given":"Ian","family":"Porteous","sequence":"first","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"given":"David","family":"Newman","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"given":"Alexander","family":"Ihler","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"given":"Arthur","family":"Asuncion","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"given":"Padhraic","family":"Smyth","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"given":"Max","family":"Welling","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Workshop on High-Performance Data Mining at IPPS\/SPDP","author":"Alsabti K.","year":"1998","unstructured":"K. Alsabti , S. Ranka , and V. Singh . An efficient k-means clustering algorithm . Workshop on High-Performance Data Mining at IPPS\/SPDP , Mar. 1998 . K. Alsabti, S. Ranka, and V. Singh. An efficient k-means clustering algorithm. Workshop on High-Performance Data Mining at IPPS\/SPDP, Mar. 1998."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025132.1026324"},{"key":"e_1_3_2_1_5_1","volume-title":"Neural Information Processing Systems 19","author":"Chemudugunta C.","year":"2006","unstructured":"C. Chemudugunta , P. Smyth , , and M. Steyvers . Modeling general and specific aspects of documents with a probabilistic topic model . In Neural Information Processing Systems 19 . MIT Press , 2006 . C. Chemudugunta, P. Smyth, , and M. Steyvers. Modeling general and specific aspects of documents with a probabilistic topic model. In Neural Information Processing Systems 19. MIT Press, 2006."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"e_1_3_2_1_7_1","volume-title":"Inequalities","author":"Hardy G.","year":"1989","unstructured":"G. Hardy , J. E. Littlewood , and G. Polya . Inequalities . Cambridge University Press , 1989 . G. Hardy, J. E. Littlewood, and G. Polya. Inequalities. Cambridge University Press, 1989."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. Neural Information Processing Systems (NIPS)","author":"Ihler A. T.","year":"2003","unstructured":"A. T. Ihler , E. B. Sudderth , W. T. Freeman , and A. S. Willsky . Efficient multiscale sampling from products of Gaussian mixtures . In Proc. Neural Information Processing Systems (NIPS) 17, Dec. 2003 . A. T. Ihler, E. B. Sudderth, W. T. Freeman, and A. S. Willsky. Efficient multiscale sampling from products of Gaussian mixtures. In Proc. Neural Information Processing Systems (NIPS) 17, Dec. 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.12-06-421"},{"key":"e_1_3_2_1_10_1","volume-title":"NIPS","volume":"19","author":"Kurihara K.","year":"2006","unstructured":"K. Kurihara , M. Welling , and N. Vlassis . Accelerated variational dirichlet process mixtures . In NIPS , volume 19 , 2006 . K. Kurihara, M. Welling, and N. Vlassis. Accelerated variational dirichlet process mixtures. In NIPS, volume 19, 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143917"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255175.1255249"},{"key":"e_1_3_2_1_13_1","volume-title":"NIPS","volume":"10","author":"Moore A.","year":"1998","unstructured":"A. Moore . Very fast EM-based mixture model clustering using multiresolution kd-trees . In NIPS , volume 10 , 1998 . A. Moore. Very fast EM-based mixture model clustering using multiresolution kd-trees. In NIPS, volume 10, 1998."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. Neural Information Processing Systems (NIPS) 22","author":"Newman D.","year":"2007","unstructured":"D. Newman , A. Asuncion , P. Smyth , and M. Welling . Distributed inference for latent Dirichlet allocation . In Proc. Neural Information Processing Systems (NIPS) 22 , dec 2007 . D. Newman, A. Asuncion, P. Smyth, and M. Welling. Distributed inference for latent Dirichlet allocation. In Proc. Neural Information Processing Systems (NIPS) 22, dec 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255175.1255248"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312248"},{"key":"e_1_3_2_1_17_1","first-page":"727","volume-title":"ICML","volume":"17","author":"Pelleg D.","year":"2000","unstructured":"D. Pelleg and A. Moore . X-means: Extending K-means with efficient estimation of the number of clusters . In ICML , volume 17 , pages 727 -- 734 , 2000 . D. Pelleg and A. Moore. X-means: Extending K-means with efficient estimation of the number of clusters. In ICML, volume 17, pages 727--734, 2000."},{"key":"e_1_3_2_1_18_1","volume-title":"NIPS","volume":"17","author":"Teh Y.","year":"2004","unstructured":"Y. Teh , M. Jordan , M. Beal , and D. Blei . Hierarchical Dirichlet processes . In NIPS , volume 17 , 2004 . Y. Teh, M. Jordan, M. Beal, and D. Blei. Hierarchical Dirichlet processes. In NIPS, volume 17, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148204"}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Las Vegas Nevada USA","acronym":"KDD08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401960","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:41Z","timestamp":1750255001000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":19,"alternative-id":["10.1145\/1401890.1401960","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401960","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}