期刊文献+

一种基于层次化社团结构的网络可视化方法 被引量:1

A Network Visualization Method Based On Hierarchical Community Structure
下载PDF
导出
摘要 提出了一种基于层次化社团结构的可视化方法,首先利用Blondel快速算法将网络划分为层次化的社团结构,然后依次在不同层次的社团内部采用力导引算法和环状布局双重布局,并通过对阈值的设置实现了两种布局方法的自由切换。 This paper proposes a network visualization method based on hierarchical community structure. This paper uses the Blondel fast community method to divide network into multilevel communities, then inside each community use force directed algorithm and circle layout method to visualize the network. Also, this paper introduces a threshold value to travel between the two layout me- thods.
作者 谈煜 梁润鹏
出处 《微型电脑应用》 2012年第4期20-23,共4页 Microcomputer Applications
关键词 网络可视化 层次化 社团结构 力导引算法 环形布局 Network Visualization Hierarchical Structure Community Force Directed Algorithm Circle Layout
  • 相关文献

参考文献9

  • 1Battista G, Eades P, Tamassia R,Tollis I. Graph drawing: Algorithms for the visualization of graphs [M]. 1998, Prentice-Hall. Englewood Cliffs.
  • 2Eades P. A heuristic for graph drawing [J]. Congressus- Numerantum, 1984, 42: 149-160.
  • 3HadanyR,Harel D. A multi-scale algorithm for drawing graphs nicely [J]. Discrete Applied Mathematics, 2001, 113(1):3-21.
  • 4Quigley A, Eades P. FADE: graph drawing, clustering, and visualabstraction [J].Lecture Notes in Computer Science, 2000, 1984: 197-210.
  • 5Blondel V, Guillaume J,Lambiotte R,Lefebvre E. Fast unfolding of communities in large networks [J]. J. Stat. Mech., 2008, PI0008.
  • 6Fruchtemlan T, Reingold E. Graph drawing by force-directed placement [J]. Software - Practice & Expe- rience, 1991,21(11): 1129-1164.
  • 7Josh Barnes and Piet Hut. A hierarchical O(NlogN) fbrce calculation algorithm [J].Nature, 1986, 324:446-449.
  • 8Fortunato S. Community detection in graphs [J]. Physics Reports, 2010, 486:75-174.
  • 9Breitkreutz B, Stark C, Tyers M. Osprey: A network visualization system [J]. Genome Biology, 2003, 4(3): R22-0012.6.

同被引文献53

  • 1冉敏,李晓.知识点网络可视化表示的系统设计[J].江西广播电视大学学报,2005,23(3):64-66. 被引量:7
  • 2王柏,吴巍,徐超群,吴斌.复杂网络可视化研究综述[J].计算机科学,2007,34(4):17-23. 被引量:44
  • 3ErdOs P, R6nyi A. On random graphs I. Publ. Math. Debrecen, 1959, 6: 290-297.
  • 4Watts D J, Strogatz SH. Collective dynamics of 'small-world' networks. Nature, 1998, 393(6684): 440-442.
  • 5Barabtsi AL, Albert R. Emergence of scaling in random networks. Science, 1999, 286(5439): 509-512.
  • 6Strogatz SH. Exploring complex networks. Nature, 2001, 410(6825): 268-276.
  • 7Ahrned A, Dywer T, Hong SH, et al. Visualisation and analysis of large and complex scale-free networks. Proc. of the Seventh Joint Eurographics/IEEE VGTC Conference onVisualization. Switzerland. 2005. 239-246.
  • 8Eades E A heuristic for graph drawing. Congresses Numerantium, 1984, 42: 149-160.
  • 9Kamada T, Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters, 1989, 31(1): 7-15.
  • 10Fruchterman TMJ, Reingold EM. Graph drawing by force - directed placement. Software: Practice and Experience, 1991, 21(11): 1129-1164.

引证文献1

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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