{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T17:49:47Z","timestamp":1776880187610,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:00:00Z","timestamp":1589932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:00:00Z","timestamp":1589932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s13278-020-00647-6","type":"journal-article","created":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T13:02:46Z","timestamp":1589979766000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Core expansion: a new community detection algorithm based on neighborhood overlap"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7578-3466","authenticated-orcid":false,"given":"Ali","family":"Choumane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Awada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Harkous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,20]]},"reference":[{"issue":"1","key":"647_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13278-017-0436-3","volume":"7","author":"K Asmi","year":"2017","unstructured":"Asmi K, Lotfi D, El Marraki M (2017) Large-scale community detection based on a new dissimilarity measure. Soc Netw Anal Min 7(1):17","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"647_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s13278-019-0566-x","volume":"9","author":"M Azaouzi","year":"2019","unstructured":"Azaouzi M, Rhouma D, Romdhane LB (2019) Community detection in large-scale social networks: state-of-the-art and future directions. Soc Netw Anal Min 9(1):23","journal-title":"Soc Netw Anal Min"},{"issue":"10","key":"647_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"647_CR4","unstructured":"Brandes U, Delling D, Gaertler M, G\u00f6rke R, Hoefer M, Nikoloski Z, Wagner D (2006) Maximizing modularity is hard. arXiv:physics\/0608255"},{"issue":"6","key":"647_CR5","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"issue":"1","key":"647_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s13278-016-0325-1","volume":"6","author":"M Cordeiro","year":"2016","unstructured":"Cordeiro M, Sarmento RP, Gama J (2016) Dynamic community detection in evolving networks using locality modularity optimization. Soc Netw Anal Min 6(1):15","journal-title":"Soc Netw Anal Min"},{"key":"647_CR7","unstructured":"De Meo P, Ferrara E, Fiumara G, Provetti A (2012) On Facebook, most ties are weak. arXiv:1203.0535a"},{"issue":"16","key":"647_CR8","doi-asserted-by":"publisher","first-page":"160202","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I Der\u00e9nyi","year":"2005","unstructured":"Der\u00e9nyi I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94(16):160202","journal-title":"Phys Rev Lett"},{"issue":"3\u20135","key":"647_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"issue":"1","key":"647_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36\u201341","journal-title":"Proc Natl Acad Sci"},{"issue":"12","key":"647_CR11","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"647_CR12","first-page":"3","volume":"1","author":"J Kleinberg","year":"2010","unstructured":"Kleinberg J, Easley D (2010) Networks, crowds, and markets: reasoning about a highly connected world. Significance 1(2):3","journal-title":"Significance"},{"key":"647_CR13","first-page":"74","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing. AcM Press, New York, pp 74\u201387"},{"issue":"6","key":"647_CR14","doi-asserted-by":"publisher","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","volume":"84","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti A, Fortunato S (2011) Limits of modularity maximization in community detection. Phys Rev E 84(6):066122","journal-title":"Phys Rev E"},{"key":"647_CR15","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539\u2013547"},{"issue":"4","key":"647_CR16","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"issue":"4","key":"647_CR17","doi-asserted-by":"publisher","first-page":"042307","DOI":"10.1103\/PhysRevE.96.042307","volume":"96","author":"BF Maier","year":"2017","unstructured":"Maier BF, Brockmann D (2017) Cover time for random walks on arbitrary complex networks. Phys Rev E 96(4):042307","journal-title":"Phys Rev E"},{"key":"647_CR18","unstructured":"Mattie H, Onnela JP (2017) Generalizations of edge overlap to weighted and directed networks. arXiv:1712.07110"},{"key":"647_CR19","unstructured":"McDaid AF, Greene D, Hurley N (2011) Normalized mutual information to evaluate overlapping community finding algorithms. arXiv:1110.2515"},{"issue":"1","key":"647_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.3390\/a9010008","volume":"9","author":"N Meghanathan","year":"2016","unstructured":"Meghanathan N (2016) A greedy algorithm for neighborhood overlap-based community detection. Algorithms 9(1):8","journal-title":"Algorithms"},{"issue":"6","key":"647_CR21","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066133","journal-title":"Phys Rev E"},{"issue":"23","key":"647_CR22","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"key":"647_CR23","doi-asserted-by":"crossref","unstructured":"Pizzuti C (2009) Overlapped community detection in complex networks. In: Proceedings of the 11th annual conference on genetic and evolutionary computation. ACM, pp 859\u2013866","DOI":"10.1145\/1569901.1570019"},{"issue":"4","key":"647_CR24","doi-asserted-by":"publisher","first-page":"042804","DOI":"10.1103\/PhysRevE.92.042804","volume":"92","author":"C Sch\u00fclke","year":"2015","unstructured":"Sch\u00fclke C, Ricci-Tersenghi F (2015) Multiple phases in modularity-based community detection. Phys Rev E 92(4):042804","journal-title":"Phys Rev E"},{"issue":"1","key":"647_CR25","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"647_CR26","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00647-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-020-00647-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00647-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T08:35:01Z","timestamp":1621499701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-020-00647-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,20]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s13278-020-00647-6","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,20]]},"assertion":[{"value":"28 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"30"}}