{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T07:18:40Z","timestamp":1784618320659,"version":"3.55.0"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1452718"],"award-info":[{"award-number":["IIS-1452718"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020,9,1]]},"DOI":"10.1109\/tkde.2019.2911585","type":"journal-article","created":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T19:57:24Z","timestamp":1555444644000},"page":"1722-1735","source":"Crossref","is-referenced-by-count":109,"title":["Evaluating Overfit and Underfit in Models of Network Community Structure"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3515-3504","authenticated-orcid":false,"given":"Amir","family":"Ghasemian","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Colorado, Boulder, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1756-821X","authenticated-orcid":false,"given":"Homa","family":"Hosseinmardi","sequence":"additional","affiliation":[{"name":"Information Sciences Institute, University of Southern California, Marina del Rey, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3529-8746","authenticated-orcid":false,"given":"Aaron","family":"Clauset","sequence":"additional","affiliation":[{"name":"University of Colorado, Boulder, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"issue":"9","key":"ref1","first-page":"1082","article-title":"Communities in networks","volume":"56","author":"Porter","year":"2009","journal-title":"Notices Amer. Math. Soc."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/9781119483298.ch11"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.258701"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2016.7752253"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9046-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1312486110"},{"key":"ref10","first-page":"406","article-title":"Spectral clustering of graphs with the Bethe Hessian","volume-title":"Proc. Neural Inf. Proc. Syst.","author":"Saade"},{"key":"ref11","article-title":"Estimating the number of communities in networks by spectral methods","author":"Le","year":"2015","journal-title":"arXiv:1507.00827"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1457"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2016.1246365"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-03623-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.062805"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.022315"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.1602548"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.148701"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/12\/P12021"},{"key":"ref22","first-page":"657","article-title":"Modeling homophily and stochastic equivalence in symmetric relational data","volume-title":"Proc. Neural Inf. Proc. Syst.","author":"Hoff"},{"key":"ref23","article-title":"Comparison of cross-validation methods for stochastic block models","author":"Dabbs","year":"2016","journal-title":"arXiv:1605.03000"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1409770111"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.97.062316"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1177\/1471082X15577017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.078301"},{"key":"ref30","article-title":"Community detection in networks: Modularity optimization and maximum likelihood are equivalent","author":"Newman","year":"2016","journal-title":"arXiv:1606.02319"},{"key":"ref31","article-title":"A tractable fully Bayesian method for the stochastic block model","author":"Hayashi","year":"2016","journal-title":"arXiv:1602.02256"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2830312"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref34","first-page":"381","article-title":"Learning systems of concepts with an infinite relational model","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Kemp"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00314"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897548"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0703740104"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018209"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.4.011047"},{"issue":"Sep","key":"ref42","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref43","article-title":"The Colorado index of complex networks","author":"Clauset","year":"2016"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asr053"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2786451.2786477"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.95.012317"},{"issue":"27","key":"ref48","first-page":"1","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":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0729-x"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346205"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref52","first-page":"455","article-title":"Iterative and active graph clustering using trace norm minimization without cluster size constraints.","volume":"16","author":"Ailon","year":"2015","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066106"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2007-00088-4"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2013.0048"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953024"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0908366106"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/9159955\/8692626-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9159955\/08692626.pdf?arnumber=8692626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T15:08:02Z","timestamp":1711984082000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8692626\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":60,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2911585","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,1]]}}}