期刊文献+

基于节点相似度的力引导改进算法 被引量:3

Improved force-directed algorithm based on vertex similarity
下载PDF
导出
摘要 社团结构作为社会网络的一个重要特征,对社会网络的可视化结果应当尽可能真实地反映在高维空间中节点间的距离,进而体现社会网络的聚类情况。针对传统力引导算法存在的无法展示社会网络中社团结构信息的弊端,提出一种聚类效果更加突出的改进布局算法。首先,改进斥力受力公式,引入乘积因子;然后,基于节点间相似度定义增量相似度,再分别定义两个单调函数将增量相似度映射为弹簧原长与新增的斥力乘积因子,实现节点相似度信息的嵌入;最终,在不对社会网络提前进行社团划分的前提下仅通过布局便能展示其中的社团结构。实验结果表明,所提算法与传统力引导算法相比,在展示社会网络的聚簇性方面性能领先。 Community structure is an important feature of social networks. The visualization of social networks should reflect the distance between vertexes in high dimensional space as realistic as possible, and thus reflect the clustering of social networks. Aiming at the shortcomings of traditional force-directed algorithm which cannot show the information of community structure in social network, a more efficient layout algorithm with clustering effect was proposed. Firstly, the repulsive force formula was improved by introducing a multiplication factor. Next the incremental similarity based on the similarity between vertexes was defined, and then two monotone functions were defined that mapping the incremental similarity to the original length of the spring and the new repulsion multiplication factor. The improved algorithm shows the community structure without dividing a social network into communities in advance. The experimental results show that the proposed algorithm is better than the traditional force-directed algorithm in demonstrating the clustering of social networks.
出处 《计算机应用》 CSCD 北大核心 2017年第A02期214-218,224,共6页 journal of Computer Applications
基金 国家自然科学基金资助项目(61503312)
关键词 数据可视化 社会网络 社团结构 相似度 力引导算法 data visualization social network community structure similarity force-directed algorithm
  • 相关文献

参考文献4

二级参考文献45

  • 1解(亻刍),汪小帆.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学,2005,2(3):1-12. 被引量:86
  • 2张清国,叶俊民,张维,张连发.用遗传算法画无向图[J].计算机工程与科学,2006,28(6):58-61. 被引量:6
  • 3Carmel 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. 被引量:1
  • 4Kamada T, Kawai S. An algorithm for drawing general undirected graphs [J]. Information Processing Letters, 1989, 31(12) : 7-15. 被引量:1
  • 5Davidson R, Harel D. Drawing graphs nicely using simulated annealing[J]. ACM Transactions on Graphics, 1996, 15(4) : 301-331. 被引量:1
  • 6Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement [J]. Software-Practice and Experience, 1991, 21(11): 1129-1164. 被引量:1
  • 7Ingber L. Very fast simulated re-annealing[J]. Mathematical and Computer Modelling, 1989, 12(8): 967-973. 被引量:1
  • 8Frick 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. 被引量:1
  • 9Noack A. An energy model for visual graph clustering [M]//Lecture Notes in Computer Science. Heidelberg: Springer, 2004, 2912:425-436. 被引量:1
  • 10Gajer P, Kobourov S G. GRIP: graph drawing with intelligent placement [M]//Lecture Notes in Computer Science. Heidelberg: Springer, 2001, 1984:104-109. 被引量:1

共引文献34

同被引文献44

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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