Overlapping Community Detection Combining Topological Potential and Trust Value of Nodes

摘要

Aiming at the problems of existing algorithms, such as instability, neglecting interaction between nodes and neglecting attributes of node, an overlapping community discovery algorithm combining topological potential and trust value of nodes was proposed. Firstly, the importance of nodes is calculated according to topological potential and the trust value of the node, and then K core nodes are selected. In final, the final division of communities are finished by using the extended modularity and core nodes. Experimental results on LFR network datasets and three real network datasets, verify the efficiency of the proposed OCDTT algorithm.