期刊文献+

嵌入社区半径的力引导与径向树混合布局算法 被引量:3

Community radius embedded in force-directed and radial tree hybrid layout algorithm
下载PDF
导出
摘要 力引导布局算法存在无法展示复杂网络社区结构的缺陷,虽引入聚类的方式来展示社区结构,但社区内节点拥挤且排列无序,不利于观察社区内节点的结构特征与连边关系,为此提出嵌入社区半径的力引导与径向树混合布局算法.该算法首先采用K-means算法对网络节点进行社区划分;然后,用社区内节点数量确定社区半径,并将社区半径嵌入到社区斥力、引力中来展示社区结构;最后,采用径向树布局分层可视化各社区内节点.实验中使用拥挤区域占比、点分布偏差、节点偏差等指标验证了本算法既能降低拥挤度又能减少节点布局偏差,可视化结果显示,本算法布局社区结构明显,节点层次分明,易于理解. Force-directed layout has a defect that can't display complex network community structure.Although cluster layout algorithm is introduced to visualize community structure,nodes in the community are crowded and disordered,which is not conducive to observing structural features and nodes connection relationship in the community.Therefore,community radius embedded in force-directed and radial tree hybrid layout algorithm is proposed.Firstly,the algorithm uses the K-means algorithm to divide the network nodes into community.Then,the community radius is determined by the number of nodes in each community,and the community radius is embedded into the repulsion and gravity to achieve the effect of cluster layout.Finally,radial tree layout is used for each community to hierarchically visualize the nodes within the community.In the experiment,crowed area ratio,point distribution deviation,node deviation and other indicators are used to show that the algorithm can reduce congestion and node layout deviation.Visual results demonstrate that layout structure of the algorithm is obvious,and nodes are clearly structured and easy to understand.
作者 任淑霞 吴涛 张书博 REN Shu-Xia;WU Tao;ZHANG Shu-Bo(Department of Computer Science and Software Engineering,Tianjin Polytechnic University,Tianjin 300387,China)
出处 《四川大学学报(自然科学版)》 CAS CSCD 北大核心 2020年第1期73-81,共9页 Journal of Sichuan University(Natural Science Edition)
基金 国家自然科学基金(61403278)
关键词 力引导布局算法 社区半径 径向树 混合布局 复杂网络 Force-directed layout algorithm Community radius Radial tree Hybrid layout Complex network
  • 相关文献

参考文献6

二级参考文献88

  • 1沈夏炯,马骏.一种新的概念格布局策略[J].河南大学学报(自然科学版),2006,36(3):101-104. 被引量:1
  • 2Carmel L, Harel D, Koren Y. Combining hierarchy and energy for drawing directed graphs [J]. IEEE Transactions on Visualization and Computer Graphics, 2004, 10(1): 46-57.
  • 3Kamada T, Kawai S. An algorithm for drawing general undirected graphs [J]. Information Processing Letters, 1989, 31(12) : 7-15.
  • 4Davidson R, Harel D. Drawing graphs nicely using simulated annealing[J]. ACM Transactions on Graphics, 1996, 15(4) : 301-331.
  • 5Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement [J]. Software-Practice and Experience, 1991, 21(11): 1129-1164.
  • 6Ingber L. Very fast simulated re-annealing[J]. Mathematical and Computer Modelling, 1989, 12(8): 967-973.
  • 7Frick A, Ludwig A, Mehldau H. A fast adaptive layout algorithm for undirected graphs[M]//Lecture Notes in Computer Science. Heidelberg: Springer, 1995, 894:388- 403.
  • 8Noack A. An energy model for visual graph clustering [M]//Lecture Notes in Computer Science. Heidelberg: Springer, 2004, 2912:425-436.
  • 9Gajer P, Kobourov S G. GRIP: graph drawing with intelligent placement [M]//Lecture Notes in Computer Science. Heidelberg: Springer, 2001, 1984:104-109.
  • 10Harel D, Koren Y. A fast multi scale method for drawing large graphs [M] //Lecture Notes in Computer Science. Heidelberg: Springer, 2001, 1984:235-287.

共引文献41

同被引文献29

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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