| 本文已被：浏览 6326次 下载 8441次 |
码上扫一扫！ |
|
|
| 从链接密度遍历序列中挖掘网络社团的层次结构 |
|
黄健斌1, 孙鹤立2, Dustin BORTNER3, 刘亚光1
|
|
1.西安电子科技大学 软件学院,陕西 西安 710071;2.西安交通大学 计算机科学与技术系,陕西 西安 710049;3.Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana 61801, USA
|
|
| 摘要: |
| 提出一种称为TRAVEL 的网络聚类算法.它能够产生包含所有可能密度聚类的网络链接遍历序列,并从中自动发现网络的全局优化聚类.然后,遍历序列被转换为连续子区间堆结构.在此基础上,提出一种聚类算法HCLU,可以无须用户干预地从连续子区间堆中自动发现网络的层次聚类边界.在真实网络以及计算机生成的仿真网络数据集上的实验结果表明,所提出的算法比目前的基准方法具有更高的聚类精度.此外,算法能够从各种带有噪声的网络中发现无冗余且鲁棒的层次社团结构. |
| 关键词: 基于密度的网络聚类 层次社团发现 中心点 离群点 |
| DOI：10.3724/SP.J.1001.2011.03939 |
| 分类号: |
| 基金项目:国家自然科学基金(60933009); 陕西省自然科学基础研究计划(SJ08-ZT14) |
|
| Mining Hierarchical Community Structure Within Networks from Density-Connected Traveling Orders |
|
HUANG Jian-Bin1, SUN He-Li2, Dustin BORTNER3, LIU Ya-Guang1
|
|
1.School of Software, Xidian University, Xi’an 710071, China;2.Department of Computer Science and Technology, Xi’an Jiaotong University, Xi’an 710049, China;3.Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana 61801, USA
|
| Abstract: |
| This paper proposes a density-based network clustering algorithm, TRAVEL. The algorithm produces a traveling order containing clustering with various densities and finds the optimal clusters in it. The traveling order is subsequently transformed into a data structure of contiguous subinterval heap based on which a clustering algorithm, HCLU, is designed to find the hierarchical cluster boundaries of the network without any user interaction. Experimental results on real-world and computer-generated synthetic networks show that the clustering accuracy of the proposed algorithms is higher than the baseline methods. Furthermore, they are able to produce robust hierarchical communities in various networks with low redundancy in the presence of noise. |
| Key words: density-based network clustering hierarchical community detection hub outlier |
