{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:45:04Z","timestamp":1777178704984,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T00:00:00Z","timestamp":1563753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T00:00:00Z","timestamp":1563753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s41109-019-0162-z","type":"journal-article","created":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T13:03:09Z","timestamp":1563800589000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Ensemble clustering for graphs: comparisons and applications"],"prefix":"10.1007","volume":"4","author":[{"given":"Val\u00e9rie","family":"Poulin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5499-3680","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Th\u00e9berge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,22]]},"reference":[{"key":"162_CR1","volume-title":"Network Science","author":"AL Barabasi","year":"2016","unstructured":"Barabasi, AL (2016) Network Science. Cambridge University Press, UK."},{"issue":"10","key":"162_CR2","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"Vincent D Blondel","year":"2008","unstructured":"Blondel, V, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008. \n                    https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008\n                    \n                  .","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"6","key":"162_CR3","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A, Newman M, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111.","journal-title":"Phys Rev E"},{"key":"162_CR4","unstructured":"Csardi, G, Nepusz T (2006) The igraph software package for complex network research. Intl J Compl Sys 1695. \n                    http:\/\/igraph.org\n                    \n                  . Accessed 21 Dec 2018."},{"key":"162_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-36844-8_14","volume":"476","author":"M Danisch","year":"2013","unstructured":"Danisch, M, Guillaume J-L, Le Grand B (2013) Unfolding ego-centered community structures with \u201ca similarity approach\u201d. Complex Networks IV 476:145\u2013153.","journal-title":"Complex Networks IV"},{"key":"162_CR6","volume-title":"Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812","author":"VL Dao","year":"2019","unstructured":"Dao, VL, Bothorel C, Lenca P (2019) Estimating the Similarity of Community Detection Methods Based on Cluster Size Distribution. In: Aiello L, Cherifi C, Cherifi H, Lambiotte R, Li\u00f3 P, Rocha L (eds)Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812.. Springer, Cham."},{"issue":"1","key":"162_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S, Barth\u00e9lemy M (2007) Resolution limit in community detection. Proc Nat Acad Sci 104(1):36\u201341.","journal-title":"Proc Nat Acad Sci"},{"key":"162_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato, S, Hric D (2016) Community detection in networks: A user guide. Phys Rep 659:1\u201344.","journal-title":"Phys Rep"},{"issue":"12","key":"162_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M, Newman M (2002) Community structure in social and biological networks. Proc Nat Acad Sci 99(12):7821\u20137826.","journal-title":"Proc Nat Acad Sci"},{"key":"162_CR10","first-page":"244","volume":"1","author":"TJ Helling","year":"2019","unstructured":"Helling, TJ, Scholtes JC, Takes F (2019) A community-aware approach for identifying node anomalies in complex networks. Compl Netw Appl VII 1:244\u2013255.","journal-title":"Compl Netw Appl VII"},{"issue":"15","key":"162_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.physa.2017.10.018","volume":"492","author":"M Jebabli","year":"2018","unstructured":"Jebabli, M, Cherifi H, Cherifi C, Hamouda A (2018) Community detection algorithm evaluation with ground-truth data. Physica A Stat Mech Appl 492(15):651\u2013706.","journal-title":"Physica A Stat Mech Appl"},{"issue":"1","key":"162_CR12","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118.","journal-title":"Phys Rev E"},{"key":"162_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1038\/srep00336","volume":"2","author":"A Lancichinetti","year":"2012","unstructured":"Lancichinetti, A, Fortunato S (2012) Consensus clustering in complex networks. Nat Sci Rep 2:336.","journal-title":"Nat Sci Rep"},{"key":"162_CR14","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E Stat Nonlinear Soft Matter Phys 78:046110. \n                    https:\/\/doi.org\/10.1103\/PhysRevE.78.046110\n                    \n                  .","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"key":"162_CR15","unstructured":"Leskovec, J, Krevl A (2014) SNAP Datasets: Stanford Large Network Dataset Collection. \n                    http:\/\/snap.stanford.edu\/data\n                    \n                  . Accessed 11 Jan 2019."},{"key":"162_CR16","unstructured":"LFR-Benchmark_UndirWeightOvp (2009). \n                    https:\/\/github.com\/eXascaleInfolab\/LFR-Benchmark_UndirWeightOvp\n                    \n                  . Accessed Dec 21 2018."},{"key":"162_CR17","doi-asserted-by":"publisher","unstructured":"Lu, Z, Wahlstr\u00f6m J, Nehorai A (2018) Community detection in complex networks via clique conductance. Sci Rep 8. \n                    https:\/\/doi.org\/10.1038\/s41598-018-23932-z\n                    \n                  .","DOI":"10.1038\/s41598-018-23932-z"},{"key":"162_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman, M (2003) The structure and function of complex networks. SIAM Rev 45:167\u2013256.","journal-title":"SIAM Rev"},{"issue":"3","key":"162_CR19","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M Newman","year":"2006","unstructured":"Newman, M (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104.","journal-title":"Phys Rev E"},{"key":"162_CR20","unstructured":"Newman, MAmerican College Football. \n                    http:\/\/www-personal.umich.edu\/mejn\/netdata\/\n                    \n                  . Accessed 7 May 2019."},{"issue":"08","key":"162_CR21","doi-asserted-by":"publisher","first-page":"P08001","DOI":"10.1088\/1742-5468\/2012\/08\/P08001","volume":"2012","author":"G\u00fcnce Keziban Orman","year":"2012","unstructured":"Orman, GK, Labatut V, Cherifi H (2012) Comparative evaluation of community detection algorithms: a topological approach. J Stat Mech. \n                    https:\/\/doi.org\/10.1088\/1742-5468\/2012\/08\/P08001\n                    \n                  .","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"162_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1504\/IJWBC.2013.054908","volume":"9","author":"G Orman","year":"2013","unstructured":"Orman, G, Labatut V, Cherifi H (2013) Towards realistic artificial benchmark for community detection algorithms evaluation. Int J Web Based Comm 9:349\u2013370. \n                    https:\/\/doi.org\/10.1504\/IJWBC.2013.054908\n                    \n                  .","journal-title":"Int J Web Based Comm"},{"key":"162_CR23","first-page":"284","volume":"10","author":"P Pons","year":"2005","unstructured":"Pons, P, Latapy M (2005) Computing communities in large networks using random walks. Comp Inf Sci ISCIS 10:284\u2013293. Springer.","journal-title":"Comp Inf Sci ISCIS"},{"key":"162_CR24","unstructured":"Poulin, V, Th\u00e9berge F (2018) Comparing graph clusterings: Set partition measures vs. graph-aware measures. CoRR abs\/1806.11494. \n                    http:\/\/arxiv.org\/abs\/1806.11494\n                    \n                  ."},{"key":"162_CR25","first-page":"231","volume":"1","author":"V Poulin","year":"2019","unstructured":"Poulin, V, Th\u00e9berge F (2019) Ensemble clustering for graphs. Compl Netw Appl VII 1:231\u2013243.","journal-title":"Compl Netw Appl VII"},{"issue":"3","key":"162_CR26","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106.","journal-title":"Phys Rev E"},{"issue":"1","key":"162_CR27","doi-asserted-by":"publisher","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","volume":"74","author":"J Reichardt","year":"2006","unstructured":"Reichardt, J, Bornholdt S (2006) Statistical mechanics of community detection. Phys Rev E 74(1):016110.","journal-title":"Phys Rev E"},{"issue":"4","key":"162_CR28","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2007","unstructured":"Rosvall, M, Bergstrom CT (2007) Maps of random walks on complex networks reveal community structure. PNAS 105(4):1118\u20131123.","journal-title":"PNAS"},{"key":"162_CR29","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-30287-9_10","volume-title":"Complex Networks","author":"Massoud Seifi","year":"2013","unstructured":"Seifi, M, Junier I, Guillaume J-L, Rouquier J-B, Iskrov S (2013) Stable Community Cores in Complex Networks. Stud Compl Netw 424. \n                    https:\/\/doi.org\/10.1007\/978-3-642-30287-9_10\n                    \n                  ."},{"key":"162_CR30","doi-asserted-by":"publisher","unstructured":"Th\u00e9berge, F, Poulin V (2018) Ensemble Clustering for Graphs. \n                    https:\/\/www.codeocean.com\/\n                    \n                  . \n                    https:\/\/doi.org\/10.24433\/CO.0bdd97d9-5f75-4cf4-a797-73151e5aaef4\n                    \n                  .","DOI":"10.24433\/CO.0bdd97d9-5f75-4cf4-a797-73151e5aaef4"},{"key":"162_CR31","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1145\/1553374.1553511","volume-title":"Proc. of the 26th Int. Conf. on Machine Learning","author":"NX Vinh","year":"2009","unstructured":"Vinh, NX, Epps J, Bailey J (2009) Information theoretic measures for clusterings comparison: Is a correction for chance necessary? In: Proc. of the 26th Int. Conf. on Machine Learning, 1073\u201380.. ACM, New York. \n                    https:\/\/doi.org\/10.1145\/1553374.1553511\n                    \n                  ."},{"issue":"4","key":"162_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2501654.2501657","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie, J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput Surv 45(4):43\u201314335. \n                    https:\/\/doi.org\/10.1145\/2501654.2501657\n                    \n                  .","journal-title":"ACM Comput Surv"},{"key":"162_CR33","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang, Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Nat Sci Rep 6:30750.","journal-title":"Nat Sci Rep"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0162-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-019-0162-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0162-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T23:40:58Z","timestamp":1595288458000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-019-0162-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s41109-019-0162-z","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,22]]},"assertion":[{"value":"19 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"51"}}