A New Fast Local Community Detection Algorithm Using the Number of Common Neighbours

Recent years have witnessed the rapid growth of social network services. Consequently, the problems in this area have become more complex. Community detection is one of the most important problems in social networks. A good community can be defined as a group of vertices that are highly connected and loosely connected to the vertices outside the community. Regarding the fact that social networks are huge in size, having complete information of the whole network is almost impossible. As a result, the problem of local community detection has become more popular in recent years. In this paper, a new fast local community detection algorithm is proposed using a new metric, called P. The proposed algorithm includes three different steps in which relevant nodes are added in the first step and irrelevant nodes are removed in the second and third steps. Regarding the experimental results, it is shown that the proposed algorithm outperforms state-of-the-art local community detection algorithms. Also, the proposed algorithm is considerably faster than other compared algorithms.