Overlapping Community Discovery Algorithm Based on Three-Level Neighbor Node Influence

In view of the high time complexity of the current overlapping community discovery algorithm and the low stability, an overlapping community discovery algorithm OCDITN based on three-level neighbor influence is proposed. The algorithm uses three-level neighbor node influence measurement method TIM (Three-level Influence Measurement) to calculate the node influence, and determines the order of selecting and updating nodes according to the node influence; the similarity between the nodes is determined by the update sequence of neighbor node labels, and finally the label membership of each node is calculated to discover the overlapping communities. The experiment is performed based on the artificial simulation network data set and the real world network data set. Compared with the SLPA, LPANNI, and COPRA algorithms, the performance of this algorithm is improved by 7% and 12% on the two evaluation standards EQ and Qvo respectively.