{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:28:32Z","timestamp":1759937312550,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/infocom.2017.8056956","type":"proceedings-article","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T20:28:21Z","timestamp":1507235301000},"page":"1-9","source":"Crossref","is-referenced-by-count":41,"title":["Motif clustering and overlapping clustering for social network analysis"],"prefix":"10.1109","author":[{"given":"Pan","family":"Li","sequence":"first","affiliation":[]},{"given":"Hoang","family":"Dau","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Puleo","sequence":"additional","affiliation":[]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238225"},{"key":"ref11","first-page":"1601","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","author":"zhou","year":"2006","journal-title":"Advances in neural information processing systems"},{"key":"ref12","first-page":"676","article-title":"Efficient hypergraph clustering","author":"leordeanu","year":"2012","journal-title":"AISTATS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"},{"key":"ref14","first-page":"1530","article-title":"Higher-order correlation clustering for image segmentation","author":"kim","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446987"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.114"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-014-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741128"},{"journal-title":"Scalable motif-aware graph clustering","year":"2016","author":"tsourakakis","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref27","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"tur\u00e1n","year":"1941","journal-title":"Mat Fiz Lapok (in Hungarian)"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00357-001-0014-1","article-title":"Np-hard approximation problems in overlapping clustering","volume":"18","author":"barth\u00e9lemy","year":"2001","journal-title":"Journal of Classification"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"ref5","article-title":"X-means: Extending k-means with efficient estimation of the number of clusters","volume":"1","author":"pelleg","year":"2000","journal-title":"ICML"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181947"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"journal-title":"Algorithms for clustering data","year":"1988","author":"jain","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"journal-title":"Near optimal lp rounding algorithm for correlation clustering on complete and complete k-partite graphs","year":"2014","author":"chawla","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00182-I"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-014-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579381"},{"key":"ref23","first-page":"2895","article-title":"An approximate, efficient lp solver for lp rounding","author":"sridhar","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359346"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90055-5"}],"event":{"name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","start":{"date-parts":[[2017,5,1]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2017,5,4]]}},"container-title":["IEEE INFOCOM 2017 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8049192\/8056940\/08056956.pdf?arnumber=8056956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,18]],"date-time":"2020-10-18T20:41:32Z","timestamp":1603053692000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8056956\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infocom.2017.8056956","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}