Utility-Based Graph Summarization: New and Improved
Mahdi Hajiabadi, Jasbir Singh, Venkatesh Srinivasan, Alex Thomo

TL;DR
This paper introduces scalable, utility-preserving graph summarization techniques that enable lossless and lossy compression, supporting efficient querying on web-scale graphs with minimal utility loss and no need for graph reconstruction.
Contribution
It proposes a novel utility-driven graph summarization method with superior compression and speed, and scalable algorithms for lossy summarization that handle web-scale graphs on a single machine.
Findings
Lossless summarization achieves better compression than state-of-the-art.
Lossy summarization is scalable and handles web-scale graphs efficiently.
Summaries support direct query answering without graph reconstruction.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Data Management and Algorithms · Advanced Graph Neural Networks
