针对全局社区发现方法计算复杂度过高,而局部社区发现方法社区发现质量偏低的不足,提出了一种快速有效的社区划分算法。算法预先探测网络中属于不同社区的核心节点,利用基于相似性传递的节点相似性度量方法度量核心节点与网络中其他节点之间的相似性,根据相似性度量结果对网络进行社区结构划分。在采自人人网的数据和公共的网络数据上进行了实验,并与经典算法进行比较,实验结果表明了该算法的可行性和有效性。
To solve the problem that global community detection method has high computation complexity and local community detection method works badly in community detection quality, a quick and efficient algorithm is proposed. It finds the core nodes in different communities first, then uses a method based on similarity transfer to measure the similarity between core nodes and other nodes. Finally it divides the network by the similarity calculation results. The proposed algorithm is tested on both RenRen network and common networks, and is compared with the typical algorithms in community detection. Experimental results verify and confirm the feasibility and validity of the proposed algorithm.