An approach for approximate subgraph matching in fuzzy RDF graph

Abstract

Subgraph pattern matching is important for a wide variety of applications such as social network analysis and knowledge discovery. Despite extensive research over the past few decades, subgraph pattern matching is still challenging, especially when it comes with new conditions and constraints. In this paper, we tackle the problem of answering queries on fuzzy RDF data graphs. Specifically, we model RDF data by fuzzy graphs, and an RDF query is equivalent to a search over subgraphs of fuzzy graphs that have high possibility to match with a given query graph. After establishing a path-based RDF graph indexing, we give an efficient approximate subgraph matching algorithm which consists of three main steps: decomposing the query graph into a set of paths, obtaining a set of candidates for every path in the decomposition, and joining the candidate paths together to build the answers of the query graph by the k-partition intersection graph. Finally, a comprehensive experimental evaluation demonstrates the effectiveness of the proposed measure.