{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:05:35Z","timestamp":1768010735492,"version":"3.49.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000181","name":"U.S. Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-10-1-0458"],"award-info":[{"award-number":["FA9550-10-1-0458"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"U.S. Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["A1795"],"award-info":[{"award-number":["A1795"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008287","name":"Science and Technology Directorate, Office of University Programs","doi-asserted-by":"publisher","award":["2013-ST-061- ED0001"],"award-info":[{"award-number":["2013-ST-061- ED0001"]}],"id":[{"id":"10.13039\/100008287","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["1218992"],"award-info":[{"award-number":["1218992"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["1320547"],"award-info":[{"award-number":["1320547"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["1527618"],"award-info":[{"award-number":["1527618"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["50202168"],"award-info":[{"award-number":["50202168"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/jstsp.2016.2555240","type":"journal-article","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T18:24:23Z","timestamp":1461176663000},"page":"712-725","source":"Crossref","is-referenced-by-count":2,"title":["A Provably Efficient Algorithm for Separable Topic Discovery"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7030-2376","authenticated-orcid":false,"given":"Weicong","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Ishwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Saligrama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","first-page":"81","article-title":"Asynchronous distributed learning of topic models","author":"asuncion","year":"0","journal-title":"Proc Adv Neural Inf Proces Syst"},{"key":"ref33","first-page":"214","article-title":"A topic modeling approach to ranking","author":"ding","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref32","first-page":"504","article-title":"A data-driven approach to modeling choice","author":"farias","year":"0","journal-title":"Proc Adv Neural Inf Proces Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.226"},{"key":"ref30","first-page":"1141","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","author":"donoho","year":"0","journal-title":"Proc Adv Neural Inf Proces Syst"},{"key":"ref37","first-page":"1801","article-title":"Distributed algorithms for topic models","volume":"10","author":"newman","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557121"},{"key":"ref35","first-page":"361","article-title":"RCV1: A new benchmark collection for text categorization research","volume":"5","author":"lewis","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref34","author":"mccallum","year":"0","journal-title":"Mallet A machine learning for language toolkit"},{"key":"ref10","first-page":"1008","article-title":"Complexity of inference in latent Dirichlet allocation","author":"sontag","year":"0","journal-title":"Proc Adv Neural Inf Proces Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Found Trends Mach Learn"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1201\/b17520","author":"airoldi","year":"2014","journal-title":"Handbook of Mixed Membership Models and Their Applications"},{"key":"ref14","first-page":"2239","article-title":"A tensor approach to learning mixed membership community models","volume":"15","author":"anandkumar","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization","author":"kumar","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308989"},{"key":"ref17","article-title":"Necessary and sufficient conditions and a provably efficient algorithm for separable topic discovery","author":"ding","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS114"},{"key":"ref28","first-page":"1997","article-title":"A provable SVD-based algorithm for learning topics in dominant admixture corpus","author":"bansal","year":"0","journal-title":"in Proc Adv Neural Inf Process Syst"},{"key":"ref4","article-title":"Necessary and sufficient conditions for novel word detection in separable topic models","author":"ding","year":"0","journal-title":"Proc Adv Neural Inf Process Syst (NIPS&#x2019;13) Workshop Topic Models Comput Appl Eval"},{"key":"ref27","article-title":"On some provably correct cases of variational inference for topic models","author":"awasthi","year":"0"},{"key":"ref3","first-page":"1202","article-title":"Topic discovery through data dependent and random projections","author":"ding","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref6","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref29","first-page":"11","article-title":"Automating spectral unmixing of AVIRIS data using convex geometry concepts","author":"boardman","year":"0","journal-title":"Proc Ann JPL Airborne Geosci Workshop"},{"key":"ref5","first-page":"167","article-title":"Efficient distributed topic modeling with provable guarantees","author":"ding","year":"0","journal-title":"Proc 17th Int Conf Artif Intell Statist"},{"key":"ref8","author":"lichman","year":"0","journal-title":"UCI Machine Learning Repository"},{"key":"ref7","first-page":"280","article-title":"A practical algorithm for topic modeling with provable guarantees","author":"arora","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638729"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.49"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553515"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref21","first-page":"856","article-title":"Online learning for latent Dirichlet allocation","author":"hoffman","year":"0","journal-title":"Proc Adv Neural Inf Proces Syst"},{"key":"ref24","first-page":"1223","article-title":"Factoring nonnegative matrices with linear programs","author":"recht","year":"0","journal-title":"Proc Adv Neural Inf Proces Syst"},{"key":"ref23","author":"cichocki","year":"2009","journal-title":"Nonnegative Matrix and Tensor Factorizations Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation"},{"key":"ref26","first-page":"249","article-title":"Learning linear Bayesian networks with latent variables","author":"anandkumar","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7469412\/07454690.pdf?arnumber=7454690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:45Z","timestamp":1642003365000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7454690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":38,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2016.2555240","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}