TY - JOUR
T1 - GSSC: Graph Summarization based on both Structure and Concepts
TT -
JF - itrcjrn
JO - itrcjrn
VL - 9
IS - 1
UR - http://ijict.itrc.ac.ir/article-1-47-en.html
Y1 - 2017
SP - 33
EP - 44
KW - Graph summarization
KW - super-node
KW - similarity
KW - conceptual summarization
KW - summary
N2 - In this paper, we propose a new method for graph summarization named GSSC, Graph Summarization based on both Structure and Concepts. In this method, an attributed graph is summarized by considering both of its topology and related concepts. In this method, for a given attributed graph a new graph is constructed that an edge in this new graph represents structural and conceptual similarity of its two end points. Structural and conceptual similarity of two nodes not necessarily has the equal amount of importance in the weight of the resulting edge. For example, for a special case such as query answering, structure can be more important and vice versa. Similarity of two nodes is computed based on Jaccard similarity. This method has some advantages such as flexibility, simplicity, learning capability, user-orientation that makes it a better method for graph summarization. We implemented our method and the method proposed by Bei and evaluated these two methods on real-life dataset HEP_TH. Our experimental results showed effectiveness and efficiency of our proposed method.
M3
ER -