Dynamic Community in static social networks using the gray wolf optimizer algorithm
Identifying communities in complex networks is an important issues in social network analysis, and it helps researchers understand the function and display of network structures. Clustering or recognizing communities will reveal the structure of groups in social networks and hidden communication bet...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Qom
2020-03-01
|
| Series: | مدیریت مهندسی و رایانش نرم |
| Subjects: | |
| Online Access: | https://jemsc.qom.ac.ir/article_1267_2adbe4e6a45159c250534efabd54df6a.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Identifying communities in complex networks is an important issues in social network analysis, and it helps researchers understand the function and display of network structures. Clustering or recognizing communities will reveal the structure of groups in social networks and hidden communication between its components. A community is a collection of nodes whose density of communication is more than the other network entities.In this paper, a new algorithm for recognizing communities in static networks has been presented which utilizes Gray Wolf Optimizer algorithm, which has the ability to scale according to the selected criteria. It has been shown that one of the most important characteristics of meta-algorithms is the lack of trapping at the local minimum. Gray Wolf Optimizer algorithm is less likely to be trapped than other optimization algorithms such as the genetic algorithm and the particle swarm algorithm. Finally, the results of the experiments showed that the algorithm is better than other algorithms on average. |
|---|---|
| ISSN: | 2538-6239 2538-2675 |