arrow
返回

Set-based approximate approach for lossless graph summarization

delete2015-04-28
delete24
PRE
AI
K
Kifayat Ullah Khan
W
Waqas Nawaz
Y
Young-Koo Lee *
DOI:10.1007/s00607-015-0454-9delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Graph summarization is valuable approach to analyze various real life phenomenon, like communities, influential nodes, and information flow in a big graph. To summarize a graph, nodes having similar neighbors are merged into super nodes and their corresponding edges are compressed into super edges. Existing methods find similar nodes either by nodes ordering or perform pairwise similarity computations. Compression-by-node ordering approaches are scalable but provide lesser compression due to exhaustive similarity computations of their counterparts. In this paper, we propose a novel set-based summarization approach that directly summarizes naturally occurring sets of similar nodes in a graph. Our approach is scalable since we avoid explicit similarity computations with non-similar nodes and merge sets of nodes in each iteration. Similarly, we provide good compression ratio as each set consists of highly similar nodes. To locate sets of similar nodes, we find candidate sets of similar nodes by using locality sensitive hashing. However, member nodes of every candidate set have varying similarities with each other. Therefore, we propose a heuristic based on similarity among degrees of candidate nodes, and a parameter-free pruning technique to effectively identify subset of highly similar nodes from candidate nodes. Through experiments on real world graphs, our approach requires lesser execution time than pairwise graph summarization, with margin of an order of magnitude in graphs containing nodes with highly diverse neighborhood, and produces summary at similar accuracy. Similarly, we observe comparable scalability against the compression-by-node ordering method, while providing better compression ratio.
Keyword:
Graph summarization
LSH
MDL
Degree similarity
Auto pruning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computing
IF:
2.8
论文数:
2.3K
被引数:
3.5K

机构

K
kyung hee university
学者数:
2.3W
论文数: 2.2W
被引数: 234
引用论文

引用论文

People-Place Narratives as Knowledge Typologies for Social Sustainability: Cases from Urban Contexts in the Global South
err
IF0
err2024-02-22
err0
errOAAI
errAshraf M. Salama; Madhavi P. Patil; Amira N. Elsemellawy; Huyam H. Abudib; Noor A. Almansor; Laura MacLean; Kristijn Van Riel
err分享
err收藏
err分享
err收藏
Zooming on the quantum critical point in Nd-LSCO
err2010-12-01
err0
errOAAI
errOlivier Cyr-Choinière; R. Daou; J. Chang; Francis Laliberté; Nicolas Doiron-Leyraud; David LeBoeuf; Y.J. Jo; L. Balicas; J.-Q. Yan; J.-G. Cheng; J.-S. Zhou; J.B. Goodenough; Louis Taillefer
err分享
err收藏
学者 查看更多内容