{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T07:44:47Z","timestamp":1769931887296,"version":"3.49.0"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2017R1E1A1A01076340"],"award-info":[{"award-number":["2017R1E1A1A01076340"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea, under the ITRC support program","doi-asserted-by":"publisher","award":["IITP-2020-2018-0-01402"],"award-info":[{"award-number":["IITP-2020-2018-0-01402"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information and Communications Technology Planning & Evaluation (IITP) grant"},{"name":"Korea Government MSIT","award":["2020-0-00626"],"award-info":[{"award-number":["2020-0-00626"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/jsait.2020.3037170","type":"journal-article","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T21:25:27Z","timestamp":1605129927000},"page":"613-631","source":"Crossref","is-referenced-by-count":13,"title":["Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE"],"prefix":"10.1109","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3223-2573","authenticated-orcid":false,"given":"Jeonghwan","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4402-064X","authenticated-orcid":false,"given":"Daesung","family":"Kim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8947-9956","authenticated-orcid":false,"given":"Hye Won","family":"Chung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"400","article-title":"A provable generalized tensor spectral method for uniform hypergraph partitioning","author":"ghoshdastidar","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref38","first-page":"397","article-title":"Consistency of spectral partitioning of uniform hypergraphs under planted partition model","author":"ghoshdastidar","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20089"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1773"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839677"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066106"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.066118"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73063"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0109"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3046674"},{"key":"ref60","article-title":"Average-case complexity of detecting cliques","author":"rossman","year":"2010"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref61","author":"tiwari","year":"2020","journal-title":"Bandit-pam Almost linear time k-medoids clustering via multi-armed bandits"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2015.06.077"},{"key":"ref64","first-page":"2996","article-title":"Graph clustering with missing data: Convex algorithms and analysis","author":"vinayak","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOP1180"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90407-2"},{"key":"ref66","author":"xu","year":"2017","journal-title":"Optimal rates for community estimation in the weighted stochastic block model"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref67","first-page":"1601","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","author":"zhou","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref1","first-page":"6446","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"abbe","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref20","first-page":"882","article-title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices","volume":"17","author":"chen","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2928301"},{"key":"ref21","first-page":"871","article-title":"Community detection in hypergraphs: Optimal statistical limit and efficient algorithms","author":"chien","year":"2018","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_34"},{"key":"ref23","first-page":"391","article-title":"Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery","author":"chin","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1016\/j.laa.2020.01.039","article-title":"Exact recovery in the hypergraph stochastic block model: A spectral algorithm","author":"cole","year":"2020","journal-title":"Linear Algebra and its Applications"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2017.8024470"},{"key":"ref51","author":"kim","year":"2018","journal-title":"Stochastic block model for hypergraphs Statistical limits and a semidefinite programming approach"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref58","author":"pal","year":"2019","journal-title":"Community detection in the sparse hypergraph stochastic block model"},{"key":"ref57","author":"oymak","year":"2011","journal-title":"Finding dense clusters via &#x2018;low rank + sparse&#x2019; decomposition"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746603"},{"key":"ref55","author":"li","year":"2018","journal-title":"Convex relaxation methods for community detection"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1274"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972962.4"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref10","first-page":"3655","article-title":"Ultra fast medoid identification via correlated sequential halving","volume":"32","author":"baharav","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref11","author":"bhatia","year":"1987","journal-title":"Perturbation Bounds for Matrix Eigenvalues"},{"key":"ref40","first-page":"2610","article-title":"Spectral clustering using multilinear SVD: Analysis, approximations and applications","author":"ghoshdastidar","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1290"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"ref15","first-page":"1","article-title":"Spectral clustering of graphs with general degrees in the extended planted partition model","author":"chaudhuri","year":"2012","journal-title":"Proc Conf Learn Theory"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1595"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346205"},{"key":"ref19","first-page":"244","article-title":"Statistical-computational phase transitions in planted models: The high-dimensional setting","author":"chen","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0805002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2837638"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250863"},{"key":"ref49","author":"ke","year":"2019","journal-title":"Community detection for hypergraph networks via regularized tensor power iteration"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0729-x"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2546280"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1155\/2000\/19436"},{"key":"ref47","author":"jog","year":"2015","journal-title":"Information-theoretic bounds for exact recovery in weighted stochastic block models using the renyi divergence"},{"key":"ref42","first-page":"1638","article-title":"Uniform hypergraph partitioning: Provable tensor methods and sampling techniques","volume":"18","author":"ghoshdastidar","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1453"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.50"},{"key":"ref43","first-page":"311","article-title":"Clustering categorical data: An approach based on dynamical systems","author":"gibson","year":"1998","journal-title":"Proc 24th VLDB Conf"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9319601\/09257068.pdf?arnumber=9257068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:16:34Z","timestamp":1651065394000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9257068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":67,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2020.3037170","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}