Local Community Detection With the Dynamic Membership Function

Most of the community detection methods require the global information of the original network to be available, however, it is often expensive (even no way) to obtain the global information of the network in many real-world networks. So, the local community detection, only based on the local information, becomes especially important. The local community is the community in the network to which a given starting node belongs. Some local community detection methods have been proposed. However, these methods did not consider the characteristics of the local community during the local community formation. In this paper, we analyze the formation of the local community and propose two local community detection algorithms based on the dynamic membership function. Each of the algorithms is divided into three stages: 1) the initial stage, 2) the middle stage, and 3) the closing stage. At the initial stage, we design a dynamical membership function to detect local community and nodes with the greatest neighborhood intersect rate could be added to the local community. At the middle stage, we design another dynamical membership function, and the goal of this stage is to make the connection of the node in the local community closest. At the closing stage, the third dynamical membership function is provided, and the local community is further improved by collecting some nodes that should not be omitted. We test our algorithms on several synthetic datasets and real datasets; the results show that the local communities detected by our method are closer to the real local communities.