Pith. sign in

REVIEW

iSummary: Workload-based, Personalized Summaries for Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.02934 v1 pith:RO4PBKRY submitted 2024-03-05 cs.DB

iSummary: Workload-based, Personalized Summaries for Knowledge Graphs

classification cs.DB
keywords approachsummariesknowledgepersonalizedconstructinggraphsmethodsavailable
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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 highquality personalized summaries. We present an algorithm with theoretical guarantees on the summarys quality linear in the number of queries available in the query log. We evaluate our approach using three realworld datasets and several baselines showing that our approach dominates other methods in terms of both quality and efficiency.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.