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

Agapi Rissaki

dblp:282/1363 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 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.

Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 50% Recommender systems · 50%
Artificial intelligence
2 papers
Learning paradigms · 42% Deep learning architectures and training · 42% Knowledge representation and reasoning · 16%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
explainable recommendation
1.012026
Database Views as Explanations for Relational Deep Learning · Proc. VLDB Endow. 2026
Machine learning and data management › relational machine learning
relational deep learning
1.012026
Database Views as Explanations for Relational Deep Learning · Proc. VLDB Endow. 2026
Machine learning › Deep learning architectures and training
loss function design
0.812024
Towards Unbiased Exploration in Partial Label Learning · J. Mach. Learn. Res. 2024
Machine learning › Learning paradigms › weakly supervised learning
partial label learning
0.812024
Towards Unbiased Exploration in Partial Label Learning · J. Mach. Learn. Res. 2024

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

relational deep learning · 2.0softmax classifier · 0.8gradient descent · 0.8
YearPublicationVenuePosition
2026 Database Views as Explanations for Relational Deep Learning
Agapi Rissaki, Ilias Fountalis, Wolfgang Gatterbauer, Benny Kimelfeld
Proc. VLDB Endow.1
2024 Towards Unbiased Exploration in Partial Label Learning
abstract
We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax as the final layer. We identify a bias phenomenon that can arise from the softmax layer in even simple architectures that prevents proper exploration of alternative options, making the dynamics of gradient descent overly sensitive to initialization. We introduce a novel loss function that allows for unbiased exploration within the space of alternative outputs. We give a theoretical justification for our loss function, and provide an extensive evaluation of its impact on synthetic data, on standard partially labelled benchmarks and on a contributed novel benchmark related to an existing rule learning challenge.
Zsolt Zombori, Agapi Rissaki, Kristóf Szabó, Wolfgang Gatterbauer, Michael Benedikt
J. Mach. Learn. Res.2