关键词: 信息网络, 自适应聚类, 信息层

Abstract: The time cost of traditional clustering algorithm is too high when using it to large scale information network. To solve this issue, based on the statistical characteristic of information network, this paper proposes a novel “divide and conquer” strategy on information network, which reduces the clustering size and time cost heavily without efficiency loss. The main contribution of this paper is three folds: (1) It proposes the idea that clustering in different layers separately after dividing the whole information network into several layers according to the clustering contribution rank; (2) Based on the rich-club phenomenon and hierarchical community feature which exists in information network, it designs the blueprint of layer dividing method of clustering algorithm; (3) It presents an iteration procedure to merge clusters in different layers. The experimental results show that the proposed algorithm has good clustering effect and can reduce time cost.

Key words: information network, adaptive clustering (AC), information layer