2015
DOI: 10.1016/j.procs.2015.05.105
|View full text |Cite
|
Sign up to set email alerts
|

A Multi-Population Cultural Algorithm for Community Detection in Social Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
14
0
1

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 51 publications
(15 citation statements)
references
References 10 publications
0
14
0
1
Order By: Relevance
“…Despite various techniques have been utilized recently for discovering the densely connected clusters in networks, this crucial problem in various disciplines is still considered an open and a hard problem and has not been tackled satisfactorily since the networks have usually complex nature [14], [20]. More particularly, in huge networks, discovering successfully their module structure is still considered a great data mining problem [21].…”
Section: Optimization and Community Detection In Networkmentioning
confidence: 99%
“…Despite various techniques have been utilized recently for discovering the densely connected clusters in networks, this crucial problem in various disciplines is still considered an open and a hard problem and has not been tackled satisfactorily since the networks have usually complex nature [14], [20]. More particularly, in huge networks, discovering successfully their module structure is still considered a great data mining problem [21].…”
Section: Optimization and Community Detection In Networkmentioning
confidence: 99%
“…In recent years, some attempts tried to show that community structures are one of the significant characteristics in the most complex networks such as social networks due to numerous trends of human being to forming groups or communities. Due to the significant applications of community detection, several community detection approaches have been presented in literature which can be classified into six categories: spectral and clustering methods [20], [21], [15], [22], hierarchical algorithms [23], modularity-based methods [24], [25], evolutionary modelbased methods [26], [27], local community detection methods, and feature-based assisted methods [11]. Along with that total sixteen articles (published in 2015 to 2017) presented in this survey are summarized in Table 1 that contains eight columns.…”
Section: Community Detection Over Snsmentioning
confidence: 99%
“…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.…”
Section: Modularity Optimization Using Simulated Annealingmentioning
confidence: 99%