SLUGGER: Lossless Hierarchical Summarization of Massive Graphs
Overview
SLUGGER(
Scalable
Lossless S
ummarization of
Graphs with Hi
erarchy) is a lossless graph summarization algorithm for representing the input graph using our new model,
hierarchical graph summarization model.
SLUGGER is
- Effective yielding up to 29.6% more concise summary graph than state-of-the-art competitors
- Fast summarizing a graph with 0.8 billion edges in a few hours
- Scalable with the number of edges in the input graph
Paper
SLUGGER is described in the following paper:
-
SLUGGER: Lossless Hierarchical Summarization of Massive Graphs
Kyuhan Lee*, Jihoon Ko*, and Kijung Shin.
IEEE International Conference on Data Engineering 2022
[PDF] [Supplementary Document] [BIBTEX]
Code
The source code used in the paper is available.
[Github Repository]
Datasets
| Name |
#Nodes |
#Edges |
Description |
Source |
Download |
| CAIDA (CA) |
26,475 |
53,381 |
Internet |
SNAP |
Link |
| Ego-Facebook (FA) |
4,039 |
88,234 |
Social |
SNAP |
Link |
| Protein (PR) |
6,229 |
146,160 |
Protein Interaction |
KONECT |
Link |
| Email-Enron (EM) |
36,692 |
183,831 |
Email |
SNAP |
Link |
| DBLP (DB) |
317,080 |
1,049,866 |
Collaboration |
SNAP |
Link |
| Amazon0601 (AM) |
403,394 |
2,443,408 |
Co-purchase |
SNAP |
Link |
| CNR-2000 (CN) |
325,557 |
2,738,969 |
Hyperlinks |
LAW |
Link |
| Youtube (YO) |
1,134,890 |
2,987,624 |
Social |
SNAP |
Link |
| Skitter (SK) |
1,696,415 |
11,095,298 |
Internet |
SNAP |
Link |
| EU-05 (EU) |
862,664 |
16,138,468 |
Hyperlinks |
LAW |
Link |
| Eswiki-13 (ES) |
970,327 |
21,184,931 |
Social |
LAW |
Link |
| LiveJournal (LJ) |
3,997,962 |
34,681,189 |
Social |
SNAP |
Link |
| Hollywood (HO) |
1,985,306 |
114,492,816 |
Collaboration |
LAW |
Link |
| IC-04 (IC) |
7,414,758 |
150,984,819 |
Hyperlinks |
LAW |
Link |
| UK-02 (U2) |
18,483,186 |
261,787,258 |
Hyperlinks |
LAW |
Link |
| UK-05 (U5) |
39,454,463 |
783,027,125 |
Hyperlinks |
LAW |
Link |
People