Yannis Velegrakis

Yannis Velegrakis

Auto-generated profile, based on publicly available information

Yannis Velegrakis

Utrecht University, Utrecht, Netherlands

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
20 April 2020
Verified
Conference Paper
Open access
MLMatteo Lissandrini
Matteo Lissandrini
DMDavide Mottin
Davide Mottin
TPThemis Palpanas
Themis Palpanas
YVYannis Velegrakis
Yannis Velegrakis
We consider the task of exploratory search through graph queries on knowledge graphs. We propose to assist the user by expanding the query with intuitive suggestions to provide a more informative (full) query that can retrieve more detailed and relevant answers. To achieve this result, we propose a model that can bridge graph search paradigms with well-established techniques for information-retrieval. Our approach does not require any additional knowledge from the user and builds on principled language modelling approaches. We empirically show the effectiveness and efficiency of our approach on a large knowledge graph and how our suggestions are able to help build more complete and informative queries.

1 September 2017 in Big Data Research
Verified
Journal Article
Closed access
SASabeur Aridhi
Sabeur Aridhi
AMAlberto Montresor
Alberto Montresor
YVYannis Velegrakis
Yannis Velegrakis

4 May 2016 in Journal on Data Semantics
Verified
Journal Article
Open access
PDF file
SBSonia Bergamaschi
Sonia Bergamaschi
DFDavide Ferrari
Davide Ferrari
FGFrancesco GUERRA
Francesco GUERRA
GSGiovanni Simonini
Giovanni Simonini
YVYannis Velegrakis
Yannis Velegrakis
A fundamental service for the exploitation of the modern large data sources that are available online is the ability to identify the topics of the data that they contain. Unfortunately, the heterogeneity and lack of centralized control makes it difficult to identify the topics directly from the actual values used in the sources. We present an approach that generates signatures of sources that are matched against a reference vocabulary of concepts through the respective signature to generate a description of the topics of the source in terms of this reference vocabulary. The reference vocabulary may be provided ready, may be created manually, or may be created by applying our signature-generated algorithm over a well-curated data source with a clear identification of topics. In our particular case, we have used DBpedia for the creation of the vocabulary, since it is one of the largest known collections of entities and concepts. The signatures are generated by exploiting the entropy and the mutual information of the attributes of the sources to generate semantic identifiers of the various attributes, which combined together form a unique signature of the concepts (i.e. the topics) of the source. The generation of the identifiers is based on the entropy of the values of the attributes; thus, they are independent of naming heterogeneity of attributes or tables. Although the use of traditional information-theoretical quantities such as entropy and mutual information is not new, they may become untrustworthy due to their sensitivity to overfitting, and require an equal number of samples used to construct the reference vocabulary. To overcome these limitations, we normalize and use pseudo-additive entropy measures, which automatically downweight the role of vocabulary items and property values with very low frequencies, resulting in a more stable solution than the traditional counterparts. We have materialized our theory in a system called WHATSIT and we experimentally demonstrate its effectiveness.

10 February 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
JMJakub Maciejewski
Jakub Maciejewski
KNKonstantinos Nikoletos
Konstantinos Nikoletos
GPGeorge Papadakis
George Papadakis
YVYannis Velegrakis
Yannis Velegrakis
Entity Resolution (ER) is typically implemented as a batch task that processes all available data before identifying duplicate records. However, applications with time or computational constraints, e.g., those running in the cloud, require a progressive approach that produces results in a pay-as-you-go fashion. Numerous algorithms have been proposed for Progressive ER in the literature. In this work, we propose a novel framework for Progressive Entity Matching that organizes relevant techniques into four consecutive steps: (i) filtering, which reduces the search space to the most likely candidate matches, (ii) weighting, which associates every pair of candidate matches with a similarity score, (iii) scheduling, which prioritizes the execution of the candidate matches so that the real duplicates precede the non-matching pairs, and (iv) matching, which applies a complex, matching function to the pairs in the order defined by the previous step. We associate each step with existing and novel techniques, illustrating that our framework overall generates a superset of the main existing works in the field. We select the most representative combinations resulting from our framework and fine-tune them over 10 established datasets for Record Linkage and 8 for Deduplication, with our results indicating that our taxonomy yields a wide range of high performing progressive techniques both in terms of effectiveness and time efficiency.


1 January 2009
Verified
Book Chapter
Closed access
PDF file
APAndrea Presa
Andrea Presa
YVYannis Velegrakis
Yannis Velegrakis
FRFlavio Rizzolo
Flavio Rizzolo
SBSiarhei Bykau
Siarhei Bykau