中心约束图嵌入
Centrality-constrained graph embedding
摘要:
图形的可视化绘制是复杂网络数据映射中的一项关键任务。虽然大多数图形绘制算法强调美学吸引力,但某些应用(如走时图)更重视结构网络属性的可视化。本文提出了一种考虑中心性的图嵌入方法,以符合节点层次结构。该问题被配制成一个约束多维缩放(MDS),它是通过块坐标下降迭代逐次逼近和保证收敛到KKT点。此外,一个正则化项强制执行图的平滑性与减少边缘交叉的目标。实验结果表明,该算法收敛性好,可以有效地嵌入数千个节点数量级的大型图。
英文摘要:
Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of structural network properties. The present paper advocates a graph embedding approach with centrality considerations to comply with node hierarchy. The problem is formulated as one of constrained multi-dimensional scaling (MDS), and it is solved via block coordinate descent iterations with successive approximations and guaranteed convergence to a KKT point. In addition, a regularization term enforcing graph smoothness is incorporated with the goal of reducing edge crossings. Experimental results demonstrate that the algorithm converges, and can be used to efficiently embed large graphs on the order of thousands of nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。