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

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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number13786
JournalScientific Reports
Volume5
DOIs
Publication statusPublished - Sep 8 2015

Fingerprint

Data visualization
Visualization
Data compression
Complex networks
Probability distributions
Entropy

ASJC Scopus subject areas

  • General

Cite this

A unified data representation theory for network visualization, ordering and coarse-graining. / Kovács, István A.; Mizsei, Réka; Csermely, P.

In: Scientific Reports, Vol. 5, 13786, 08.09.2015.

Research output: Contribution to journalArticle

@article{b930da58619d48d699219fe7ff32690e,
title = "A unified data representation theory for network visualization, ordering and coarse-graining",
abstract = "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.",
author = "Kov{\'a}cs, {Istv{\'a}n A.} and R{\'e}ka Mizsei and P. Csermely",
year = "2015",
month = "9",
day = "8",
doi = "10.1038/srep13786",
language = "English",
volume = "5",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",

}

TY - JOUR

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

AU - Kovács, István A.

AU - Mizsei, Réka

AU - Csermely, P.

PY - 2015/9/8

Y1 - 2015/9/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84941121481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941121481&partnerID=8YFLogxK

U2 - 10.1038/srep13786

DO - 10.1038/srep13786

M3 - Article

VL - 5

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

M1 - 13786

ER -