Determining Community Structure and Modularity in Social Network using Genetic Algorithm
| Autor: | Taufan Bagus Dwi Putra Aditama, Azhari SN |
|---|---|
| Jazyk: | English<br />Indonesian |
| Rok vydání: | 2020 |
| Předmět: | |
| Zdroj: | IJCCS (Indonesian Journal of Computing and Cybernetics Systems), Vol 14, Iss 3, Pp 219-230 (2020) |
| Druh dokumentu: | article |
| ISSN: | 1978-1520 2460-7258 |
| DOI: | 10.22146/ijccs.57834 |
| Popis: | Research on determining community structure in complex networks has attracted a lot of attention in various applications, such as email networks and social networks. The popularity determines the structure of a community because it can analyze the structure. Meanwhile, to determine the structure of the community by maximizing the value of modularity is difficult. Therefore, a lot of research introduces new algorithms to solve problems in determining community structure and maximizing the value of modularity. Genetic Algorithm can provide effective solutions by combining exploration and exploitation. This study focuses on the Genetic Algorithm which added a cleanup feature in the process. The final results of this study are the results of a comparison of modularity values based on the determination of the community structure of the Genetic Algorithm, Girvan and Newman Algorithm, and the Louvain Algorithm. The best modularity values were obtained using the Genetic Algorithm which obtained 0.6833 results for Zachary's karate club dataset, 0.7446 for the Bottlenose dolphins dataset, 0.7242 for the American college football dataset, and 0.5892 for the Books about US politics dataset. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|