论文标题
基于双方，节点 - 链接和基于矩阵的网络表示的比较评估
Comparative Evaluation of Bipartite, Node-Link, and Matrix-Based Network Representations
论文作者
论文摘要
这项工作调查并比较了节点 - 链接图，邻接矩阵和两分点布局的性能，以可视化网络。在众包用户研究（n = 150）中，我们测量了不同网络类和属性的三个表示的任务准确性和完成时间。与文献相反，文献涵盖了小型数据集中主要是基于拓扑的任务（例如，路径查找），我们主要关注大型和有向网络的概述任务。我们考虑具有500个节点的网络上的三个概述任务：（T1）网络类标识，（T2）群集检测和（T3）网络密度估计，以及两个详细的任务：（T4）节点内度与级别和（T5）表示映射，分别为50个和20个节点。我们的结果表明，两分的布局有益于揭示整个网络结构，而邻接矩阵在不同任务中最可靠。
This work investigates and compares the performance of node-link diagrams, adjacency matrices, and bipartite layouts for visualizing networks. In a crowd-sourced user study (n = 150), we measure the task accuracy and completion time of the three representations for different network classes and properties. In contrast to the literature, which covers mostly topology-based tasks (e.g., path finding) in small datasets, we mainly focus on overview tasks for large and directed networks. We consider three overview tasks on networks with 500 nodes: (T1) network class identification, (T2) cluster detection, and (T3) network density estimation, and two detailed tasks: (T4) node in-degree vs. out-degree and (T5) representation mapping, on networks with 50 and 20 nodes, respectively. Our results show that bipartite layouts are beneficial for revealing the overall network structure, while adjacency matrices are most reliable across the different tasks.
