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

07/18/2018
by   Robin Lamarche-Perrin, et al.
2

Graph compression is a data analysis technique that consists in the replacement of parts of a graph by more general structural patterns in order to reduce its description length. It notably provides interesting exploration tools for the study of real, large-scale, and complex graphs which cannot be grasped at first glance. This article proposes a framework for the compression of temporal graphs, that is for the compression of graphs that evolve with time. This framework first builds on a simple and limited scheme, exploiting structural equivalence for the lossless compression of static graphs, then generalises it to the lossy compression of link streams, a recent formalism for the study of temporal graphs. Such generalisation relies on the natural extension of (bidimensional) relational data by the addition of a third temporal dimension. Moreover, we introduce an information-theoretic measure to quantify and to control the information that is lost during compression, as well as an algebraic characterisation of the space of possible compression patterns to enhance the expressiveness of the initial compression scheme. These contributions lead to the definition of a combinatorial optimisation problem, that is the Lossy Multistream Compression Problem, for which we provide an exact algorithm.

READ FULL TEXT

page 6

page 10

page 11

page 26

research
12/07/2022

A Frequency-Structure Approach for Link Stream Analysis

A link stream is a set of triplets (t, u, v) indicating that u and v int...
research
11/25/2018

A multi-dimensional extension of the Lightweight Temporal Compression method

Lightweight Temporal Compression (LTC) is among the lossy stream compres...
research
10/14/2020

Data compression to choose a proper dynamic network representation

Dynamic network data are now available in a wide range of contexts and d...
research
07/01/2021

Data Deduplication with Random Substitutions

Data deduplication saves storage space by identifying and removing repea...
research
10/28/2021

Labeled sample compression schemes for complexes of oriented matroids

We show that the topes of a complex of oriented matroids (abbreviated CO...
research
08/22/2014

Designing labeled graph classifiers by exploiting the Rényi entropy of the dissimilarity representation

Representing patterns as labeled graphs is becoming increasingly common ...
research
05/14/2021

BernoulliZip: a Compression Algorithm for Bernoulli Processes and Erdos-Renyi Graphs

A novel compression scheme for compressing the outcome of n independent ...

Please sign up or login with your details

Forgot password? Click here to reset