A Similarity-Oriented RDF Graph Matching Algorithm for Ranking Linked Data

Linked Data is an RDF-based transition from the document oriented Web into the Semantic Web, and the amount of data published as linked data steadily. Hence, The RDF graph matching algorithm becomes the technical foundation of many tasks in Semantic Web, such as semantic search, data fusion, ontology matching, data filter and dissemination. An RDF-graph-matching-based query can enables searching with additional semantic information, so that it can be utilized for obtaining expected ranking in semantic search and personalized information retrieval on the web of data. Yet, the need for this approach is disregarded. This paper proposes a novel similarity-oriented RDF graph matching approach for ranking linked data, which considering the element-level and structure-level similarity of statements, and also the similarity of URIs and blank nodes in RDF graphs. The efficiency of this approach is improved over the traditional RDF graph matching algorithm. And the effectiveness is improved by analyzing and measuring the structure-level similarity of statements. The experimental results shows that this approach can effectively measure the similarity between RDF graphs, and also returns results with respect to a query RDF graph as a ranked set of promising alternatives.

[1]  J. Euzenat,et al.  Ontology Matching , 2007, Springer Berlin Heidelberg.

[2]  Philip Resnik,et al.  Using Information Content to Evaluate Semantic Similarity in a Taxonomy , 1995, IJCAI.

[3]  Wei Jin,et al.  SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs , 2010, Proc. VLDB Endow..

[4]  Mark A. Musen,et al.  Anchor-PROMPT: Using Non-Local Context for Semantic Matching , 2001, OIS@IJCAI.

[5]  Dekang Lin,et al.  An Information-Theoretic Definition of Similarity , 1998, ICML.

[6]  Yun Peng,et al.  Finding and Ranking Knowledge on the Semantic Web , 2005, SEMWEB.

[7]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[8]  Jin Beihong,et al.  An Efficient Matching Algorithm for RDF Graph Patterns , 2005 .

[9]  Sören Auer,et al.  LIMES - A Time-Efficient Approach for Large-Scale Link Discovery on the Web of Data , 2011, IJCAI.

[10]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[11]  Gerhard Weikum,et al.  NAGA: Searching and Ranking Knowledge , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[12]  Dennis Shasha,et al.  Algorithmics and applications of tree and graph searching , 2002, PODS.

[13]  Jérôme Euzenat,et al.  Similarity-Based Ontology Alignment in OWL-Lite , 2004, ECAI.

[14]  Erhard Rahm,et al.  Generic Schema Matching with Cupid , 2001, VLDB.

[15]  Yong Yu,et al.  An Approach for Semantic Search by Matching RDF Graphs , 2002, FLAIRS.

[16]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[17]  Aidan Hogan,et al.  ReConRank: A Scalable Ranking Method for Semantic Web Data with Context , 2006 .

[18]  Jeremy J. Carroll,et al.  Matching RDF Graphs , 2002, SEMWEB.

[19]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[20]  Dan Brickley,et al.  Resource Description Framework (RDF) Model and Syntax Specification , 2002 .

[21]  Vagelis Hristidis,et al.  ObjectRank: a system for authority-based search on databases , 2006, SIGMOD Conference.

[22]  Erhard Rahm,et al.  Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.

[23]  Amit P. Sheth,et al.  SemRank: ranking complex relationship search results on the semantic web , 2005, WWW '05.