{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:22:02Z","timestamp":1772641322110,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2634-F-002-009"],"award-info":[{"award-number":["MOST 107-2634-F-002-009"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["108-2634-F-002-006"],"award-info":[{"award-number":["108-2634-F-002-006"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/tit.2019.2928301","type":"journal-article","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T20:19:40Z","timestamp":1562962780000},"page":"8095-8118","source":"Crossref","is-referenced-by-count":23,"title":["On the Minimax Misclassification Ratio of Hypergraph Community Detection"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7606-7768","authenticated-orcid":false,"given":"I Eli","family":"Chien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Yi","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0695-5724","authenticated-orcid":false,"given":"I-Hsiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","author":"alon","year":"2004","journal-title":"The Probabilistic Method"},{"key":"ref32","article-title":"Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence","author":"jog","year":"2015","journal-title":"arXiv 1509 06418"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_9"},{"key":"ref30","author":"lichman","year":"2013","journal-title":"UCI Machine Learning Repository"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1274"},{"key":"ref10","first-page":"1980","article-title":"Achieving optimal misclassification proportion in stochastic block models","volume":"18","author":"gao","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"ref13","first-page":"4026","article-title":"Re-revisiting learning on hypergraphs: Confidence interval and subgradient method","author":"zhang","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/43.784130"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143847"},{"key":"ref16","first-page":"1601","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","author":"zhou","year":"2006","journal-title":"Proc NIPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.226"},{"key":"ref18","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":"ref19","article-title":"Motif clustering and overlapping clustering for social network analysis","author":"li","year":"2016","journal-title":"arXiv 1612 00895"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68276-1","author":"marshall","year":"2011","journal-title":"Inequalities Theory of Majorization and Its Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref6","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":"ref29","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 Conf Learn Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1428"},{"key":"ref2","first-page":"871","article-title":"Community detection in hypergraphs: Optimal statistical limit and efficient algorithms","author":"chien","year":"2018","journal-title":"Proc 21st Int Conf Artif Intell Statist"},{"key":"ref9","article-title":"Optimal cluster recovery in the labeled stochastic block model","author":"yun","year":"2015","journal-title":"arXiv 1510 05956"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006915"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"ref22","first-page":"397","article-title":"Consistency of spectral partitioning of uniform hypergraphs under planted partition model","author":"ghoshdastidar","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026150824965"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446987"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1453"},{"key":"ref26","first-page":"371","article-title":"Spectral MLE: Top-k rank aggregation from pairwise comparisons","author":"chen","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852294"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8907537\/08760583.pdf?arnumber=8760583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:41:28Z","timestamp":1657744888000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8760583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":34,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2928301","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}