%0 Journal Article %1 khan2015setbased %A Khan, Kifayat Ullah %A Nawaz, Waqas %A Lee, Young-Koo %D 2015 %J Computing %K citation fca graph summarization visualization %N 12 %P 1185--1207 %R 10.1007/s00607-015-0454-9 %T Set-based approximate approach for lossless graph summarization %U https://doi.org/10.1007/s00607-015-0454-9 %V 97 %X 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.

@article{khan2015setbased, abstract = {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.}, added-at = {2020-05-01T08:46:34.000+0200}, author = {Khan, Kifayat Ullah and Nawaz, Waqas and Lee, Young-Koo}, biburl = {https://www.bibsonomy.org/bibtex/217bee099fda1ce5f5640730d58eb0eef/jaeschke}, day = 01, doi = {10.1007/s00607-015-0454-9}, interhash = {76ab65ceba4da90cfd01096a6ab4f209}, intrahash = {17bee099fda1ce5f5640730d58eb0eef}, issn = {1436-5057}, journal = {Computing}, keywords = {citation fca graph summarization visualization}, month = dec, number = 12, pages = {1185--1207}, timestamp = {2020-05-01T08:46:34.000+0200}, title = {Set-based approximate approach for lossless graph summarization}, url = {https://doi.org/10.1007/s00607-015-0454-9}, volume = 97, year = 2015 }