Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Media (processing) and Interaction
A Study on Graph Similarity Search
Haichuan SHANGMasaru KITSUREGAWA
著者情報
ジャーナル フリー

2012 年 7 巻 4 号 p. 1565-1570

詳細
抄録

Graph similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical compounds. The problem is challenging as even testing subgraph containment between two graphs is NP-complete. Hence, existing techniques adopt the filtering-and-verification framework with the focus on developing effective and efficient techniques to remove non-promising graphs.
Nevertheless, existing filtering techniques may be still unable to effectively remove many “low” quality candidates. To resolve this, in this paper we propose a novel indexing technique to index graphs according to their “distances” to features. We then develop lower and upper bounding techniques that exploit the index to (1) prune non-promising graphs and (2) include graphs whose similarities are guaranteed to exceed the given similarity threshold. Considering that the verification phase is not well studied and plays the dominant role in the whole process, we devise efficient algorithms to verify candidates. A comprehensive experiment using real datasets demonstrates that our proposed methods significantly outperform existing methods.

著者関連情報
© 2012 The Database Society of Japan
前の記事 次の記事
feedback
Top