Data compression to choose a proper dynamic network representation

10/14/2020
by   Rémy Cazabet, et al.
0

Dynamic network data are now available in a wide range of contexts and domains. Several representation formalisms exist to represent dynamic networks, but there is no well-known method to choose one representation over another for a given dataset. In this article, we propose a method based on data compression to choose between three of the most important representations: snapshots, link streams and interval graphs. We apply the method on synthetic and real datasets to show the relevance of the method and its possible applications, such as choosing an appropriate representation when confronted to a new dataset, and storing dynamic networks in an efficient manner.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2018

Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations

Various graphs such as web or social networks may contain up to trillion...
research
07/18/2018

An Information-theoretic Framework for the Lossy Compression of Link Streams

Graph compression is a data analysis technique that consists in the repl...
research
01/30/2022

COIN++: Data Agnostic Neural Compression

Neural compression algorithms are typically based on autoencoders that r...
research
08/21/2023

LSCPM: communities in massive real-world Link Streams by Clique Percolation Method

Community detection is a popular approach to understand the organization...
research
05/10/2018

Deep Representation Learning for Domain Adaptation of Semantic Image Segmentation

Deep Convolutional Neural Networks have pushed the state-of-the art for ...
research
05/15/2019

Contrast Optimization And Local Adaptation (COALA) for HDR Compression

This paper develops a novel approach for high dynamic-range compression....

Please sign up or login with your details

Forgot password? Click here to reset