| 注册
首页|期刊导航|计算机应用研究|基于种子节点选择的重叠社区发现算法

基于种子节点选择的重叠社区发现算法

齐金山 梁循 王怡

计算机应用研究2017,Vol.34Issue(12):3534-3537,3568,5.
计算机应用研究2017,Vol.34Issue(12):3534-3537,3568,5.DOI:10.3969/j.issn.1001-3695.2017.12.003

基于种子节点选择的重叠社区发现算法

Overlapping community detection algorithm based on selection of seed nodes

齐金山 1梁循 2王怡1

作者信息

  • 1. 中国人民大学信息学院,北京100872
  • 2. 淮阴师范学院计算机科学与技术学院,江苏淮安223300
  • 折叠

摘要

Abstract

In view of the unreasonable selection in seed algorithm from the local community expanding into a global community at present,this paper proposed an overlapping community detection algorithm based on selection of the seed nodes.The algorithm used the influence function to find out the strongest nodes in local node influences,which structured the seeds distributing throughout the network.And then utilized these seeds to construct the initial community,selectively added nodes to expand the community according to the set attraction function.The experimental results show that the algorithm tested in a real network can effectively dig out overlapping community in the network.

关键词

重叠社区/局部社区/吸引度函数/社区扩展

Key words

overlapping community/local community/attraction function/community expansion

分类

信息技术与安全科学

引用本文复制引用

齐金山,梁循,王怡..基于种子节点选择的重叠社区发现算法[J].计算机应用研究,2017,34(12):3534-3537,3568,5.

基金项目

国家自然科学基金资助项目(71271211,71531012) (71271211,71531012)

北京市自然科学基金资助项目(4132067) (4132067)

中国人民大学品牌计划资助项目(10XNI029) (10XNI029)

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量1
|
下载量0
段落导航相关论文