Overlapping Community Detection in Social Network Using Disjoint Community Detection

With increasing popularity and complexity of social networks, community detection in these networks has become an important research area. Several algorithms are available to detect overlapping community structures based on different approaches. Here we propose a two step genetic algorithm to detect overlapping communities based on node representation. First, we find disjoint communities and these disjoint communities are used to find overlapping communities. We use modularity as our optimization function. Experiments are performed on both artificial and real networks to verify efficiency and scalability of our algorithm.