{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:29:51Z","timestamp":1769045391170,"version":"3.49.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2018,3,20]]},"abstract":"<jats:p>Community detection is a classical problem in the field of graph mining. We are interested in local community detection where the objective is the recover the communities containing some given set of nodes, called the seed set. While existing approaches typically recover only one community around the seed set, most nodes belong to multiple communities in practice. In this paper, we introduce a new algorithm for detecting multiple local communities, possibly overlapping, by expanding the initial seed set. The new nodes are selected by some local clustering of the graph embedded in a vector space of low dimension. We validate our approach on real graphs, and show that it provides more information than existing algorithms to recover the complex graph structure that appears locally.<\/jats:p>","DOI":"10.1145\/3199524.3199537","type":"journal-article","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T15:17:48Z","timestamp":1521731868000},"page":"76-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Multiple Local Community Detection"],"prefix":"10.1145","volume":"45","author":[{"given":"Alexandre","family":"Hollocou","sequence":"first","affiliation":[{"name":"INRIA, Paris, France"}]},{"given":"Thomas","family":"Bonald","sequence":"additional","affiliation":[{"name":"Telecom Paristech, Paris,France"}]},{"given":"Marc","family":"Lelarge","sequence":"additional","affiliation":[{"name":"INRIA-ENS, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135814"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_2_1_4_1","volume-title":"Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment","author":"Blondel V. D.","year":"2008","unstructured":"V. D. Blondel , J.-L. Guillaume , R. Lambiotte , and E. Lefebvre . Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment , 2008 (10):P10008, 2008. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.23"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708838104"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10390643"},{"key":"e_1_2_1_8_1","volume-title":"Finding local community structure in networks. Physical review E, 72(2):026132","author":"Clauset A.","year":"2005","unstructured":"A. Clauset . Finding local community structure in networks. Physical review E, 72(2):026132 , 2005 . A. Clauset. Finding local community structure in networks. Physical review E, 72(2):026132, 2005."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA.2014.7058057"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066106"},{"key":"e_1_2_1_11_1","first-page":"226","volume-title":"Kdd","volume":"96","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , X. Xu , A density-based algorithm for discovering clusters in large spatial databases with noise . In Kdd , volume 96 , pages 226 - 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, X. Xu, et al. A density-based algorithm for discovering clusters in large spatial databases with noise. In Kdd, volume 96, pages 226-231, 1996."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.91.012821"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623706"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623621"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741676"},{"key":"e_1_2_1_21_1","volume-title":"A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. Journal of Machine Learning Research, 13(Aug):2339-2365","author":"Mahoney M. W.","year":"2012","unstructured":"M. W. Mahoney , L. Orecchia , and N. K. Vishnoi . A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. Journal of Machine Learning Research, 13(Aug):2339-2365 , 2012 . M. W. Mahoney, L. Orecchia, and N. K. Vishnoi. A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. Journal of Machine Learning Research, 13(Aug):2339-2365, 2012."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514888.1514890"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634168"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11569596_31"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.36"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_2_1_31_1","first-page":"1598","volume-title":"IJCAI","author":"West R.","year":"2009","unstructured":"R. West , J. Pineau , and D. Precup . Wikispeedia: An online game for inferring semantic distances between concepts . In IJCAI , pages 1598 - 1603 , 2009 . R. West, J. Pineau, and D. Precup. Wikispeedia: An online game for inferring semantic distances between concepts. In IJCAI, pages 1598-1603, 2009."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_2_1_34_1","volume-title":"Local higher-order graph clustering","author":"Yin H.","year":"2017","unstructured":"H. Yin , A. R. Benson , J. Leskovec , and D. F. Gleich . Local higher-order graph clustering . 2017 . H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich. Local higher-order graph clustering. 2017."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199524.3199537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3199524.3199537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:17Z","timestamp":1750273637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199524.3199537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3,20]]}},"alternative-id":["10.1145\/3199524.3199537"],"URL":"https:\/\/doi.org\/10.1145\/3199524.3199537","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"2018-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}