关键词: 社会计算, 社团发现, 主题模型, 主题划分

Abstract: The link relationship is used to divide communities in traditional community detection algorithms, which has the disadvantage of detecting the non-link relationship and is bad for the division accuracy. In this paper, it analyzes the text information in nodes and extracts the hidden topic information to determine the relationship of the communities on topic. Based on this, it designs an optimized Dirichlet allocation model to divide the communities by topics. Furthermore, a community detecting algorithm of optimized module is applied to divide the communities by links. Both these two methods are then combined into a hybrid algorithm that is capable of topic division and link division. Moreover, an evaluation method is designed to verify the effectiveness of the proposed algorithm in each stage of the community detecting process. The results show that the proposed algorithm can conduct topic division and link division correctly for the communities.

Key words: social computing, community detection, topic model, topic division