期刊文献+

复杂网络社区挖掘——改进的层次聚类算法 被引量:6

Community detection in complex networks-an improved hierarchical clustering algorithm
下载PDF
导出
摘要 社区挖掘算法研究是复杂网络分析领域的热点问题。传统层次聚类算法在复杂网络社区挖掘过程中,需要计算所有顶点对之间的相似度。针对这一缺点,在详述了常见相似度计算方法和顶点重要性度量方法的基础上,将ego角色的探测过程引入层次聚类算法,而后只计算其他顶点与ego顶点之间的相似度,提高了社区挖掘效率。最后在不同类型的现实网络中验证了算法的有效性。 Community detection has been a hot topic in the analysis of complex networks. Traditional hierarchical clustering algorithm has to compute each pair of vertices in the process of community detecting.To address this weakness,after the description of normal similarity calculation method and measures of the centrality of vertices,a ego actor detecting process added to the hierarchical clutering method, then only compute similarity between ego vertex and other vertices,to improve the efficiency of community detecting. Finally, real network experiments show that this improved algorithm is effective.
作者 郑浩原 黄战
出处 《微型机与应用》 2011年第16期85-88,共4页 Microcomputer & Its Applications
关键词 复杂网络 社区挖掘 层次聚类 complex networks community detection hierarchical clustering
  • 相关文献

参考文献8

  • 1GIRVAN M,NEWMAN M E J.Community structure in social and biological networks [C ]. Prec. Nail. Acad. Sci. USA 99,2002 : 7821-7826.
  • 2杨博,刘大有,LIU Jiming,金弟,马海宾.复杂网络聚类方法[J].软件学报,2009,20(1):54-66. 被引量:212
  • 3FORTUNATO S.Community detection in graphs[C].arXiv: 0906.0612,2010.
  • 4HANNEMAN R A, RIDDLE M.Introduction to social network methods[M/OL].Riverside, CA : Universityof California, Riverside, 2005. http ://faculty. ucr. edu/- hanneman/.
  • 5ADAMIC L A, ADAR E.Friends and neighbors on the web [ J ]. Social Networks, 2007,25 (2): 211 - 230.
  • 6NEWMAN M E J.Mathematics of networks[M].In The New Palgrave Encyclopedia of Economics, 2rid edition.Palgrave Macmillan, Basingstoke, 2007.
  • 7NEWMAN M E J, GIRVAN M.Finding and evaluating community structure in networks[J].Physical Review E, 69, 2004.
  • 8ZACHARY W W.An information flow model for conflict and fission in small groups[J].Journal of Anthropological Research, 1977, 33(2):452-473.

二级参考文献56

  • 1Watts D J, Strogatz SH. Collective dynamics of Small-World networks. Nature, 1998,393(6638):440-442.
  • 2Barabasi AL, Albert R. Emergence of scaling in random networks. Science, 1999,286(5439):509-512.
  • 3Barabasi AL, Albert R, Jeong H, Bianconi G. Power-Law distribution of the World Wide Web. Science, 2000,287(5461):2115a.
  • 4Albert R, Barabasi AL, Jeong H. The Internet's Achilles heel: Error and attack tolerance of complex networks. Nature, 2000, 406(2115):378-382.
  • 5Girvan M, Newman MEJ. Community structure in social and biological networks. Proc. of the National Academy of Science, 2002,9(12):7821-7826.
  • 6Guimera R, Amaral LAN. Functional cartography of complex metabolic networks. Nature, 2005,433(7028):895-900.
  • 7Palla G, Derenyi I, Farkas I, Vicsek T. Uncovering the overlapping community structures of complex networks in nature and society. Nature, 2005,435(7043):814-818.
  • 8Wilkinson DM, Huberman BA. A method for finding communities of related genes. Proc. of the National Academy of Science, 2004,101(Suppl.1):5241-5248.
  • 9Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D. Defining and identifying communities in networks. Proc. of the National Academy of Science, 2004,101 (9):2658-2663.
  • 10Palla G, Barabasi AL, Vicsek T. Quantifying social group evolution. Nature, 2007,446(7136):664-667.

共引文献211

同被引文献41

  • 1解(亻刍),汪小帆.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学,2005,2(3):1-12. 被引量:86
  • 2王林,戴冠中.复杂网络中的社区发现——理论与应用[J].科技导报,2005,23(8):62-66. 被引量:50
  • 3王林,戴冠中.复杂网络的度分布研究[J].西北工业大学学报,2006,24(4):405-409. 被引量:68
  • 4方锦清,汪小帆,郑志刚,毕桥,狄增如,李翔.一门崭新的交叉科学:网络科学(上)[J].物理学进展,2007,27(3):239-343. 被引量:131
  • 5吕琳媛,周涛.链路预测[M].北京:高等教育出版社,2013.
  • 6NEWMAN M E J, GIRVAN M. Finding and evaluating community structure in networks[J]. Physical Revew E, 2004, 69(2) :26113.
  • 7NEWMAN M E J. Fast algorithm for detecting community structure in networks []]. Physical Review E, 2004,69- 06613.
  • 8Ruan Jianhua, Zhang Weixiong. An efficient spectral algorithm for network community discovery and its applications to biological and social networks [C]. Seventh IEEE International Conference on Data Mining, ICDM 2007, 2007 : 643-648.
  • 9KERNIGHAN B W, LIN S. An efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal, 1970,49 (2) :291-307.
  • 10NEWMAN M E J. Modularity and community structure in networks[J]. Proc Natl Acad Sci USA, 48109-1040, 2006, 103 (23) : 8577-8582.

引证文献6

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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