“…of generations for unimproved fittest chromosome fraction of mined hubs, no. of communities Tasgin et al [55] Modularity optimization Modularity, population size, number of chromosomes Zadeh [56] Multi population cultural algorithm BS-average, BSN [57] Iterative label propagation SLPA [58], WLPA [59], COPRA [60], Label Rank [61], BMPLA [62] Nodes,label [58], Labels,threshold [59], Label,similarity [60], nodes [ [65] CPM Nodes, threshold weight Lancichinetti et al [66] Works on the principle of the Fitness function Fitness function Du et al (Com Tector) [67] Kernels based clustering Set of all kernels Shen et al(EAGLE) [68] Agglomerative hierarchical clustering The similarity between the two communities Evans et al [69] Line graph, clique graph Edges,Partition Lee et al [70] Cliques based expansion Fitness funciton Gregory et al (CONGO [71], Peacock algorithm [72] Split between Local betweenness, short paths [71], the ratio of max, edge betweenness, and max,splitbetweeness [72]. [75] Clusters of overlapping vertices Internal edge intensity, external edge intensity,internal edge probability,edge ratio,intensity ratio Chen et al [76] Game theory Number of communities gain function, loss function Alvaro et al [77] Game theory based Number of snapshots, with V vertices and E edges Shi et al [78] Objective function: partition function Size of population,runninggenereation fraction of crossover,fraction of mutation Xing et al (OCDLCE) [79] Community detection Nodes,edges,neighbours of node Bhat et al ( OCMier) [80] Density-based Threshold Some traditional methods are easy but often need to decide the number or the size of clusters, other traditional methods are usually slow or need to know where to cut the dendrogram tree; Overlapping community detection methods can detect overlapping community but some methods are suitable for networks with many full connected subgraph or great uncertainty.…”