Eleni Psaroudaki

Mrs. Eleni Psaroudaki

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
30 January 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
Dimitris FotakisDimitris Fotakis
Dimitris Fotakis
PPPanagiotis Patsilinakos
Panagiotis Patsilinakos
EPEleni Psaroudaki
Eleni Psaroudaki
MXMichalis Xefteris
Michalis Xefteris
In this work, we consider the problem of shape-based time-series clustering with the widely used Dynamic Time Warping (DTW) distance. We present a novel two-stage framework based on Sparse Gaussian Modeling. In the first stage, we apply Sparse Gaussian Process Regression and obtain a sparse representation of each time series in the dataset with a logarithmic (in the original length T) number of inducing data points. In the second stage, we apply k-means with DTW Barycentric Averaging (DBA) to the sparsified dataset using a generalization of DTW, which accounts for the fact that each inducing point serves as a representative of many original data points. The asymptotic running time of our Sparse Time-Series Clustering framework is Ω(T2/log2T) times faster than the running time of applying k-means to the original dataset because sparsification reduces the running time of DTW from Θ(T2) to Θ(log2T). Moreover, sparsification tends to smoothen outliers and particularly noisy parts of the original time series. We conduct an extensive experimental evaluation using datasets from the UCR Time-Series Classification Archive, showing that the quality of clustering computed by our Sparse Time-Series Clustering framework is comparable to the clustering computed by the standard k-means algorithm.

12 April 2026
Verified
Conference Paper
Open access
GKGeorgios Kaoukis
Georgios Kaoukis
IKIoannis-Aris Koufopoulos
Ioannis-Aris Koufopoulos
EPEleni Psaroudaki
Eleni Psaroudaki
DKDanae Pla Karidi
Danae Pla Karidi
EPEvaggelia Pitoura
Evaggelia Pitoura
PTPanayiotis Tsaparas
Panayiotis Tsaparas

26 June 2023 in arXiv
Verified
Preprint
Open access
PDF file
LKLoukas Kavouras
Loukas Kavouras
KTKonstantinos Tsopelas
Konstantinos Tsopelas
Giorgos GiannopoulosGiorgos Giannopoulos
Giorgos Giannopoulos
DSDimitris Sacharidis
Dimitris Sacharidis
EPEleni Psaroudaki
Eleni Psaroudaki
IEIoannis Z. Emiris
Ioannis Z. Emiris
In this work, we present Fairness Aware Counterfactuals for Subgroups (FACTS), a framework for auditing subgroup fairness through counterfactual explanations. We start with revisiting (and generalizing) existing notions and introducing new, more refined notions of subgroup fairness. We aim to (a) formulate different aspects of the difficulty of individuals in certain subgroups to achieve recourse, i.e. receive the desired outcome, either at the micro level, considering members of the subgroup individually, or at the macro level, considering the subgroup as a whole, and (b) introduce notions of subgroup fairness that are robust, if not totally oblivious, to the cost of achieving recourse. We accompany these notions with an efficient, model-agnostic, highly parameterizable, and explainable framework for evaluating subgroup fairness. We demonstrate the advantages, the wide applicability, and the efficiency of our approach through a thorough experimental evaluation of different benchmark datasets.

28 May 2026
Verified
Conference Paper
Open access
GKGeorgios Kaoukis
Georgios Kaoukis
IKIoannis-Aris Koufopoulos
Ioannis-Aris Koufopoulos
EPEleni Psaroudaki
Eleni Psaroudaki
DKDanae Pla Karidi
Danae Pla Karidi
EPEvaggelia Pitoura
Evaggelia Pitoura
PTPanayiotis Tsaparas
Panayiotis Tsaparas

29 May 2025 in Theory of Computing Systems
Verified
Journal Article
Open access
PDF file
Dimitris FotakisDimitris Fotakis
Dimitris Fotakis
AKAlkis Kalavasis
Alkis Kalavasis
EPEleni Psaroudaki
Eleni Psaroudaki
Label Ranking (LR) corresponds to the problem of learning a hypothesis that maps features to rankings over a finite set of labels. We adopt a nonparametric regression approach to LR and obtain theoretical performance guarantees for this fundamental practical problem. We introduce a generative model for Label Ranking, in noiseless and noisy nonparametric regression settings. In the noiseless setting, we focus on the computational aspects of the LR problem with full rankings and provide guarantees for time-efficient learning algorithms using decision trees and random forests in the high-dimensional regime. In the noisy setting, we consider the more general cases of LR with incomplete rankings from a statistical viewpoint and obtain sample complexity bounds using the One-Versus-One approach of multiclass classification. Lastly, we complement our theoretical contributions with experiments, aiming to understand how the input regression noise affects the observed output.