| 注册
首页|期刊导航|计算机工程|基于共享邻居数的社团结构发现算法

基于共享邻居数的社团结构发现算法

刘微 张大为 嵇敏 谢福鼎

计算机工程2011,Vol.37Issue(6):172-174,3.
计算机工程2011,Vol.37Issue(6):172-174,3.DOI:10.3969/j.issn.1000-3428.2011.06.059

基于共享邻居数的社团结构发现算法

Community Structure Detection Algorithm Based on Number of Shared Neighbors

刘微 1张大为 1嵇敏 1谢福鼎1

作者信息

  • 1. 辽宁师范大学计算机与信息技术学院,辽宁,大连,116081
  • 折叠

摘要

Abstract

To partition complex networks into groups fast and correctly, this paper proposes an algorithm for detecting community structures in complex networks based on shared neighbors and local modularity. By looking for the numbers of shared neighbors between nodes one by one, the node connected closely with the community is found, and the local modularity is used to decide whether this found node is added into the community. Three typical complex networks are used to test the performance of the algorithm. Experimental results show that it is viable and effective.

关键词

复杂网络/社团结构/共享邻居/局部模块度

Key words

complex network/ community structure/ shared neighbor/ local modularity

分类

信息技术与安全科学

引用本文复制引用

刘微,张大为,嵇敏,谢福鼎..基于共享邻居数的社团结构发现算法[J].计算机工程,2011,37(6):172-174,3.

基金项目

国家自然科学基金资助项目(10771092) (10771092)

计算机工程

OACSCDCSTPCD

1000-3428

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