کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
397472 | 671228 | 2011 | 15 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Structure and attribute index for approximate graph matching in large graphs Structure and attribute index for approximate graph matching in large graphs](/preview/png/397472.png)
The increasing popularity of graph data in various domains has lead to a renewed interest in developing efficient graph matching techniques, especially for processing large graphs. In this paper, we study the problem of approximate graph matching in a large attributed graph. Given a large attributed graph and a query graph, we compute a subgraph of the large graph that best matches the query graph. We propose a novel structure-aware and attribute-aware index to process approximate graph matching in a large attributed graph. We first construct an index on the similarity of the attributed graph, by partitioning the large search space into smaller subgraphs based on structure similarity and attribute similarity. Then, we construct a connectivity-based index to give a concise representation of inter-partition connections. We use the index to find a set of best matching paths. From these best matching paths, we compute the best matching answer graph using a greedy algorithm. Experimental results on real datasets demonstrate the efficiency of both index construction and query processing. We also show that our approach attains high-quality query answers.
► A formal definition of approximate graph matching query problem.
► A structure-aware and attribute-aware indexing approach.
► An efficient tool for approximate graph matching query over massive real-life graphs.
► Extensive experimental study.
Journal: Information Systems - Volume 36, Issue 6, September 2011, Pages 958–972