期刊文献+

复杂网络拓扑可视化方案设计与实现 被引量:8

Design and Implementation of Complex Network Topology Visualization Scheme
下载PDF
导出
摘要 针对复杂网络拓扑采用传统网络拓扑可视化方式呈现会导致网络结构信息难以观察的问题,文中在提出一种基于节点和边关键性的网络拓扑压缩算法—NECB算法以及改进的FDA算法—FR算法的基础上,利用复杂网络拓扑可视化软件NetworkX设计并实现了一种复杂网络拓扑可视化方案。呈现结果表明NECB算法能在有效压缩网络拓扑规模的同时保存原始网络的主要信息,该方案能有效展现复杂网络拓扑的结构信息,为分析复杂网络提供支持。 For the problem that is difficult to observe the characteristics of the complex network topology by using the traditional network topology visualization algorithm,on the basis of presenting a network topology compression algorithm based on nodes and edge – NECB algorithm and FR algorithm which is an improved FDA algorithm,design and implement a scheme of complex network topology visualization through the network visualization software NetworkX. The results showthat the NECB algorithm is able to compress the network topology effectively and save the important information of the original network at the same time,while the scheme can effectively showthe characteristics of the complex network topology which supports the analysis of complex network.
出处 《计算机技术与发展》 2014年第12期78-82,87,共6页 Computer Technology and Development
基金 国家"863"高技术发展计划项目(2012AA01A510) "十二五"预研资助项目(2121211001050102)
关键词 复杂网络 NECB算法 FR算法 NetworkX 可视化 complex network NECB algorithm FR algorithm NetworkX visualization
  • 相关文献

参考文献11

  • 1Gilbert A C, Levchenko K. Compressing network graphs [ C ]// Proceedings of the LinkKDD workshop at the 10th ACM con- ference on KDD. [ s. 1. ] : [ s. n. ] ,2004.
  • 2Holten D, van Wijk J J. Force-directed edge bundling for graph visualization [ J ]. Computer Graphics Forum, 2009,28 (3) :983-990.
  • 3陈为,张嵩,鲁爱东.数据可视化的基本原理与方法[M].北京:科学出版社,2013.
  • 4Eades P. A heuristics for graph drawing [ J ]. Congressus Nu- merantium, 1989,42 : 146-160.
  • 5胡长爱,朱礼军.复杂网络软件分析与评价[J].数字图书馆论坛,2010(5):33-39. 被引量:8
  • 6Hagberg A A, Schuh D A, Swart P J. Exploring network struc- ture, dynamics, and function using NetworkX [ C ]//Proc of the 7th python in science conference. [ s. 1. ] : [ s. n. ] ,2008.
  • 7Fruchterman T M J, Reingold E M. Graph drawing by force- directed placement [ J ]. Software : Practice and Experience, 1991,21 ( 11 ) : 1129-1164.
  • 8Brandes U. On variants of shortest-path betweenness centralityand their generic computation [ J 1- Social Networks, 2008,30 (2) :136-145.
  • 9朱志良,林森,崔坤,于海.基于复杂网络社区划分的网络拓扑结构可视化布局算法[J].计算机辅助设计与图形学学报,2011,23(11):1808-1815. 被引量:25
  • 10杨博,刘大有,LIU Jiming,金弟,马海宾.复杂网络聚类方法[J].软件学报,2009,20(1):54-66. 被引量:207

二级参考文献99

  • 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.

共引文献246

同被引文献64

  • 1郑栓,程宁宁,郑建国.银花泌炎灵片联合头孢噻肟治疗急性肾盂肾炎的临床研究[J].现代药物与临床,2020,35(1):118-121. 被引量:7
  • 2周涛,柏文洁,汪秉宏,刘之景,严钢.复杂网络研究概述[J].物理,2005,34(1):31-36. 被引量:235
  • 3王柏,吴巍,徐超群,吴斌.复杂网络可视化研究综述[J].计算机科学,2007,34(4):17-23. 被引量:44
  • 4Barabási A L.Scale-free Networks:A Decade and Beyond[J].Science,2009,325(5939):412-413.
  • 5Watts D J,Strogatz S H.Collective Dynamics of‘Smallworld’Networks[J].Nature,1998,393(6684):440-442.
  • 6Eades P.A Heuristic for Graph Drawing[J].Congressus Nutnerantiunt,1984,42:149-160.
  • 7Kamada T,Kawai S.An Algorithm for Drawing General Undirected Graphs[J].Information Processing Letters,1989,31(1):7-15.
  • 8Fruchterman T M J,Reingold E M.Graph Drawing by Force-directed Placement[J].Software:Practice and Experience,1991,21(11):1129-1164.
  • 9Gilbert A C,Levchenko K.Compressing Network Graphs[C]//Proceedings of the 10th ACM Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2004.
  • 10Kitsak M,Gallos L K,Havlin S,et al.Identification of Influential Spreaders in Complex Networks[J].Nature Physics,2010,6(11):888-893.

引证文献8

二级引证文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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