Projects per year
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.
|Title of host publication||Proceedings of the ISWC 2018 Posters & Demonstrations, Industry and Blue Sky Ideas Tracks|
|Editors||Marieke Van Erp, Madha Atre, Vanessa Lopez, Kavitha Srinivas, Carolona Fortuna|
|Number of pages||4|
|Publisher||CEUR Workshop Proceedings|
|Publication date||1 Jan 2018|
|Publication status||Published - 1 Jan 2018|
|Event||2018 ISWC Posters and Demonstrations, Industry and Blue Sky Ideas Tracks, ISWC-P and D-Industry-BlueSky 2018 - Monterey, United States|
Duration: 8 Oct 2018 → 12 Oct 2018
|Conference||2018 ISWC Posters and Demonstrations, Industry and Blue Sky Ideas Tracks, ISWC-P and D-Industry-BlueSky 2018|
|Period||08/10/2018 → 12/10/2018|
|Series||CEUR Workshop Proceedings|
FingerprintDive into the research topics of 'Top-k diversification for path queries in knowledge graphs'. Together they form a unique fingerprint.
- 2 Finished
01/02/2015 → 31/10/2019