Utility-Based Graph Summarization: New and Improved

by   Mahdi Hajiabadi, et al.

A fundamental challenge in graph mining is the ever-increasing size of datasets. Graph summarization aims to find a compact representation resulting in faster algorithms and reduced storage needs. The flip side of graph summarization is the loss of utility which diminishes its usability. The key questions we address in this paper are: (1)How to summarize a graph without any loss of utility? (2)How to summarize a graph with some loss of utility but above a user-specified threshold? (3)How to query graph summaries without graph reconstruction? We also aim at making graph summarization available for the masses by efficiently handling web-scale graphs using only a consumer-grade machine. Previous works suffer from conceptual limitations and lack of scalability. In this work, we make three key contributions. First, we present a utility-driven graph summarization method, based on a clique and independent set decomposition, that produces significant compression with zero loss of utility. The compression provided is significantly better than state-of-the-art in lossless graph summarization, while the runtime is two orders of magnitude lower. Second, we present a highly scalable algorithm for the lossy case, which foregoes the expensive iterative process that hampers previous work. Our algorithm achieves this by combining a memory reduction technique and a novel binary-search approach. In contrast to the competition, we are able to handle web-scale graphs in a single machine without a performance impediment as the utility threshold (and size of summary) decreases. Third, we show that our graph summaries can be used as-is to answer several important classes of queries, such as triangle enumeration, Pagerank, and shortest paths. This is in contrast to other works that incrementally reconstruct the original graph for answering queries, thus incurring additional time costs.



There are no comments yet.


page 1

page 2

page 3

page 4


A Neighborhood-preserving Graph Summarization

We introduce in this paper a new summarization method for large graphs. ...

SSumM: Sparse Summarization of Massive Graphs

Given a graph G and the desired size k in bits, how can we summarize G w...

Incremental Lossless Graph Summarization

Given a fully dynamic graph, represented as a stream of edge insertions ...

Are Edge Weights in Summary Graphs Useful? – A Comparative Study

Which one is better between two representative graph summarization model...

Scalable Approximation Algorithm for Graph Summarization

Massive sizes of real-world graphs, such as social networks and web grap...

Graph Summarization

The continuous and rapid growth of highly interconnected datasets, which...

SsAG: Summarization and sparsification of Attributed Graphs

We present SSAG, an efficient and scalable method for computing a lossy ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.