arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.8420physics.soc-phphysics.bio-phphysics.data-an
收藏

一种用于网络可视化、有序化和粗粒度化的统一数据表示理论

A unified data representation theory for network visualization, ordering and coarse-graining

István A. Kovács, Réka Mizsei, Peter Csermely

摘要:

在过去的十年中,大数据集的表示成为许多科学学科的关键问题。网络可视化、数据排序和粗粒度的几种方法实现了这一目标。然而,没有一个基本的理论框架将这些问题联系起来。在这里,我们展示了一种优雅的信息理论数据表示方法,作为网络可视化,数据排序和粗粒度的统一解决方案。最佳表示是最难从原始数据矩阵中区分出来的,这是通过相对熵来衡量的。将网络节点表示为概率分布提供了一种有效的可视化方法,并且在一维中提供了网络节点和边的排序。输入网络的粗粒度表示实现了高效的数据压缩和分层可视化,以实现更大数据集的高质量表示。我们的统一数据表示理论将有助于分析广泛的数据集,通过揭示复杂网络的大尺度结构,在一个可理解的形式。

英文摘要:

Representation of large data sets became a key question of many scientific disciplines in the last decade. Several approaches for network visualization, data ordering and coarse-graining accomplished this goal. However, there was no underlying theoretical framework linking these problems. Here we show an elegant, information theoretic data representation approach as a unified solution of network visualization, data ordering and coarse-graining. The optimal representation is the hardest to distinguish from the original data matrix, measured by the relative entropy. The representation of network nodes as probability distributions provides an efficient visualization method and, in one dimension, an ordering of network nodes and edges. Coarse-grained representations of the input network enable both efficient data compression and hierarchical visualization to achieve high quality representations of larger data sets. Our unified data representation theory will help the analysis of extensive data sets, by revealing the large-scale structure of complex networks in a comprehensible form.

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

↑