2012
DOI: 10.1007/978-3-642-34413-8_6
|View full text |Cite
|
Sign up to set email alerts
|

Community Detection in Social and Biological Networks Using Differential Evolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 57 publications
(33 citation statements)
references
References 28 publications
0
32
0
Order By: Relevance
“…2, the horizontal axis represents the number of inter community edges Zout and the vertical axis represents the fraction of vertices classified correctly. It is clear that our VSDE performs significantly better than DECD [7] in the range Z out > 7 while it performs almost same when Z out <=7. The performance of VSDE was further tested on two realworld social networks, Zachary's karate club network [12] and American college football network [13].…”
Section: Vsde Has Been Implemented In Matlab and On Windowsmentioning
confidence: 67%
See 3 more Smart Citations
“…2, the horizontal axis represents the number of inter community edges Zout and the vertical axis represents the fraction of vertices classified correctly. It is clear that our VSDE performs significantly better than DECD [7] in the range Z out > 7 while it performs almost same when Z out <=7. The performance of VSDE was further tested on two realworld social networks, Zachary's karate club network [12] and American college football network [13].…”
Section: Vsde Has Been Implemented In Matlab and On Windowsmentioning
confidence: 67%
“…We have presented VSDE as an improvisation of existing differential evolution technique [7] to identify community in complex networks. This algorithm requires no prior information about the networks which makes VSDE suitable for real world applications.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…As effective tools to solve combinatorial problems, metaheuristic algorithms have been widely applied to search satisfied solutions [7, 8]. The original paper [5] proposed to use simulated annealing (SA), a generic probabilistic metaheuristic to solve this problem.…”
Section: Introductionmentioning
confidence: 99%