Community Detection in Complex Networks Using Link Strength-Based Hybrid Genetic Algorithm
| Autor: | Deepanshu Malhotra |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Modularity (networks)
General Computer Science Computer Networks and Communications Computer science business.industry Evolutionary algorithm Community structure Link (geometry) Complex network Machine learning computer.software_genre Computer Graphics and Computer-Aided Design Outcome (game theory) Computer Science Applications Computational Theory and Mathematics Artificial Intelligence Genetic algorithm Local search (optimization) Artificial intelligence business computer |
| Zdroj: | SN Computer Science. 2 |
| ISSN: | 2661-8907 2662-995X |
| DOI: | 10.1007/s42979-020-00389-4 |
| Popis: | Communities have proven to be one of the important topological features of complex networks and can be discovered in various aspects of life. Understanding these community structures help the researchers to unlock distinct characteristics of networks that are not visible otherwise. In this paper, a hybrid genetic algorithm with link strength-based local search strategy (HGALS) is proposed for solving the community detection problem. The local search method presented in the algorithm is faster than the traditional modularity-based search operations. Furthermore, different variants of link strength measures are used in the local search method that is useful for various types of complex networks. The HGALS algorithm is analysed using different community structure metrics and its outcome is compared with three evolutionary algorithms and seven non-evolutionary algorithm-based approaches. The results thus obtained from the comparisons with other algorithms show good performances of HGALS in most of the cases for identifying better community structures. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink