Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel Gomm
dblp:372/5784
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 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.
| Artificial intelligence
1 paper |
Trustworthy machine learning · 50% Graph learning · 50% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation |
0.9 | 1 | 2025 | CoDy: Counterfactual Explainers for Dynamic Graphs · ICML 2025 |
Machine learning › Graph learning › graph neural network
dynamic graph neural network |
0.9 | 1 | 2025 | CoDy: Counterfactual Explainers for Dynamic Graphs · ICML 2025 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | CoDy: Counterfactual Explainers for Dynamic Graphs · ICML 2025 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | CoDy: Counterfactual Explainers for Dynamic Graphs · ICML 2025 |
Algorithms and data structures › search algorithms
monte carlo tree search |
0.3 | 1 | 2025 | CoDy: Counterfactual Explainers for Dynamic Graphs · ICML 2025 |
Algorithms and data structures
search algorithms |
0.3 | 1 | 2025 | CoDy: Counterfactual Explainers for Dynamic Graphs · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
monte carlo tree search · 1.7heuristic selection · 1.7counterfactual explanation · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CoDy: Counterfactual Explainers for Dynamic GraphsabstractTemporal Graph Neural Networks (TGNNs) are widely used to model dynamic systems where relationships and features evolve over time. Although TGNNs demonstrate strong predictive capabilities in these domains, their complex architectures pose significant challenges for explainability. Counterfactual explanation methods provide a promising solution by illustrating how modifications to input graphs can influence model predictions. To address this challenge, we present CoDy—Counterfactual Explainer for Dynamic Graphs—a model-agnostic, instance-level explanation approach that identifies counterfactual subgraphs to interpret TGNN predictions. CoDy employs a search algorithm that combines Monte Carlo Tree Search with heuristic selection policies, efficiently exploring a vast search space of potential explanatory subgraphs by leveraging spatial, temporal, and local event impact information. Extensive experiments against state-of-the-art factual and counterfactual baselines demonstrate CoDy's effectiveness, with improvements of 16% in AUFSC+ over the strongest baseline. Our code is available at: https://github.com/daniel-gomm/CoDy Daniel Gomm, Michael Färber 0001 |
ICML | 2 |