Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Angeliki Dimitriou

dblp:367/3837 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Trustworthy machine learning · 56% Graph learning · 44%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph autoencoder
0.912025
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval · ICML 2025
Machine learning › Graph learning › graph representation learning
unsupervised graph representation learning
0.912025
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval · ICML 2025
Multimedia analysis and retrieval
image retrieval
0.912025
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval · ICML 2025
Machine learning › Trustworthy machine learning › interpretability
concept-based explanation
0.812024
Structure Your Data: Towards Semantic Graph Counterfactuals · ICML 2024
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation
0.812024
Structure Your Data: Towards Semantic Graph Counterfactuals · ICML 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Structure Your Data: Towards Semantic Graph Counterfactuals · ICML 2024
Machine learning › Trustworthy machine learning
robustness
0.312025
Bias Beware: The Impact of Cognitive Biases on LLM-Driven Product Recommendations · EMNLP 2025
Machine learning › Graph learning
graph neural network
0.212024
Structure Your Data: Towards Semantic Graph Counterfactuals · ICML 2024

Methods — techniques the papers use, named apart from their topics

graph neural network · 2.5graph edit distance · 2.5cognitive biases · 1.7black-box adversarial strategies · 1.7
YearPublicationVenuePosition
2025 Bias Beware: The Impact of Cognitive Biases on LLM-Driven Product Recommendations
abstract
The advent of Large Language Models (LLMs) has revolutionized product recommenders, yet their susceptibility to adversarial manipulation poses critical challenges, particularly in realworld commercial applications.Our approach is the first one to tap into human psychological principles, seamlessly modifying product descriptions, making such manipulations hard to detect.In this work, we investigate cognitive biases as black-box adversarial strategies, drawing parallels between their effects on LLMs and human purchasing behavior.Through extensive evaluation across models of varying scale, we find that certain biases, such as social proof, consistently boost product recommendation rate and ranking, while others, like scarcity and exclusivity, surprisingly reduce visibility.Our results demonstrate that cognitive biases are deeply embedded in state-of-the-art LLMs, leading to highly unpredictable behavior in product recommendations and posing significant challenges for effective mitigation. 1
Giorgos Filandrianos, Angeliki Dimitriou, Maria Lymperaiou, Konstantinos Thomas, Giorgos B. Stamou
EMNLP2
2025 SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval
abstract
Despite the dominance of convolutional and transformer-based architectures in image-to-image retrieval, these models are prone to biases arising from low-level visual features, such as color. Recognizing the lack of semantic understanding as a key limitation, we propose a novel scene graph-based retrieval framework that emphasizes semantic content over superficial image characteristics. Prior approaches to scene graph retrieval predominantly rely on supervised Graph Neural Networks (GNNs), which require ground truth graph pairs driven from image captions. However, the inconsistency of caption-based supervision stemming from variable text encodings undermine retrieval reliability. To address these, we present SCENIR, a Graph Autoencoder-based unsupervised retrieval framework, which eliminates the dependence on labeled training data. Our model demonstrates superior performance across metrics and runtime efficiency, outperforming existing vision-based, multimodal, and supervised GNN approaches. We further advocate for Graph Edit Distance (GED) as a deterministic and robust ground truth measure for scene graph similarity, replacing the inconsistent caption-based alternatives for the first time in image-to-image retrieval evaluation. Finally, we validate the generalizability of our method by applying it to unannotated datasets via automated scene graph generation, while substantially contributing in advancing state-of-the-art in counterfactual image retrieval. The source code is available at https://github.com/nickhaidos/scenir-icml2025.
Nikolaos Chaidos, Angeliki Dimitriou, Maria Lymperaiou, Giorgos B. Stamou
ICML2
2024 Structure Your Data: Towards Semantic Graph Counterfactuals
abstract
Counterfactual explanations (CEs) based on concepts are explanations that consider alternative scenarios to understand which high-level semantic features contributed to particular model predictions. In this work, we propose CEs based on the semantic graphs accompanying input data to achieve more descriptive, accurate, and human-aligned explanations. Building upon state-of-the-art (SotA) conceptual attempts, we adopt a model-agnostic edit-based approach and introduce leveraging GNNs for efficient Graph Edit Distance (GED) computation. With a focus on the visual domain, we represent images as scene graphs and obtain their GNN embeddings to bypass solving the NP-hard graph similarity problem for all input pairs, an integral part of CE computation process. We apply our method to benchmark and real-world datasets with varying difficulty and availability of semantic annotations. Testing on diverse classifiers, we find that our CEs outperform previous SotA explanation models based on semantics, including both white and black-box as well as conceptual and pixel-level approaches. Their superiority is proven quantitatively and qualitatively, as validated by human subjects, highlighting the significance of leveraging semantic edges in the presence of intricate relationships. Our model-agnostic graph-based approach is widely applicable and easily extensible, producing actionable explanations across different contexts. The code is available at https://github.com/aggeliki-dimitriou/SGCE.
Angeliki Dimitriou, Maria Lymperaiou, Giorgos Filandrianos, Konstantinos Thomas, Giorgos B. Stamou
ICML1