计算机科学与探索Issue(4)：406-416,11.DOI:10.3778/j.issn.1673-9418.1401024
面向大规模信息网络的高效自适应聚类算法
Efficient Adaptive Clustering Algorithm for Large Scale Information Network
摘要
Abstract
The time cost of traditional clustering algorithm is too high when using it to large scale information net-work. 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分类
信息技术与安全科学引用本文复制引用
吴诗极,李川,唐常杰,李洋涛,曾卫,杨尚乾,杨宁..面向大规模信息网络的高效自适应聚类算法[J].计算机科学与探索,2014,(4):406-416,11.基金项目
The National Natural Science Foundation of China under Grant No.61103043(国家自然科学基金) （国家自然科学基金）
the National“12th-Five-Year Plan”Key Technology R&D Program of China under Grant No.2012BAG04B02(国家“十二五”科技支撑计划项目) （国家“十二五”科技支撑计划项目）
the Program of State Key Laboratory of Software Engineering of Wuhan University under Grant No. SKLSE2012-09-26(武汉大学软件工程国家重点实验室开放基金项目) （武汉大学软件工程国家重点实验室开放基金项目）
