arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.4408stat.ML
收藏

基于中心性约束的嵌入图网络可视化

Embedding Graphs under Centrality Constraints for Network Visualization

Brian Baingana, Georgios B. Giannakis

摘要:

图形的可视化绘制是复杂网络数据映射中的一项关键任务。虽然大多数图形绘制算法强调美学吸引力,但某些应用(如走时图)更重视结构网络属性的可视化。本文提出了两种基于中心性的图嵌入方法,以满足节点层次结构的要求。该问题首先被制定为一个约束多维缩放(MDS),它是通过块坐标下降迭代与逐次逼近和保证收敛到KKT点来解决。此外,一个正则化项强制执行图的平滑性与减少边缘交叉的目标。第二种方法利用局部线性嵌入(LLE)算法,该算法假设图形编码从低维流形采样的数据。所得到的中心约束优化问题的封闭形式的解决方案,确定产生有意义的嵌入。实验结果证明了这两种方法的有效性,特别是对于可视化数千个节点的大型网络。

英文摘要:

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 two graph embedding approaches with centrality considerations to comply with node hierarchy. The problem is formulated first 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. A second approach leverages the locally-linear embedding (LLE) algorithm which assumes that the graph encodes data sampled from a low-dimensional manifold. Closed-form solutions to the resulting centrality-constrained optimization problems are determined yielding meaningful embeddings. Experimental results demonstrate the efficacy of both approaches, especially for visualizing large networks on the order of thousands of nodes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑