{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:28:57Z","timestamp":1775093337777,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF IIS-2007836"],"award-info":[{"award-number":["NSF IIS-2007836"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF IIS-1910118"],"award-info":[{"award-number":["NSF IIS-1910118"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["ARO W911NF-19-1-0407"],"award-info":[{"award-number":["ARO W911NF-19-1-0407"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3109380","type":"journal-article","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T19:56:22Z","timestamp":1630698982000},"page":"5189-5205","source":"Crossref","is-referenced-by-count":5,"title":["Mixed Membership Graph Clustering via Systematic Edge Query"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1951-5234","authenticated-orcid":false,"given":"Shahana","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4847-9586","authenticated-orcid":false,"given":"Xiao","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1141","article-title":"When does non-negative matrix factorization give a correct decomposition into parts","author":"donoho","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2285514"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2537145"},{"key":"ref32","first-page":"1391","article-title":"The algebraic combinatorial approach for low-rank matrix completion","volume":"16","author":"theran","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref31","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":"ref30","article-title":"Finding dense clusters via “low rank + sparse” decomposition","author":"oymak","year":"2011"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2789405"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2025802"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.226"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2877582"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.226"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45735-6_1"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.066114"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"ref29","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"14","author":"ng","year":"2002","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref2","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"airoldi","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2020.1751645"},{"key":"ref22","first-page":"2859","article-title":"Detecting overlapping and correlated communities without pure nodes: Identifiability and algorithm","volume":"97","author":"huang","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","first-page":"53","article-title":"Consistent estimation of mixed memberships with successive projections","author":"panov","year":"2017","journal-title":"Proc Int Conf Complex Netw Their Appl"},{"key":"ref24","first-page":"5370","article-title":"Learning mixed membership from adjacency graph via systematic edge query: Identifiability and algorithm","author":"ibrahim","year":"2021","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref23","first-page":"1772","article-title":"Semi-crowdsourced clustering: Generalizing crowd labeling by robust distance metric learning","volume":"25","author":"yi","year":"2012","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref26","first-page":"1","article-title":"Crowdclustering with sparse pairwise labels: A matrix completion approach","author":"yi","year":"2012","journal-title":"Proc Workshop 26th AAAI Conf Artif Intell Hum Comput"},{"key":"ref25","first-page":"558","article-title":"Crowdclustering","volume":"24","author":"gomes","year":"2011","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329196"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2210872"},{"key":"ref59","first-page":"3466","article-title":"Novel dataset for fine-grained image categorization","author":"khosla","year":"0","journal-title":"Prof 1st Workshop Fine-Grained Visual Categorization IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2982321"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2404577"},{"key":"ref56","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1214\/14-AOS1274","article-title":"Consistency of spectral clustering in stochastic block models","volume":"43","author":"lei","year":"2015","journal-title":"Annals Statist"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1177\/0038038588022001007"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10461-008-9421-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/ee\/nvv001"},{"key":"ref40","first-page":"7847","article-title":"Crowdsourcing via pairwise co-occurrences: Identifiability and algorithms","volume":"32","author":"ibrahim","year":"2019","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref12","first-page":"2996","article-title":"Graph clustering with missing data: Convex algorithms and analysis","volume":"27","author":"vinayak","year":"2014","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref13","first-page":"1316","article-title":"Crowdsourced clustering: Querying edges vs triangles","volume":"29","author":"vinayak","year":"2016","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"2213","article-title":"Clustering partially observed graphs via convex optimization","volume":"15","author":"chen","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"5790","article-title":"Clustering with noisy queries","author":"mazumdar","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref16","article-title":"Clustering via crowdsourcing","author":"mazumdar","year":"2016"},{"key":"ref17","article-title":"Graph clustering: Algorithms, analysis and query design","author":"vinayak","year":"2018"},{"key":"ref18","author":"s\u00e4rndal","year":"2003","journal-title":"Model Assisted Survey Sampling ser Springer series in statistics"},{"key":"ref19","first-page":"2324","article-title":"On mixed memberships and symmetric nonnegative matrix factorizations","author":"mao","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/040608635"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/19M1263340"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541405"},{"key":"ref8","article-title":"A survey and taxonomy of graph sampling","author":"hu","year":"2013","journal-title":"Comput Res Repository"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/j.0081-1750.2004.00152.x"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602800"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2410763"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0601-9"},{"key":"ref47","article-title":"Introduction to the Dirichlet distribution and related processes","author":"frigyik","year":"2010"},{"key":"ref42","first-page":"1011","article-title":"Ellipsoidal rounding for nonnegative matrix factorization under noisy separability","volume":"15","author":"mizutani","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref41","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization","volume":"28","author":"kumar","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/130946782"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2498523"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9307529\/9529053-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09529053.pdf?arnumber=9529053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:42Z","timestamp":1652194242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9529053\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3109380","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}