1. School of Information and Communication Engineering, Dalian Minzu University, Dalian 116600, China; 2. School of Journalism and Communication, Beijing Normal University, Beijing 100875, China
Abstract：This paper aims to address the problem that existing network visualization layout algorithms fail to fully consider the characteristics of connected edge symbols in symbolic networks. To this end, we propose a new algorithm to optimize the mechanism of inter-node forces by adjusting the node positions according to the connecting edge symbols by adjusting the node forces and considering the global equilibrium. Experimental results show that the algorithm can visualize the positive or negative relationships in the symbolic network and enhance users' understanding of the network topology. In addition, we propose new network layout aesthetics metrics to quantify the layout quality and effectively reduce the edge length bias and the number of edge crossings. This study provides new methods for visualizing symbolic networks and helps to deeply understand complex network structures.
曹阳, 许小可, 许爽. 针对符号网络的可视化布局算法[J]. 复杂系统与复杂性科学, 2026, 23(2): 1-7.
CAO Yang, XU Xiaoke, XU Shuang. A Visual Layout Algorithm for Signed Networks[J]. Complex Systems and Complexity Science, 2026, 23(2): 1-7.
[1] 水超, 陈涛, 李慧, 等. 基于力导向模型的网络图自动布局算法综述[J]. 计算机工程与科学, 2015, 37(3):457-465. SHUI C, Chen T, LI H, et al. Overview of automatic layout algorithms for network graphs based on force-directed models[J]. Computer Engineering and Science, 2015, 37(3):457-465. [2] EADES P. A heuristic for graph drawing[J]. Congressus Numerantium, 1984, 42(11): 149-160. [3] KAMADA T, KAWAI S. An algorithm for drawing general undirected graphs[J]. Information Processing Letters, 1989, 31:7-15. [4] FRUCHTERMAN T M J, REINGOLD E M. Graph drawing by force-directed placement[J]. Software Practice & Experience, 2010, 21(11):1129-1164. [5] 范磊, 张远. 社交网络分析中的图布局算法综述[J]. 信息与电脑(理论版), 2017(13):62-64. FAN L, ZHANG Y. Survey of graph layout algorithms in social network analysis[J]. Information and Computer (Theoretical Edition), 2017(13):62-64. [6] NOACK A. Energy models for graph clustering[J]. Journal of Graph Algorithms and Applications, 2007, 11(2):453-480. [7] JACOMY, Mathieu, et al. ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi softwar[J]. PLoS ONE, 2014, 9(6):e98679. [8] NEWMAN M E J, PEIXOTO T P. Generalized communities in networks[J]. Physical Review Letters, 2015,115(8):088701. [9] HUANG Z, WU J, ZHU W, et al. Visualizing complex networks by leveraging community structures[J]. Physica A: Statistical Mechanics and Its Applications, 2021, 565:125506. [10] 张铭娜, 肖婧, 许小可. 展示网络重叠社团结构的可视化布局算法[J]. 复杂系统与复杂性科学, 2023, 20(4):10-17. ZHANG M N, XIAO J, XU X K. A visual layout algorithm for displaying overlapping community structure of networks[J]. Complex Systems and Complexity Science, 2023, 20(4): 10-17. [11] 程苏琦, 沈华伟, 张国清, 等. 符号网络研究综述[J]. 软件学报, 2014, 25(1):15. CHENG S Q, SHEN H W, ZHANG G Q, et al. Survey of signed network research[J]. Journal of Software, 2014, 25(1):15. [12] MOONEY, GAVIN, PURCHASE. The multi-dimensional landscape of graph drawing metrics[C]//17th IEEE Pacific Visualization Symposium. Tokyo, Japan: IEEE, 2024:122-131. [13] 杨智翔, 许小可, 肖婧. 基于高阶信息局部策略的符号网络社区检测[J]. 西南大学学报(自然科学版), 2023, 45(8):31-47. YANG Z X, XU X K, XIAO J. Community detection in signed networks based on high-order information local strategy[J]. Journal of Southwest University(Natural Science), 2023, 45(8):31-47. [14] BREIGER R L, BOORMAN S A, Arabie P. An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling[J]. Journal of Mathematical Psychology, 1975, 12(3):328-383. [15] SEIDMAN S B. Structural models in anthropology[J]. SIAM Review, 1985, 27(2): 301-303. [16] KROPIVNIK S, MRVAR A. An analysis of the Slovene parliamentary parties network[J]. Metodološki Zvezki, 1996,12:209-216.
