header

Effective Searching of RDF Knowledge Graphs

24 Pages Posted: 27 Jun 2018 First Look: Accepted

See all articles by Hiba Arnaout

Hiba Arnaout

American University of Beirut - Department of Computer Science

Shady Elbassuoni

American University of Beirut - Department of Computer Science

Abstract

RDF knowledge graphs are typically searched using triple-pattern queries. Often, triple-pattern queries will return too many or too few results, making it difficult for users to find relevant answers to their information needs. To remedy this, we propose a general framework for effective searching of RDF knowledge graphs. Our framework extends both the searched knowledge graph and triple-pattern queries with keywords to allow users to form a wider range of queries. In addition, it provides result ranking based on statistical machine translation, and performs automatic query relaxation to improve query recall. Finally, we also define a notion of result diversity in the setting of RDF data and provide mechanisms to diversify RDF search results using Maximal Marginal Relevance. We evaluate the effectiveness of our retrieval framework using various carefully-designed user studies on DBpedia, a large and real-world RDF knowledge graph.

Keywords: RDF, Ranking, Diversity, Relaxation

Suggested Citation

Arnaout, Hiba and Elbassuoni, Shady, Effective Searching of RDF Knowledge Graphs (2018). Journal of Web Semantics First Look 48_0_4. Available at SSRN: https://ssrn.com/abstract=3199315 or http://dx.doi.org/10.2139/ssrn.3199315

Hiba Arnaout (Contact Author)

American University of Beirut - Department of Computer Science ( email )

PO Box 11-0236, Riad El Solh
Beirut
Lebanon

Shady Elbassuoni

American University of Beirut - Department of Computer Science ( email )

PO Box 11-0236, Riad El Solh
Beirut
Lebanon

Register to save articles to
your library

Register

Paper statistics

Abstract Views
302
Downloads
38