iSummary: Workload-Based, Personalized Summaries for Knowledge Graphs

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The explosion in the size and the complexity of the available Knowledge Graphs on the web has led to the need for efficient and effective methods for their understanding and exploration. Semantic summaries have recently emerged as methods to quickly explore and understand the contents of various sources. However, in most cases, they are static, not incorporating user needs and preferences, and cannot scale. In this paper, we present iSummary, a novel, scalable approach for constructing personalized summaries. As the size and the complexity of the Knowledge Graphs for constructing personalized summaries prohibit efficient summary construction, in our approach we exploit query logs. The main idea behind our approach is to exploit knowledge captured in existing user queries for identifying the most interesting resources and linking them, constructing as such high-quality, personalized summaries. We present an algorithm with theoretical guarantees on the summary’s quality, linear in the number of queries available in the query log. We evaluate our approach using three real-world datasets and several baselines, showing that our approach dominates other methods in terms of both quality and efficiency.

Cite

CITATION STYLE

APA

Vassiliou, G., Alevizakis, F., Papadakis, N., & Kondylakis, H. (2023). iSummary: Workload-Based, Personalized Summaries for Knowledge Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13870 LNCS, pp. 192–208). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-33455-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free