Graph summarization based on attribute-connected network

S Liu, Q Zhao, J Li, W Rao - Web and Big Data: APWeb-WAIM 2017 …, 2017 - Springer
S Liu, Q Zhao, J Li, W Rao
Web and Big Data: APWeb-WAIM 2017 International Workshops: MWDA, HotSpatial …, 2017Springer
Techniques to summarize and cluster graphs are important to understand the structure and
pattern of large complex networks. State-of-art graph summarization techniques mainly
focus on either node attributes or graph topological structure. In this work, we introduce a
unified framework based on node attributes and topological structure to support attribute-
based summarization. We propose a summarizing method based on virtual links (node
attributes) and real links (topological structure) called Greedy Merge (GM) to aggregate …
Abstract
Techniques to summarize and cluster graphs are important to understand the structure and pattern of large complex networks. State-of-art graph summarization techniques mainly focus on either node attributes or graph topological structure. In this work, we introduce a unified framework based on node attributes and topological structure to support attribute-based summarization. We propose a summarizing method based on virtual links (node attributes) and real links (topological structure) called Greedy Merge (GM) to aggregate similar nodes into k non-overlapping attribute-connected groups. We adopt the Locality Sensitive Hashing (LSH) technique to construct virtual links for high efficiency. Experiments on real datasets indicate that our proposed method GM is both effective and efficient.
Springer
Showing the best result for this search. See all results