关键词: 在线社会网络, 社区发现, 共同好友, 局部结构

Abstract: To partition online social networks into groups fast and correctly, this paper proposes an algorithm for detecting community structures in online social networks based on shared friends and node neighbors information. By looking for the maximum number of shared friends based on the maximum degree node, the initial community included two nodes is found, and Q value of the node is used to decide whether the node of initial community neighbor is added into the community. The final community structure is decided by the initial community information of node neighbors. Two classical social networks and synthetic datasets are used to test the performance of the algorithm. Experimental results show that the proposed algorithm is viable and effective.

Key words: online social network, community detecting, shared friends, local structure