On compressing weighted time-evolving graphs

Authors:
Wei Liu;Andrey Kan;Jeffrey Chan;James Bailey;Christopher Leckie;Jian Pei;Ramamohanarao Kotagiri
Affiliations:
The University of Melbourne, Melbourne, Australia;The University of Melbourne, Melbourne, Australia;The University of Melbourne, Melbourne, Australia;The University of Melbourne, Melbourne, Australia;The University of Melbourne, Melbourne, Australia;Simon Fraser University, Burnaby, Canada;The University of Melbourne, Melbourne, Australia
Venue:
Proceedings of the 21st ACM international conference on Information and knowledge management
Year:
2012

Citing 6
Cited 0

Arithmetic coding for data compression

Communications of the ACM
Graph summarization with bounded error

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms

Journal of Classification
Neighbor query friendly compression of social networks

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Network Simplification with Minimal Loss of Connectivity

ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Compression of weighted graphs

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing graph compression techniquesmostly focus on static graphs. However for many practical graphs such as social networks the edge weights frequently change over time. This phenomenon raises the question of how to compress dynamic graphs while maintaining most of their intrinsic structural patterns at each time snapshot. In this paper we show that the encoding cost of a dynamic graph is proportional to the heterogeneity of a three dimensional tensor that represents the dynamic graph. We propose an effective algorithm that compresses a dynamic graph by reducing the heterogeneity of its tensor representation, and at the same time also maintains a maximum lossy compression error at any time stamp of the dynamic graph. The bounded compression error benefits compressed graphs in that they retain good approximations of the original edge weights, and hence properties of the original graph (such as shortest paths) are well preserved. To the best of our knowledge, this is the first work that compresses weighted dynamic graphs with bounded lossy compression error at any time snapshot of the graph.