{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:40:35Z","timestamp":1761648035468,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T00:00:00Z","timestamp":1359936000000},"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":[[2013,2,4]]},"DOI":"10.1145\/2433396.2433438","type":"proceedings-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T13:19:52Z","timestamp":1360070392000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Group sparse topical coding"],"prefix":"10.1145","author":[{"given":"Lu","family":"Bai","sequence":"first","affiliation":[{"name":"Institute Of Computing Technology, Chinese Academy Of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiafeng","family":"Guo","sequence":"additional","affiliation":[{"name":"Institute Of Computing Technology, Chinese Academy Of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyan","family":"Lan","sequence":"additional","affiliation":[{"name":"Institute Of Computing Technology, Chinese Academy Of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqi","family":"Cheng","sequence":"additional","affiliation":[{"name":"Institute Of Computing Technology, Chinese Academy Of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,2,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_3_2_1_2_1","volume-title":"Algorithms, initializations, and convergence for the nonnegative matrix factorization. Matrix, (919):1--18","author":"Albright R.","year":"2006","unstructured":"R. Albright , J. Cox , D. Duling , A. N. Langville , and C. D. Meyer . Algorithms, initializations, and convergence for the nonnegative matrix factorization. Matrix, (919):1--18 , 2006 . R. Albright, J. Cox, D. Duling, A. N. Langville, and C. D. Meyer. Algorithms, initializations, and convergence for the nonnegative matrix factorization. Matrix, (919):1--18, 2006."},{"key":"e_1_3_2_1_3_1","first-page":"82","volume-title":"NIPS","author":"Bengio S.","year":"2009","unstructured":"S. Bengio , F. C. N. Pereira , Y. Singer , D. Strelow , and D. Strelow . Group sparse coding . In NIPS , pages 82 -- 89 , 2009 . S. Bengio, F. C. N. Pereira, Y. Singer, D. Strelow, and D. Strelow. Group sparse coding. In NIPS, pages 82--89, 2009."},{"key":"e_1_3_2_1_4_1","volume-title":"NIPS","author":"Blei D. M.","year":"2005","unstructured":"D. M. Blei and J. D. Lafferty . Correlated topic models . In NIPS , 2005 . D. M. Blei and J. D. Lafferty. Correlated topic models. In NIPS, 2005."},{"key":"e_1_3_2_1_5_1","first-page":"2003","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei D. M.","year":"2003","unstructured":"D. M. Blei , A. Y. Ng , M. I. Jordan , and J. Lafferty . Latent dirichlet allocation . Journal of Machine Learning Research , 3 : 2003 , 2003 . D. M. Blei, A. Y. Ng, M. I. Jordan, and J. Lafferty. Latent dirichlet allocation. Journal of Machine Learning Research, 3:2003, 2003.","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/11752790_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1458082.1458202"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/TKDE.2007.190669"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1390156.1390191"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1214\/009053604000000067"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/LSP.2006.870353"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"A note on the group lasso and a sparse group lasso. Arxiv preprint arXiv10010736","author":"Friedman J.","year":"2010","unstructured":"J. Friedman , T. Hastie , and R. Tibshirani . A note on the group lasso and a sparse group lasso. Arxiv preprint arXiv10010736 , pages 1 -- 8 , 2010 . J. Friedman, T. Hastie, and R. Tibshirani. A note on the group lasso and a sparse group lasso. Arxiv preprint arXiv10010736, pages 1--8, 2010."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of NIPS","author":"Graca J.","year":"2009","unstructured":"J. Graca , K. Ganchev , B. Taskar , and F. Pereira . Posterior vs Parameter Sparsity in Latent Variable Models . In Proceedings of NIPS , 2009 . J. Graca, K. Ganchev, B. Taskar, and F. Pereira. Posterior vs Parameter Sparsity in Latent Variable Models. In Proceedings of NIPS, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/1248547.1248598"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/599609.599631"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1553374.1553431"},{"key":"e_1_3_2_1_18_1","first-page":"487","volume-title":"ICML","author":"Jenatton R.","year":"2010","unstructured":"R. Jenatton , J. Mairal , G. Obozinski , and F. Bach . Proximal methods for sparse hierarchical dictionary learning . In ICML , pages 487 -- 494 , 2010 . R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In ICML, pages 487--494, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1214\/10-BA607"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1038\/44565"},{"key":"e_1_3_2_1_21_1","first-page":"801","volume-title":"NIPS","author":"Lee H.","year":"2006","unstructured":"H. Lee , A. Battle , R. Raina , and A. Y. Ng . Efficient sparse coding algorithms . In NIPS , pages 801 -- 808 , 2006 . H. Lee, A. Battle, R. Raina, and A. Y. Ng. Efficient sparse coding algorithms. In NIPS, pages 801--808, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/1661445.1661623"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1038\/381607a0"},{"key":"e_1_3_2_1_24_1","first-page":"889","volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML-11), ICML'11","author":"Paisley J.","year":"2011","unstructured":"J. Paisley , L. Carin , and D. Blei . Variational inference for stick-breaking beta process priors. In L. Getoor and T. Scheffer, editors , Proceedings of the 28th International Conference on Machine Learning (ICML-11), ICML'11 , pages 889 -- 896 , New York, NY, USA , June 2011 . ACM. J. Paisley, L. Carin, and D. Blei. Variational inference for stick-breaking beta process priors. In L. Getoor and T. Scheffer, editors, Proceedings of the 28th International Conference on Machine Learning (ICML-11), ICML'11, pages 889--896, New York, NY, USA, June 2011. ACM."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1553374.1553487"},{"key":"e_1_3_2_1_26_1","first-page":"456","volume-title":"Proc. of Conf. on Artificial Intelligence and Statistics","author":"Schmidt M.","year":"2009","unstructured":"M. Schmidt , E. V. D. Berg , M. P. Friedl , and K. Murphy . Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm . In Proc. of Conf. on Artificial Intelligence and Statistics , pages 456 -- 463 , 2009 . M. Schmidt, E. V. D. Berg, M. P. Friedl, and K. Murphy. Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm. In Proc. of Conf. on Artificial Intelligence and Statistics, pages 456--463, 2009."},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Sparse overcomplete latent variable decomposition of counts data","volume":"20","author":"Shashanka M.","year":"2008","unstructured":"M. Shashanka , B. Raj , and P. Smaragdis . Sparse overcomplete latent variable decomposition of counts data . Advances in Neural Information Processing Systems 20 , 20(1): 1 -- 8 , 2008 . M. Shashanka, B. Raj, and P. Smaragdis. Sparse overcomplete latent variable decomposition of counts data. Advances in Neural Information Processing Systems 20, 20(1):1--8, 2008.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_28_1","volume-title":"Non-monotonic poisson likelihood maximization. Technical report","author":"Sra S.","year":"2008","unstructured":"S. Sra , D. Kim , S. Sra , D. Kim , and B. Sch\u00f6lkopf . Non-monotonic poisson likelihood maximization. Technical report , 2008 . S. Sra, D. Kim, S. Sra, D. Kim, and B. Sch\u00f6lkopf. Non-monotonic poisson likelihood maximization. Technical report, 2008."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani R.","year":"1994","unstructured":"R. Tibshirani . Regression shrinkage and selection via the lasso . Journal of the Royal Statistical Society, Series B , 58 : 267 -- 288 , 1994 . R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58:267--288, 1994.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1111\/j.1467-9868.2005.00490.x"},{"key":"e_1_3_2_1_31_1","first-page":"1982","volume-title":"Advances in Neural Information Processing Systems 22","author":"Wang C.","year":"2009","unstructured":"C. Wang and D. Blei . Decoupling Sparsity and Smoothness in the Discrete Hierarchical Dirichlet Process. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors , Advances in Neural Information Processing Systems 22 , pages 1982 -- 1989 . 2009 . C. Wang and D. Blei. Decoupling Sparsity and Smoothness in the Discrete Hierarchical Dirichlet Process. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pages 1982--1989. 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2020408.2020480"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/2009916.2010008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/1148170.1148204"},{"key":"e_1_3_2_1_35_1","first-page":"1151","volume-title":"ICML","author":"Williamson S.","year":"2010","unstructured":"S. Williamson , C. Wang , K. A. Heller , and D. M. Blei . The ibp compound dirichlet process and its application to focused topic modeling . In ICML , pages 1151 -- 1158 , 2010 . S. Williamson, C. Wang, K. A. Heller, and D. M. Blei. The ibp compound dirichlet process and its application to focused topic modeling. In ICML, pages 1151--1158, 2010."},{"key":"e_1_3_2_1_36_1","volume-title":"IEEE Computer Society Conference on, 0: 1794--1801","author":"Yang J.","year":"2009","unstructured":"J. Yang , K. Yu , Y. Gong , and T. Huang . Linear spatial pyramid matching using sparse coding for image classification. Computer Vision and Pattern Recognition , IEEE Computer Society Conference on, 0: 1794--1801 , 2009 . J. Yang, K. Yu, Y. Gong, and T. Huang. Linear spatial pyramid matching using sparse coding for image classification. Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, 0:1794--1801, 2009."},{"key":"e_1_3_2_1_37_1","first-page":"2151","volume-title":"Advances in Neural Information Processing Systems 22","author":"Yang X.","year":"2009","unstructured":"X. Yang , S. Kim , and E. Xing . Heterogeneous multitask learning with joint sparsity constraints. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors , Advances in Neural Information Processing Systems 22 , pages 2151 -- 2159 . 2009 . X. Yang, S. Kim, and E. Xing. Heterogeneous multitask learning with joint sparsity constraints. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pages 2151--2159. 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"e_1_3_2_1_39_1","volume-title":"Beta-negative binomial process and poisson factor analysis","author":"Zhou M.","year":"2011","unstructured":"M. Zhou , L. Hannah , D. Dunson , and L. Carin . Beta-negative binomial process and poisson factor analysis . 2011 . M. Zhou, L. Hannah, D. Dunson, and L. Carin. Beta-negative binomial process and poisson factor analysis. 2011."},{"key":"e_1_3_2_1_40_1","first-page":"831","volume-title":"UAI","author":"Zhu J.","year":"2011","unstructured":"J. Zhu and E. P. Xing . Sparse topical coding . In UAI , pages 831 -- 838 , 2011 . J. Zhu and E. P. Xing. Sparse topical coding. In UAI, pages 831--838, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"WSDM 2013","name":"WSDM 2013: Sixth ACM International Conference on Web Search and Data Mining","location":"Rome Italy"},"container-title":["Proceedings of the sixth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433438","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2433396.2433438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:11Z","timestamp":1750277651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433438"}},"subtitle":["from code to topic"],"short-title":[],"issued":{"date-parts":[[2013,2,4]]},"references-count":41,"alternative-id":["10.1145\/2433396.2433438","10.1145\/2433396"],"URL":"https:\/\/doi.org\/10.1145\/2433396.2433438","relation":{},"subject":[],"published":{"date-parts":[[2013,2,4]]},"assertion":[{"value":"2013-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}