Premium
Distance dynamics based overlapping semantic community detection for node‐attributed networks
Author(s) -
Sun Heli,
Jia Xiaolin,
Huang Ruodan,
Wang Pei,
Wang Chenyu,
Huang Jianbin
Publication year - 2021
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/coin.12324
Subject(s) - node (physics) , vertex (graph theory) , hypergraph , computer science , graph , complex network , theoretical computer science , data mining , mathematics , algorithm , artificial intelligence , discrete mathematics , structural engineering , world wide web , engineering
In recent years, due to the rise of social, biological, and other rich content graphs, several novel community detection methods using structure and node attributes have been proposed. Moreover, nodes in a network are naturally characterized by multiple community memberships and there is growing interest in overlapping community detection algorithms. In this paper, we design a weighted vertex interaction model based on distance dynamics to divide the network, furthermore, we propose a distance Dynamics‐based Overlapping Semantic Community detection algorithm(DOSC) for node‐attribute networks. The method is divided into three phases: Firstly, we detect local single‐attribute subcommunities in each attribute‐induced graph based on the weighted vertex interaction model. Then, a hypergraph is constructed by using the subcommunities obtained in the previous step. Finally, the weighted vertex interaction model is used in the hypergraph to get global semantic communities. Experimental results in real‐world networks demonstrate that DOSC is a more effective semantic community detection method compared with state‐of‐the‐art methods.