期刊文献+

一种基于适度贪心算法思路的社团划分改进方法

Community Division Method in Networks Based on Moderately Greedy Algorithm
下载PDF
导出
摘要 当前问题背景下贪心算法存在不足,由此提出一种适度贪心的算法思路,引入适度原则,约束贪婪幅度,以避免过度贪婪、谬误累积的情况,并将适度贪心算法思路应用于FN社团划分算法的改进研究,构建了一种新的网络社团区划算法.通过算例对提出的算法进行了测试与分析,实验结果验证了新算法的可行性与有效性. This paper ,based on the deficiency of greedy algorithm ,tries to propose a new algorithmic thinking from the perspective of the moderate principle . The moderate principle can avoid the occurrence of excessive greed situation .Based on the lack of FN algorithm ,this paper proposes a new algorithm to divide community structure from the perspective of the moderately greedy algorithm . Finally , the new algorithm is illustrated through ex am ples .
作者 武澎 王恒山
出处 《微电子学与计算机》 CSCD 北大核心 2014年第7期101-104,共4页 Microelectronics & Computer
基金 国家自然科学基金资助项目(71071098) 上海市一流学科建设项目(S12016LXK)
关键词 社团结构 FN算法 贪心算法 community structure FN algorithm greedy algorithm
  • 相关文献

参考文献4

二级参考文献91

  • 1刘洋,代树武,孙辉先.卫星有效载荷的规划与调度[J].航天控制,2004,22(5):73-76. 被引量:6
  • 2[1]Gibson D,Kleinberg J,Raghavan P.Inferring web communities from link topology[A].Proceedings of the 9th ACM Conference on Hypertext and Hypermedia[C].1998.225-234.
  • 3[2]Flake G W,Lawrence S R,Giles C L,et al.Self-organization and identification of web communities[J].IEEE Computer,2002,35 (3):66-71.
  • 4[3]Adamic A L,Adar E.Friends and neighbors on the web[J].Social Networks,2003,25 (3):211-130.
  • 5[4]Shen-Orr S,Milo R,Mangan S,et al.Network motifs in the transcriptional regulation network of Escherichia coli[J].Nature Genetics,2002,31 (1):64-68.
  • 6[5]Milo R,Shen-Orr S,Itzkovitz S,et al.Network motifs:simple building blocks of complex networks[J].Science,2002,298 (5594):824-827.
  • 7[6]Holme P,Huss M,Jeong H.Subnetwork hierarchies of biochemical pathways[J].Bioinformatics,2003,19 (4):532-538.
  • 8[7]Girvan M,Newman M E J.Community structure in social and biological networks[J].Proc Natl Acad Sci,2001,99 (12):7 821-7 826.
  • 9[8]Gleiser P,Danon L.Community structure in jazz[J].Advances in Complex Systems,2003,6 (4):565-573.
  • 10[9]Garey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP-Completeness[M].San Francisco:W.H.Freeman Publishers,1979.

共引文献146

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部