文章检索

基于SA-LEN的网络社区发现的研究

  • 顾亦然 ,
  • 孙晖
展开
  • 南京邮电大学自动化学院,南京 210000
顾亦然(1972-),女,江苏金坛人,博士,教授,主要研究方向为复杂网络理论与应用。

收稿日期: 2014-10-16

  修回日期: 2014-12-31

  网络出版日期: 2026-06-22

基金资助

国家自然科学基金(61373136);教育部人文社科规划基金(12YJAZH120)

SA-LEN Based Network Community Detection

  • GU Yiran ,
  • SUN Hui
Expand
  • Automation college, Nanjing University of Posts and Telecommunications, Nanjing 210000, China

Received date: 2014-10-16

  Revised date: 2014-12-31

  Online published: 2026-06-22

摘要

构建了一种LR-S复合网络,分别提取了L-IRS网络中的最短路径长度和R-RTCS网络中的活跃度两个元素,提出了一种新的节点间相似度评价函数SA-LEN及基于节点相似度的社区划分算法。通过对多种计算机生成网络和自然网络实验发现,本文的SA-LEN的网络社区发现算法具有较高准确性。

本文引用格式

顾亦然 , 孙晖 . 基于SA-LEN的网络社区发现的研究[J]. 复杂系统与复杂性科学, 2015 , 12(2) : 85 -90 . DOI: 10.13306/j.1672-3813.2015.02.013

Abstract

Division of network community contributes to a better understanding of community structure and predict the behavior of complex network, and has great application value in social network, information recommendation and precision marketing, and so on. This paper builds a LR-S hierarchical network, proposed a SA-LEN evaluation function of similarity degree and a SA-LEN community detecting algorithm, based on the two factors that shortest path length of L-IRS networkand activeness of R-RTCS network. This algorithm proved to be effective in nature networks and computer generated networks.

参考文献

[1] Newman MEJ. Detecting community structure in networks[J]. The European Physical Journal B-Condensed Matter and Complex Systems, 2004, 38(2): 321-330.
[2] Lancichinetti A, Kivelä M, Saramäki J, et al. Characterizing the community structure of complex networks[J]. PloS one, 2010, 5(8): e11976.
[3] Girvan M, Newman M E J. Community structure in social and biological networks[J].Proceedings of the National Academy of Sciences, 2002, 99(12): 7821-7826.
[4] 汪小帆, 李翔, 陈关荣. 复杂网络及其应用[M]. 北京: 清华大学出版社, 2006.
[5] 毛国君. 数据挖掘原理与算法[M].北京:清华大学出版社,2000 年.
[6] Garey MR, Johnson DS. Computers And Intractability: a Guide to the Theory of NP-Hardness[M]. New York: W H Freeman and Company, 1979.
[7] The SAGE Handbook of Social Network Analysis[M]. SAGE Publications, 2011.
[8] Kernighan BW, Lin S. An efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal, 1970, 49(2): 291-307.
[9] Y, Li M, Zhang P. Community detection by signaling on complex networks[J]. Physical Review E, 2008, 78(1): 16115.
[10] 王贵竹,张家勇,王炳庭. SA-DTN: 基于节点社会活跃度的DTN 路由研究[J].计算机应用研究,2011(4):1524-1526.
Wang Guizhu, Zhang Jiayong, Wang Bingting. SA-DTN: research of DTN routing based on node social activity[J]. Application Research of Computers.2011(40):1524-1526.
文章导航

/

〈 〉