基于二分、节点链接和矩阵的网络表示法的比较评估
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。