{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:41:37Z","timestamp":1771951297239,"version":"3.50.1"},"reference-count":103,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10115-022-01704-6","type":"journal-article","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T06:03:05Z","timestamp":1656309785000},"page":"2023-2058","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A review of clique-based overlapping community detection algorithms"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8550-2194","authenticated-orcid":false,"given":"Sumit Kumar","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Dhirendra Pratap","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Jaytrilok","family":"Choudhary","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"issue":"7307","key":"1704_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn YY, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761\u2013764","journal-title":"Nature"},{"key":"1704_CR2","unstructured":"Ahuja M, Singh J, Neha (2015) Overlapping community detection algorithms:-a review. Int Res J Eng Technol (IRJET) 02(9)"},{"issue":"1","key":"1704_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader GD, Hogue CW (2003) An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinf 4(1):1\u201327","journal-title":"BMC Bioinf"},{"key":"1704_CR4","unstructured":"Baluja S (1994) Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning. Tech. rep., Carnegie-Mellon Univ Pittsburgh Pa Dept Of Computer Science"},{"key":"1704_CR5","unstructured":"Baluja S, Davies S (1998) Fast probabilistic modeling for combinatorial optimization. In: AAAI\/IAAI Madison, WI, USA, pp 469\u2013476"},{"issue":"11","key":"1704_CR6","doi-asserted-by":"publisher","first-page":"2974","DOI":"10.1109\/TKDE.2015.2445775","volume":"27","author":"S Bandyopadhyay","year":"2015","unstructured":"Bandyopadhyay S, Chowdhary G, Sengupta D (2015) Focs: fast overlapped community search. IEEE Trans Knowl Data Eng 27(11):2974\u20132985","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1704_CR7","unstructured":"Battiti R, Protasi M (1997) Reactive local search for maximum clique. In: WAE, Citeseer, pp 74\u201383"},{"key":"1704_CR8","doi-asserted-by":"crossref","unstructured":"Bosman PA, Thierens D (2000) Expanding from discrete to continuous estimation of distribution algorithms: The idea. In: International Conference on Parallel Problem Solving from Nature, Springer, pp 767\u2013776","DOI":"10.1007\/3-540-45356-3_75"},{"issue":"9","key":"1704_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"1","key":"1704_CR10","doi-asserted-by":"publisher","first-page":"e0188702","DOI":"10.1371\/journal.pone.0188702","volume":"13","author":"BP Chamberlain","year":"2018","unstructured":"Chamberlain BP, Levy-Kramer J, Humby C et al (2018) Real-time community detection in full social networks on a laptop. PloS one 13(1):e0188702","journal-title":"PloS one"},{"issue":"9","key":"1704_CR11","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/TSMC.2017.2779138","volume":"49","author":"J Cheng","year":"2018","unstructured":"Cheng J, Wu X, Zhou M et al (2018) A novel method for detecting new overlapping community in complex evolving networks. IEEE Trans Syst Man Cybern Syst 49(9):1832\u20131844","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"6","key":"1704_CR12","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":"2","key":"1704_CR13","first-page":"153","volume":"8","author":"D Cristofor","year":"2002","unstructured":"Cristofor D, Simovici DA (2002) Finding median partitions using information-theoretical-based genetic algorithms. J Univ Comput Sci 8(2):153\u2013172","journal-title":"J Univ Comput Sci"},{"key":"1704_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S et al (2018) Ddse: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119\u2013130","journal-title":"J Netw Comput Appl"},{"key":"1704_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.physa.2014.03.027","volume":"405","author":"Y Cui","year":"2014","unstructured":"Cui Y, Wang X, Li J (2014) Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient. Phys A 405:85\u201391","journal-title":"Phys A"},{"issue":"4","key":"1704_CR16","doi-asserted-by":"publisher","first-page":"042317","DOI":"10.1103\/PhysRevE.95.042317","volume":"95","author":"C De Bacco","year":"2017","unstructured":"De Bacco C, Power EA, Larremore DB et al (2017) Community detection, link prediction, and layer interdependence in multilayer networks. Phys Rev E 95(4):042317","journal-title":"Phys Rev E"},{"key":"1704_CR17","first-page":"424","volume":"9","author":"JS De Bonet","year":"1997","unstructured":"De Bonet JS, Isbell CL, Viola P et al (1997) Mimic: finding optima by estimating probability densities. Adv Neural Inf Process Syst 9:424\u2013430","journal-title":"Adv Neural Inf Process Syst"},{"issue":"16","key":"1704_CR18","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"},{"key":"1704_CR19","doi-asserted-by":"crossref","unstructured":"Despalatovi\u0107 L, Vojkovi\u0107 T, Vukicevic D (2014) Community structure in networks: Girvan-newman algorithm improvement. In 2014 37th international convention on information and communication technology. Electronics and microelectronics (MIPRO) pp 997\u20131002","DOI":"10.1109\/MIPRO.2014.6859714"},{"key":"1704_CR20","doi-asserted-by":"crossref","unstructured":"Dougnon RY, Fournier-Viger P, Lin JCW, et\u00a0al (2015) More accurate inference of user profiles in online social networks. In: Mexican international conference on artificial intelligence, Springer, pp 533\u2013546","DOI":"10.1007\/978-3-319-27101-9_41"},{"issue":"2","key":"1704_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10844-016-0402-y","volume":"47","author":"RY Dougnon","year":"2016","unstructured":"Dougnon RY, Fournier-Viger P, Lin JCW et al (2016) Inferring social network user profiles using a partial social graph. J Intell Inf Syst 47(2):313\u2013344","journal-title":"J Intell Inf Syst"},{"issue":"1","key":"1704_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-6-39","volume":"6","author":"R Dunn","year":"2005","unstructured":"Dunn R, Dudbridge F, Sanderson CM (2005) The use of edge-betweenness clustering to investigate biological function in protein interaction networks. BMC Bioinf 6(1):1\u201314","journal-title":"BMC Bioinf"},{"issue":"1","key":"1704_CR23","doi-asserted-by":"publisher","first-page":"016105","DOI":"10.1103\/PhysRevE.80.016105","volume":"80","author":"TS Evans","year":"2009","unstructured":"Evans TS, Lambiotte R (2009) Line graphs, link partitions, and overlapping communities. Phys Rev E 80(1):016105","journal-title":"Phys Rev E"},{"issue":"1","key":"1704_CR24","first-page":"49","volume":"21","author":"MG Everett","year":"1998","unstructured":"Everett MG, Borgatti SP (1998) Analyzing clique overlap. Connections 21(1):49\u201361","journal-title":"Connections"},{"key":"1704_CR25","doi-asserted-by":"crossref","unstructured":"Fagnan J, Za\u00efane O, Barbosa D (2014) Using triads to identify local community structure in social networks. In: 2014 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM 2014), IEEE, pp 108\u2013112","DOI":"10.1109\/ASONAM.2014.6921568"},{"key":"1704_CR26","doi-asserted-by":"crossref","unstructured":"Filkov V, Skiena S (2004) Heterogeneous data integration with the consensus clustering formalism. In: international workshop on data integration in the life sciences, Springer, pp 110\u2013123","DOI":"10.1007\/978-3-540-24745-6_8"},{"issue":"6","key":"1704_CR27","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","volume":"27","author":"AL Fred","year":"2005","unstructured":"Fred AL, Jain AK (2005) Combining multiple clusterings using evidence accumulation. IEEE Trans Pattern Anal Mach Intell 27(6):835\u2013850","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"1704_CR28","doi-asserted-by":"publisher","first-page":"3975","DOI":"10.1007\/s10489-020-01962-3","volume":"51","author":"F Gasparetti","year":"2021","unstructured":"Gasparetti F, Sansonetti G, Micarelli A (2021) Community detection in social recommender systems: a survey. Appl Intell 51(6):3975\u20133995","journal-title":"Appl Intell"},{"key":"1704_CR29","doi-asserted-by":"crossref","unstructured":"Ghosh S, Halappanavar M, Tumeo A, et\u00a0al (2018) Distributed louvain algorithm for graph community detection. In: 2018 IEEE international parallel and distributed processing symposium (IPDPS), IEEE, pp 885\u2013895","DOI":"10.1109\/IPDPS.2018.00098"},{"issue":"1","key":"1704_CR30","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156\u2013166","journal-title":"Decis Sci"},{"key":"1704_CR31","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B et al (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367:600\u2013614","journal-title":"Inf Sci"},{"key":"1704_CR32","doi-asserted-by":"crossref","unstructured":"Greene D (2010) D. l. doyle, and p. cunningham, tracking the evolution of communities in dynamic social networks, advances in social networks analysis and mining (asonam). In: 2010 international conference on, IEEE, pp 176\u2013183","DOI":"10.1109\/ASONAM.2010.17"},{"issue":"10","key":"1704_CR33","doi-asserted-by":"publisher","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018","journal-title":"New J Phys"},{"key":"1704_CR34","doi-asserted-by":"crossref","unstructured":"Guo Z, Yu K, Li Y, et\u00a0al (2021) Deep learning-embedded social internet of things for ambiguity-aware social recommendations. IEEE Trans Netw Sci Eng","DOI":"10.1109\/TNSE.2021.3049262"},{"issue":"35","key":"1704_CR35","doi-asserted-by":"publisher","first-page":"2050408","DOI":"10.1142\/S0217984920504084","volume":"34","author":"S Gupta","year":"2020","unstructured":"Gupta S, Singh DP (2020) Recent trends on community detection algorithms: a survey. Modern Phys Lett B 34(35):2050408","journal-title":"Modern Phys Lett B"},{"key":"1704_CR36","doi-asserted-by":"crossref","unstructured":"Hoffmann T, Peel L, Lambiotte R, et\u00a0al (2020) Community detection in networks with unobserved edges. Sci Adv 6(4)","DOI":"10.1126\/sciadv.aav1478"},{"issue":"5","key":"1704_CR37","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.patcog.2008.09.027","volume":"42","author":"P Hore","year":"2009","unstructured":"Hore P, Hall LO, Goldgof DB (2009) A scalable framework for cluster ensembles. Pattern Recogn 42(5):676\u2013688","journal-title":"Pattern Recogn"},{"key":"1704_CR38","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"17","key":"1704_CR39","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1093\/bioinformatics\/bth351","volume":"20","author":"AD King","year":"2004","unstructured":"King AD, Pr\u017eulj N, Jurisica I (2004) Protein complex prediction via cost-based clustering. Bioinformatics 20(17):3013\u20133020","journal-title":"Bioinformatics"},{"key":"1704_CR40","unstructured":"Konc J, Janezic D (2007) An improved branch and bound algorithm for the maximum clique problem. Proteins 4(5)"},{"issue":"2","key":"1704_CR41","doi-asserted-by":"publisher","first-page":"026109","DOI":"10.1103\/PhysRevE.78.026109","volume":"78","author":"JM Kumpula","year":"2008","unstructured":"Kumpula JM, Kivel\u00e4 M, Kaski K et al (2008) Sequential algorithm for fast clique percolation. Phys Rev E 78(2):026109","journal-title":"Phys Rev E"},{"key":"1704_CR42","doi-asserted-by":"crossref","unstructured":"Kundu S, Murthy C, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: international conference on pattern recognition and machine intelligence, Springer, pp 242\u2013247","DOI":"10.1007\/978-3-642-21786-9_40"},{"issue":"4","key":"1704_CR43","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 78(4):046110","journal-title":"Phys Rev E"},{"issue":"3","key":"1704_CR44","doi-asserted-by":"publisher","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S, Kert\u00e9sz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015","journal-title":"New J Phys"},{"issue":"4","key":"1704_CR45","doi-asserted-by":"publisher","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","volume":"6","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti A, Radicchi F, Ramasco JJ et al (2011) Finding statistically significant communities in networks. PloS one 6(4):e18961","journal-title":"PloS one"},{"key":"1704_CR46","volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation","author":"P Larra\u00f1aga","year":"2001","unstructured":"Larra\u00f1aga P, Lozano JA (2001) Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2. Springer, Cham"},{"key":"1704_CR47","unstructured":"Lee C, Reid F, McDaid A, et\u00a0al (2010) Detecting highly overlapping community structure by greedy clique expansion. arXiv preprint arXiv:1002.1827"},{"key":"1704_CR48","doi-asserted-by":"crossref","unstructured":"Lee G, Peng SL, Kuo SW, et\u00a0al (2012) Mining frequent maximal cliques efficiently by global view graph. In: 2012 9th international conference on fuzzy systems and knowledge discovery, IEEE, pp 1362\u20131366","DOI":"10.1109\/FSKD.2012.6233927"},{"key":"1704_CR49","doi-asserted-by":"publisher","first-page":"141083","DOI":"10.1109\/ACCESS.2019.2943412","volume":"7","author":"H Li","year":"2019","unstructured":"Li H, Zhang R, Zhao Z et al (2019) An efficient influence maximization algorithm based on clique in social networks. IEEE Access 7:141083\u2013141093","journal-title":"IEEE Access"},{"key":"1704_CR50","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.physa.2014.08.025","volume":"415","author":"J Li","year":"2014","unstructured":"Li J, Wang X, Cui Y (2014) Uncovering the overlapping community structure of complex networks by maximal cliques. Phys A 415:398\u2013406","journal-title":"Phys A"},{"key":"1704_CR51","doi-asserted-by":"crossref","unstructured":"Lu L, Gu Y, Grossman R (2010) dmaximalcliques: a distributed algorithm for enumerating all maximal cliques and maximal clique distribution. In: 2010 IEEE international conference on data mining workshops, IEEE, pp 1320\u20131327","DOI":"10.1109\/ICDMW.2010.13"},{"issue":"1","key":"1704_CR52","first-page":"1","volume":"8","author":"Z Lu","year":"2018","unstructured":"Lu Z, Wahlstr\u00f6m J, Nehorai A (2018) Community detection in complex networks via clique conductance. Sci Rep 8(1):1\u201316","journal-title":"Sci Rep"},{"key":"1704_CR53","doi-asserted-by":"publisher","first-page":"5091","DOI":"10.1109\/ACCESS.2019.2962751","volume":"8","author":"J Ma","year":"2019","unstructured":"Ma J, Fan J (2019) Local optimization for clique-based overlapping community detection in complex networks. IEEE Access 8:5091\u20135103","journal-title":"IEEE Access"},{"key":"1704_CR54","unstructured":"Maity S (2014) Detection of overlapping communities in social network. PhD thesis"},{"key":"1704_CR55","doi-asserted-by":"crossref","unstructured":"Maity S, Rath SK (2014) Extended clique percolation method to detect overlapping community structure. 2014 international conference on advances in computing. Communications and informatics (ICACCI), IEEE, pp 31\u201337","DOI":"10.1109\/ICACCI.2014.6968420"},{"key":"1704_CR56","doi-asserted-by":"crossref","unstructured":"Marchiori E (1998) A simple heuristic based genetic algorithm for the maximum clique problem. In: symposium on applied computing: proceedings of the 1998 ACM symposium on applied computing, Citeseer, pp 366\u2013373","DOI":"10.1145\/330560.330841"},{"issue":"2","key":"1704_CR57","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1016\/j.eswa.2011.08.059","volume":"39","author":"S Mimaroglu","year":"2012","unstructured":"Mimaroglu S, Yagci M (2012) Clicom: cliques for combining multiple clusterings. Expert Syst Appl 39(2):1889\u20131901","journal-title":"Expert Syst Appl"},{"key":"1704_CR58","doi-asserted-by":"crossref","unstructured":"Mohammadi M, Nikanjam A, Rahmani A (2008) An evolutionary approach to clustering ensemble. In: 2008 fourth international conference on natural computation, IEEE, pp 77\u201382","DOI":"10.1109\/ICNC.2008.493"},{"issue":"3","key":"1704_CR59","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H M\u00fchlenbein","year":"1997","unstructured":"M\u00fchlenbein H (1997) The equation for response to selection and its use for prediction. Evol Comput 5(3):303\u2013346","journal-title":"Evol Comput"},{"issue":"2","key":"1704_CR60","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1009689913453","volume":"5","author":"H M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein H, Mahnig T, Rodriguez AO (1999) Schemata, distributions and graphical models in evolutionary optimization. J Heurist 5(2):215\u2013247","journal-title":"J Heurist"},{"issue":"6","key":"1704_CR61","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"},{"key":"1704_CR62","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: proceedings of the 2016 international conference on management of data, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"issue":"7043","key":"1704_CR63","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I et al (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"key":"1704_CR64","doi-asserted-by":"crossref","unstructured":"Palla G, \u00c1bel D, Farkas IJ, et\u00a0al (2008) k-clique percolation and clustering. In: Handbook of large-scale random networks. Springer, p 369\u2013408","DOI":"10.1007\/978-3-540-69395-6_9"},{"key":"1704_CR65","unstructured":"Pelikan M, Goldberg DE, Cant\u00fa-Paz E, et\u00a0al (1999) Boa: the bayesian optimization algorithm. In: proceedings of the genetic and evolutionary computation conference GECCO-99, Citeseer, pp 525\u2013532"},{"key":"1704_CR66","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a JM, Robles V, Larranaga P et al (2004) Ga-eda: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms. In: international conference on industrial, engineering and other applications of applied intelligent systems. Springer, pp 361\u2013371","DOI":"10.1007\/978-3-540-24677-0_38"},{"issue":"1","key":"1704_CR67","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/prot.10505","volume":"54","author":"JB Pereira-Leal","year":"2004","unstructured":"Pereira-Leal JB, Enright AJ, Ouzounis CA (2004) Detection of functional modules from protein interaction networks. Proteins Struct Funct Bioinf 54(1):49\u201357","journal-title":"Proteins Struct Funct Bioinf"},{"key":"1704_CR68","unstructured":"Pinheiro CAR (2012) Community detection to identify fraud events in telecommunications networks. SAS SUGI proceedings: customer intelligence"},{"issue":"3","key":"1704_CR69","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"},{"key":"1704_CR70","doi-asserted-by":"crossref","unstructured":"Reid F, McDaid A, Hurley N (2012) Percolation computation in complex networks. In: 2012 IEEE\/ACM international conference on advances in social networks analysis and mining, IEEE, pp 274\u2013281","DOI":"10.1109\/ASONAM.2012.54"},{"issue":"11","key":"1704_CR71","first-page":"2093","volume":"30","author":"M Rezvani","year":"2018","unstructured":"Rezvani M, Liang W, Liu C et al (2018) Efficient detection of overlapping communities using asymmetric triangle cuts. IEEE Trans Knowl Data Eng 30(11):2093\u20132105","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1704_CR72","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118\u20131123","journal-title":"Proc Natl Acad Sci"},{"key":"1704_CR73","doi-asserted-by":"crossref","unstructured":"Samhitha KK, Sajeev G, Narayanan J (2018) A novel community detection method for collaborative networks. In: 2018 international conference on advances in computing. Communications and informatics (ICACCI), IEEE, pp 866\u2013872","DOI":"10.1109\/ICACCI.2018.8554522"},{"key":"1704_CR74","doi-asserted-by":"crossref","unstructured":"Sarr I, Ndong J, Missaoui R (2014) Overlaying social networks of different perspectives for inter-network community evolution. In: Social network analysis-community detection and evolution. Springer, p 45\u201370","DOI":"10.1007\/978-3-319-12188-8_3"},{"issue":"4","key":"1704_CR75","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt MC, Samatova NF, Thomas K et al (2009) A scalable, parallel algorithm for maximal clique enumeration. J Parallel Distrib Comput 69(4):417\u2013428","journal-title":"J Parallel Distrib Comput"},{"key":"1704_CR76","doi-asserted-by":"crossref","unstructured":"Schmitt R, Ramos P, Santiago R, et\u00a0al (2017) Novel clique enumeration heuristic for detecting overlapping clusters. In: 2017 IEEE congress on evolutionary computation (CEC), IEEE, pp 1390\u20131397","DOI":"10.1109\/CEC.2017.7969466"},{"key":"1704_CR77","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.physa.2018.08.045","volume":"512","author":"J Shang","year":"2018","unstructured":"Shang J, Wu H, Zhou S et al (2018) Impc: influence maximization based on multi-neighbor potential in community networks. Phys A 512:1085\u20131103","journal-title":"Phys A"},{"issue":"07","key":"1704_CR78","doi-asserted-by":"publisher","first-page":"P07042","DOI":"10.1088\/1742-5468\/2009\/07\/P07042","volume":"2009","author":"HW Shen","year":"2009","unstructured":"Shen HW, Cheng XQ, Guo JF (2009) Quantifying and identifying the overlapping community structure in networks. J Statist Mech Theory Exp 2009(07):P07042","journal-title":"J Statist Mech Theory Exp"},{"issue":"21","key":"1704_CR79","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin V, Mirny LA (2003) Protein complexes and functional modules in molecular networks. Proceed Natl Acad Sci 100(21):12123\u201312128","journal-title":"Proceed Natl Acad Sci"},{"key":"1704_CR80","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles\u2013a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"key":"1704_CR81","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jpdc.2014.08.011","volume":"79","author":"M Svendsen","year":"2015","unstructured":"Svendsen M, Mukherjee AP, Tirthapura S (2015) Mining maximal cliques from a large graph using mapreduce: tackling highly uneven subproblem sizes. J Parallel Distrib Comput 79:104\u2013114","journal-title":"J Parallel Distrib Comput"},{"key":"1704_CR82","doi-asserted-by":"crossref","unstructured":"Tang L, Liu H (2010) Graph mining applications to social network analysis. In: Managing and mining graph data. Springer, p 487\u2013513","DOI":"10.1007\/978-1-4419-6045-0_16"},{"key":"1704_CR83","doi-asserted-by":"crossref","unstructured":"Tomita E, Seki T (2003) An efficient branch-and-bound algorithm for finding a maximum clique. In: international conference on discrete mathematics and theoretical computer science, Springer, pp 278\u2013289","DOI":"10.1007\/3-540-45066-1_22"},{"issue":"1","key":"1704_CR84","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret Comput Sci 363(1):28\u201342","journal-title":"Theoret Comput Sci"},{"issue":"14","key":"1704_CR85","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.patrec.2008.06.011","volume":"29","author":"K Tumer","year":"2008","unstructured":"Tumer K, Agogino AK (2008) Ensemble clustering with voting active clusters. Pattern Recogn Lett 29(14):1947\u20131953","journal-title":"Pattern Recogn Lett"},{"key":"1704_CR86","doi-asserted-by":"crossref","unstructured":"Wang J, Zeng Z, Zhou L (2006) Clan: an algorithm for mining closed cliques from large dense graph databases. In: 22nd international conference on data engineering (ICDE\u201906), IEEE, pp 73\u201373","DOI":"10.1145\/1150402.1150506"},{"key":"1704_CR87","doi-asserted-by":"crossref","unstructured":"Wang L (2011) Using the relationship of shared neighbors to find hierarchical overlapping communities for effective connectivity in iot. In: 2011 6th international conference on pervasive computing and applications, IEEE, pp 400\u2013406","DOI":"10.1109\/ICPCA.2011.6106538"},{"key":"1704_CR88","doi-asserted-by":"publisher","first-page":"25258","DOI":"10.1109\/ACCESS.2017.2769484","volume":"5","author":"X Wang","year":"2017","unstructured":"Wang X, Liu G, Li J (2017) Overlapping community detection based on structural centrality in complex networks. IEEE Access 5:25258\u201325269","journal-title":"IEEE Access"},{"issue":"5","key":"1704_CR89","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","volume":"28","author":"JJ Whang","year":"2016","unstructured":"Whang JJ, Gleich DF, Dhillon IS (2016) Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans Knowl Data Eng 28(5):1272\u20131284","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1704_CR90","doi-asserted-by":"crossref","unstructured":"Wu B, Yang S, Zhao H, et\u00a0al (2009) A distributed algorithm to enumerate all maximal cliques in mapreduce. In: 2009 fourth international conference on frontier of computer science and technology, IEEE, pp 45\u201351","DOI":"10.1109\/FCST.2009.30"},{"key":"1704_CR91","doi-asserted-by":"publisher","first-page":"44221","DOI":"10.1109\/ACCESS.2018.2864240","volume":"6","author":"H Wu","year":"2018","unstructured":"Wu H, Shang J, Zhou S et al (2018) Laim: a linear time iterative approach for efficient influence maximization in large-scale networks. IEEE Access 6:44221\u201344234","journal-title":"IEEE Access"},{"key":"1704_CR92","doi-asserted-by":"crossref","unstructured":"Wu P, Pan L (2014) Detecting highly overlapping community structure based on maximal clique networks. In: 2014 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM 2014), IEEE, pp 196\u2013199","DOI":"10.1109\/ASONAM.2014.6921582"},{"key":"1704_CR93","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK, Liu X (2011) Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th international conference on data mining workshops, IEEE, pp 344\u2013349","DOI":"10.1109\/ICDMW.2011.154"},{"issue":"4","key":"1704_CR94","doi-asserted-by":"publisher","first-page":"1","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 (csur) 45(4):1\u201335","journal-title":"ACM Comput Surv (csur)"},{"key":"1704_CR95","doi-asserted-by":"crossref","unstructured":"Zhang BT (1999) A bayesian framework for evolutionary computation. In: proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), IEEE, pp 722\u2013728","DOI":"10.1109\/CEC.1999.782004"},{"key":"1704_CR96","doi-asserted-by":"crossref","unstructured":"Zhang J, Tan L, Tao X, et\u00a0al (2018) Slind: identifying stable links in online social networks. In: international conference on database systems for advanced applications, Springer, pp 813\u2013816","DOI":"10.1007\/978-3-319-91458-9_54"},{"key":"1704_CR97","doi-asserted-by":"crossref","unstructured":"Zhang J, Tao X, Tan L, et\u00a0al (2018) On link stability detection for online social networks. In: international conference on database and expert systems applications, Springer, pp 320\u2013335","DOI":"10.1007\/978-3-319-98809-2_20"},{"issue":"2","key":"1704_CR98","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q Zhang","year":"2005","unstructured":"Zhang Q, Sun J, Tsang E (2005) An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9(2):192\u2013200","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1704_CR99","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.compbiolchem.2006.10.001","volume":"30","author":"S Zhang","year":"2006","unstructured":"Zhang S, Ning X, Zhang XS (2006) Identification of functional modules in a ppi network by clique percolation clustering. Comput Biol Chem 30(6):445\u2013451","journal-title":"Comput Biol Chem"},{"issue":"4","key":"1704_CR100","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/TCSS.2017.2749282","volume":"4","author":"X Zhang","year":"2017","unstructured":"Zhang X, Wang C, Su Y et al (2017) A fast overlapping community detection algorithm based on weak cliques for large-scale networks. IEEE Trans Comput Soc Syst 4(4):218\u2013230","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1704_CR101","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.physa.2014.11.023","volume":"421","author":"Z Zhang","year":"2015","unstructured":"Zhang Z, Wang Z (2015) Mining overlapping and hierarchical communities in complex networks. Phys A 421:25\u201333","journal-title":"Phys A"},{"key":"1704_CR102","doi-asserted-by":"crossref","unstructured":"Zhang Z, Cui L, Pan Z, et\u00a0al (2018) A triad percolation method for detecting communities in social networks. Data Sci J 17","DOI":"10.5334\/dsj-2018-030"},{"key":"1704_CR103","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ins.2020.10.057","volume":"551","author":"X Zhao","year":"2021","unstructured":"Zhao X, Liang J, Wang J (2021) A community detection algorithm based on graph compression for large-scale social networks. Inf Sci 551:358\u2013372","journal-title":"Inf Sci"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01704-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01704-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01704-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T04:05:06Z","timestamp":1659758706000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01704-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":103,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1704"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01704-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,27]]},"assertion":[{"value":"6 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}