{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T06:11:10Z","timestamp":1759385470849},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334597"},{"type":"electronic","value":"9783642334603"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33460-3_37","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T02:18:14Z","timestamp":1347070694000},"page":"490-505","source":"Crossref","is-referenced-by-count":28,"title":["Fully Sparse Topic Models"],"prefix":"10.1007","author":[{"given":"Khoat","family":"Than","sequence":"first","affiliation":[]},{"given":"Tu Bao","family":"Ho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"37_CR1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.14778\/1920841.1920931","volume":"3","author":"A. Smola","year":"2010","unstructured":"Smola, A., Narayanamurthy, S.: An architecture for parallel topic models. Proceedings of the VLDB Endowment\u00a03(1-2), 703\u2013710 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"37_CR2","unstructured":"Hoffman, M.D., Blei, D.M., Bach, F.: Online learning for latent dirichlet allocation. In: NIPS, vol.\u00a023, pp. 856\u2013864 (2010)"},{"key":"37_CR3","first-page":"1801","volume":"10","author":"D. Newman","year":"2009","unstructured":"Newman, D., Asuncion, A., Smyth, P., Welling, M.: Distributed algorithms for topic models. The Journal of Machine Learning Research\u00a010, 1801\u20131828 (2009)","journal-title":"The Journal of Machine Learning Research"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.stamet.2010.03.002","volume":"8","author":"A.U. Asuncion","year":"2011","unstructured":"Asuncion, A.U., Smyth, P., Welling, M.: Asynchronous distributed estimation of topic models for document analysis. Statistical Methodology\u00a08(1), 3\u201317 (2011)","journal-title":"Statistical Methodology"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Wang, Q., Xu, J., Li, H., Craswell, N.: Regularized latent semantic indexing. In: SIGIR 2011, pp. 685\u2013694. ACM (2011)","DOI":"10.1145\/2009916.2010008"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-02158-9_26","volume-title":"Algorithmic Aspects in Information and Management","author":"Y. Wang","year":"2009","unstructured":"Wang, Y., Bai, H., Stanton, M., Chen, W.-Y., Chang, E.Y.: PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol.\u00a05564, pp. 301\u2013314. Springer, Heidelberg (2009)"},{"issue":"3","key":"37_CR7","first-page":"993","volume":"3","author":"D.M. Blei","year":"2003","unstructured":"Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. Journal of Machine Learning Research\u00a03(3), 993\u20131022 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"37_CR8","unstructured":"Sontag, D., Roy, D.M.: Complexity of inference in latent dirichlet allocation. In: Advances in Neural Information Processing Systems, NIPS (2011)"},{"key":"37_CR9","unstructured":"Shashanka, M., Raj, B., Smaragdis, P.: Sparse overcomplete latent variable decomposition of counts data. In: NIPS (2007)"},{"key":"37_CR10","unstructured":"Zhu, J., Xing, E.P.: Sparse topical coding. In: UAI (2011)"},{"key":"37_CR11","unstructured":"Williamson, S., Wang, C., Heller, K.A., Blei, D.M.: The ibp compound dirichlet process and its application to focused topic modeling. In: ICML (2010)"},{"key":"37_CR12","unstructured":"Wang, C., Blei, D.M.: Decoupling sparsity and smoothness in the discrete hierarchical dirichlet process. In: NIPS, vol.\u00a022, pp. 1982\u20131989 (2009)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1007617005950","volume":"42","author":"T. Hofmann","year":"2001","unstructured":"Hofmann, T.: Unsupervised learning by probabilistic latent semantic analysis. Machine Learning\u00a042, 177\u2013196 (2001)","journal-title":"Machine Learning"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824777.1824783","volume":"6","author":"K.L. Clarkson","year":"2010","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the frank-wolfe algorithm. ACM Trans. Algorithms\u00a06, 63:1\u201363:30 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"37_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y. Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Mathematical Programming\u00a0103(1), 127\u2013152 (2005)","journal-title":"Mathematical Programming"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Mathematical Programming, 1\u201333 (2011)","DOI":"10.1007\/s10107-010-0434-y"},{"key":"37_CR17","unstructured":"Murray, W., Gill, P., Wright, M.: Practical optimization. Academic Press (1981)"},{"issue":"1","key":"37_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jmps.1999.1284","volume":"44","author":"M.R. Forster","year":"2000","unstructured":"Forster, M.R.: Key concepts in model selection: Performance and generalizability. Journal of Mathematical Psychology\u00a044(1), 205\u2013231 (2000)","journal-title":"Journal of Mathematical Psychology"},{"key":"37_CR19","first-page":"1871","volume":"9","author":"R. Fan","year":"2008","unstructured":"Fan, R., Chang, K., Hsieh, C., Wang, X., Lin, C.: Liblinear: A library for large linear classification. Journal of Machine Learning Research\u00a09, 1871\u20131874 (2008)","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"37_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2086737.2086743","volume":"5","author":"H.F. Yu","year":"2012","unstructured":"Yu, H.F., Hsieh, C.J., Chang, K.W., Lin, C.J.: Large linear classification when data cannot fit in memory. ACM Trans. Knowl. Discov. Data\u00a05(4), 23:1\u201323:23 (2012)","journal-title":"ACM Trans. Knowl. Discov. Data"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33460-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T04:42:13Z","timestamp":1557204133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33460-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334597","9783642334603"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33460-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}