A new algorithm for overlapping community detection
Bingyu Liu, Cuirong Wang, Cong Wang, Ying Yuan
Abstract
Bingyu Liu, Cuirong Wang, Cong Wang, Ying Yuan
Abstract
Social networks exhibit an overlapping community structure. Detecting overlapping communities and overlapping nodes in social network is an active field of research. The algorithm OMO uses only the network structure to detect communities and does not require any external parameters. The proposed algorithm applies a novel genetic algorithm to cluster on nodes. A scalable encoding schema is designed and the number of communities can be automatically determined. Compared with the COPRA algorithm, experiments on four real networks validate the effectiveness and efficiency of the algorithm.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Social networks exhibit an overlapping community structure. Detecting overlapping communities and overlapping nodes in social network is an active field of research. The algorithm OMO uses only the network structure to detect communities and does not require any external parameters. The proposed algorithm applies a novel genetic algorithm to cluster on nodes. A scalable encoding schema is designed and the number of communities can be automatically determined. Compared with the COPRA algorithm, experiments on four real networks validate the effectiveness and efficiency of the algorithm.
Key concepts: Computer science, Scalability, Schema (genetic algorithms), Community structure, Genetic algorithm, Encoding (memory), Field (mathematics), Data mining