Davide Mottin

Davide Mottin

Auto-generated profile, based on publicly available information

Davide Mottin

Aarhus University, Aarhus, Denmark

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018
Verified
Conference Paper
Open access
ATAnton Tsitsulin
Anton Tsitsulin
DMDavide Mottin
Davide Mottin
PKPanagiotis Karras
Panagiotis Karras
EMEmmanuel Müller
Emmanuel Müller

19 July 2018
Verified
Conference Paper
Open access
PDF file
ATAnton Tsitsulin
Anton Tsitsulin
DMDavide Mottin
Davide Mottin
PKPanagiotis Karras
Panagiotis Karras
ABAlexander Bronstein
Alexander Bronstein
EMEmmanuel Müller
Emmanuel Müller

18 July 2016 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
DMDavide Mottin
Davide Mottin
MLMatteo Lissandrini
Matteo Lissandrini
YVYannis Velegrakis
Yannis Velegrakis
TPThemis Palpanas
Themis Palpanas

1 January 2014 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
DMDavide Mottin
Davide Mottin
MLMatteo Lissandrini
Matteo Lissandrini
YVYannis Velegrakis
Yannis Velegrakis
TPThemis Palpanas
Themis Palpanas
Search engines are continuously employing advanced techniques that aim to capture user intentions and provide results that go beyond the data that simply satisfy the query conditions. Examples include the personalized results, related searches, similarity search, popular and relaxed queries. In this work we introduce a novel query paradigm that considers a user query as an example of the data in which the user is interested. We call these queries exemplar queries and claim that they can play an important role in dealing with the information deluge. We provide a formal specification of the semantics of such queries and show that they are fundamentally different from notions like queries by example, approximate and related queries. We provide an implementation of these semantics for graph-based data and present an exact solution with a number of optimizations that improve performance without compromising the quality of the answers. We also provide an approximate solution that prunes the search space and achieves considerably better time-performance with minimal or no impact on effectiveness. We experimentally evaluate the effectiveness and efficiency of these solutions with synthetic and real datasets, and illustrate the usefulness of exemplar queries in practice.

1 November 2019
Verified
Conference Paper
Closed access
TSTara Safavi
Tara Safavi
CBCaleb Belth
Caleb Belth
LFLukas Faber
Lukas Faber
DMDavide Mottin
Davide Mottin
EMEmmanuel Muller
Emmanuel Muller
DKDanai Koutra
Danai Koutra
The increasing scale of encyclopedic knowledge graphs (KGs) calls for summarization as a way to help users efficiently access and distill world knowledge. Motivated by the disparity between individuals' limited information needs and the massive scale of KGs, in this paper we propose a new problem called personalized knowledge graph summarization. The goal is to construct compact "personal summaries" of KGs containing only the facts most relevant to individuals' interests. Such summaries can be stored and utilized on-device, allowing individuals private, anytime access to the information that interests them most. We formalize the problem as one of constructing a sparse graph, or summary, that maximizes a user's inferred "utility" over a given KG, subject to a user-and device-specific constraint on the summary's size. To solve it, we propose GLIMPSE, a summarization framework that provides theoretical guarantees on the summary's utility and is linear in the number of edges in the KG. In an evaluation with real user queries to open-source, encyclopedic KGs of up to one billion triples, we show that GLIMPSE efficiently creates summaries that outperform strong baselines by up to 19% in query answering F1 score.

1 September 2013 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
DMDavide Mottin
Davide Mottin
AMAlice Marascu
Alice Marascu
SRSenjuti Basu Roy
Senjuti Basu Roy
GDGautam Das
Gautam Das
TPThemis Palpanas
Themis Palpanas
YVYannis Velegrakis
Yannis Velegrakis