Motif‐based embedding label propagation algorithm for community detection
Chunying Li, Yong Tang, Zhikang Tang, Jinli Cao, Yanchun Zhang
Abstract
Community detection can exhibit the aggregation behavior of complex networks. Network motifs are the fundamental building blocks which can reveal the higher-order structure of complex networks. Label propagation algorithm has the advantage of approximately linear time complexity, unfortunately, the randomness of label update is a major but unsolved issue. For these reasons, this paper proposes a novel community detection method, named motif-based embedding label propagation algorithm (MELPA). First, complex network topology is reconstructed by merging higher-order topology with lower-order connectivity features, where higher-order topology is captured by mining network motifs. Second, We design a label propagation characteristic model according to nodes influence, then a new label update rule is formulated based on reconstructed weighted network, the rule integrates frequency among neighbor labels, influence of nodes, propagation characteristics and closeness of nodes to update the node label, the purpose is to overcome the randomness of label selection and identify a better and more stable community structure. Finally, extensive experiments on synthetic networks and real-world complex networks are conducted to verify the effectiveness of MELPA, especially for the complex networks with unobvious community structure, MELPA will get unexpected results.