CC-GA: A clustering coefficient based genetic algorithm for detecting communities in social networks

Citation data:

Applied Soft Computing, ISSN: 1568-4946, Vol: 63, Page: 59-70

Publication Year:
Captures 19
Readers 19
Social Media 195
Shares, Likes & Comments 187
Tweets 8
Citations 6
Citation Indexes 6
Anwar Said; Rabeeh Ayaz Abbasi; Onaiza Maqbool; Ali Daud; Naif Radi Aljohani
Elsevier BV
Computer Science
Most Recent Tweet View All Tweets
article description
A community structure is an integral part of a social network. Detecting such communities plays an important role in a wide range of applications, including but not limited to cluster analysis, recommendation systems and understanding the behaviour of complex systems. Researchers have derived many algorithms to discover the community structures of networks. Discovering communities is a challenging task, and there is no single algorithm that produces the best results for all networks. Therefore, despite many elegant solutions, discovering communities remains an active area of research. In this paper, we propose a novel algorithm, the Clustering Coefficient-based Genetic Algorithm (CC-GA), for detecting them in social and complex networks. Researchers have used several genetic algorithms to detect communities, but the proposed algorithm is novel in terms of both the generation of the initial population and the mutation method, and these improve its efficiency and accuracy. Experiments on a variety of real-world datasets and a comparison to state-of-the-art genetic and non-genetic-based algorithms show improved results.