Dimitris Sacharidis
Dimitris Sacharidis
Home
Research
Publications
Posts
Courses
Contact
Featured
HYPPO - Using Equivalences to Optimize Pipelines in Exploratory Machine Learning
We propose HYPPO, a novel system to optimize pipelines encountered in exploratory machine learning. HYPPO exploits alternative computational paths of artifacts from past executions to derive better execution plans while reusing materialized artifacts.
Antonios Kontaxakis
,
Dimitris Sacharidis
,
Alkis Simitsis
,
Alberto Abelló
,
Sergi Nadal
PDF
Cite
Code
Rank A*
Mitigating Data Sparsity in Integrated Data through Text Conceptualization
We propose THOR a novel method to extract information from text, that unlike related approaches, neither relies on complex rules nor models trained with large annotated corpus. Instead, THOR is lightweight and exploits integrated data and its schema without the need for human annotations.
Md Ataur Rahman
,
Sergi Nadal
,
Oscar Romero
,
Dimitris Sacharidis
PDF
Cite
Code
Rank A*
Auditing for Spatial Fairness
In many cases, it is important to ensure that a model does not discriminate against individuals on the basis of their location (place of origin, home address, etc.). We consider location as the protected attribute and we want the algorithm to exhibit spatial fairness For example, consider a model that predicts whether mortgage loan applications are accepted.
Dimitris Sacharidis
,
Giorgos Giannopoulos
,
George Papastefanatos
,
Kostas Stefanidis
PDF
Cite
Code
Slides
DOI
arXiv
URL
Rank A
Fairness Aware Counterfactuals for Subgroups
We propose novel fairness definitions concerning algorithmic recourse. For an individual that receives an undesirable outcome (e.g., loan application rejected), recourse is a way to reverse the outcome (e.g., increase down payment).
Loukas Kavouras
,
Konstantinos Tsopelas
,
Giorgos Giannopoulos
,
Dimitris Sacharidis
,
Eleni Psaroudaki
,
Nikolaos Theologitis
,
Dimitrios Rontogiannis
,
Dimitris Fotakis
,
Ioannis Z. Emiris
PDF
Cite
Code
DOI
arXiv
URL
Rank A*
Assessing Research Impact by Leveraging Open Scholarly Knowledge Graphs
Tutorial at The Web Conference 2022
Ilias Kanellos
,
Dimitris Sacharidis
,
Thanasis Vergoulis
Project
Slides
Video
DOI
URL
Rank A*
TokenJoin: Efficient Filtering for Set Similarity Join with Maximum Weighted Bipartite Matching
We propose TokenJoin, a method for linking complex records, i.e., identifying similar pairs among a collection of complex records. A complex record is a set of simpler text entities, such as a set of addresses.
Alexandros Zeakis
,
Dimitrios Skoutas
,
Dimitris Sacharidis
,
Odysseas Papapetrou
,
Manolis Koubarakis
PDF
Cite
Code
DOI
Rank A*
Model-Agnostic Counterfactual Explanations of Recommendations
We develop a post-hoc, model-agnostic explanation mechanism for recommender systems. It returns counterfactual explanations defined as those minimal changes to the user’s interaction history that would result in the system not making the recommendation that is to be explained.
Vassilis Kaffes
,
Dimitris Sacharidis
,
Giorgos Giannopoulos
PDF
Cite
Code
Slides
Video
DOI
URL
Ranking Papers by their Short-Term Scientific Impact
Ilias Kanellos
,
Thanasis Vergoulis
,
Dimitris Sacharidis
,
Theodore Dalamagas
,
Yannis Vassiliou
PDF
Cite
Slides
Video
DOI
URL
Rank A*
Building User Trust in Recommendations via Fairness and Explanations
Dimitris Sacharidis
PDF
Cite
Slides
Video
DOI
URL
Cite
×