SSumM: Sparse Summarization of Massive Graphs
Kyuhan Lee, Hyeonsoo Jo, Jihoon Ko, Sungsu Lim, Kijung Shin
Abstract
Given a graph G and the desired size k in bits, how can we summarize G within k bits, while minimizing the information loss?
Topics & Concepts
Computer scienceAutomatic summarizationGraphArtificial intelligenceTheoretical computer scienceAlgorithmCombinatoricsGraph theoryMathematicsUpper and lower boundsTerm (time)Data miningFeature (linguistics)Graph Theory and AlgorithmsAdvanced Graph Neural NetworksComplex Network Analysis Techniques