Top-k diversification for path queries in knowledge graphs

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

69 Downloads (Pure)

Abstract

To explore the relationships between entities in RDF graphs, property path queries were introduced in SPARQL 1.1. However, existing RDF engines return only reachability of the entities ignoring the intermediate nodes in the path. If the paths are output, they are too many, which makes it difficult for users to find the most relevant paths. To address this issue, we propose a generalized top-k ranking technique that balances the trade-off between relevance and diversity. We propose a shortest path based relevance scoring in combination with several path similarity measures for diversification. With preliminary experiments and examples, we show that our diversification strategies provide more novel paths as our technique prioritizes diversity over path length.

Original languageEnglish
Title of host publicationProceedings of the ISWC 2018 Posters & Demonstrations, Industry and Blue Sky Ideas Tracks
EditorsMarieke Van Erp, Madha Atre, Vanessa Lopez, Kavitha Srinivas, Carolona Fortuna
Number of pages4
PublisherCEUR Workshop Proceedings
Publication date1 Jan 2018
Publication statusPublished - 1 Jan 2018
Event2018 ISWC Posters and Demonstrations, Industry and Blue Sky Ideas Tracks, ISWC-P and D-Industry-BlueSky 2018 - Monterey, United States
Duration: 8 Oct 201812 Oct 2018

Conference

Conference2018 ISWC Posters and Demonstrations, Industry and Blue Sky Ideas Tracks, ISWC-P and D-Industry-BlueSky 2018
Country/TerritoryUnited States
CityMonterey
Period08/10/201812/10/2018
SeriesCEUR Workshop Proceedings
Volume2180
ISSN1613-0073

Fingerprint

Dive into the research topics of 'Top-k diversification for path queries in knowledge graphs'. Together they form a unique fingerprint.

Cite this