Demo Data from EDBT 2026 / reviewers in the wild / expert
Yuxin Yang 0010
dblp:146/9561-10
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0008-1972-8372ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Artificial 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.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems › beyond-accuracy recommendation
long-tail recommendation |
1.0 | 1 | 2026 | SAGERec: Sampling and Gating for Enhanced Long-Tail Item Recommendations · WSDM 2026 |
Recommender systems › debiased recommendation
popularity bias mitigation |
1.0 | 1 | 2026 | SAGERec: Sampling and Gating for Enhanced Long-Tail Item Recommendations · WSDM 2026 |
Machine learning › Graph learning › graph neural network
dynamic graph neural network |
0.8 | 1 | 2024 | Towards Ideal Temporal Graph Neural Networks: Evaluations and Conclusions after 10,000 GPU Hours · Proc. VLDB Endow. 2024 |
Machine learning › Graph learning › graph sampling
neighbor sampling |
0.8 | 1 | 2024 | Towards Ideal Temporal Graph Neural Networks: Evaluations and Conclusions after 10,000 GPU Hours · Proc. VLDB Endow. 2024 |
Methods — techniques the papers use, named apart from their topics
sampling · 1.0gating · 1.0design space search · 0.8benchmarking · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SAGERec: Sampling and Gating for Enhanced Long-Tail Item RecommendationsabstractRecommendation systems are an integral part of daily life, influencing how people interact with and access information. The content recommended to users shapes their perceptions, making it crucial to eliminate biases that could negatively impact those perceptions. One such bias is the popularity bias which causes the long-tail item recommendation problem, where systems tend to favor popular items while overlooking less popular yet relevant ones. Abdulla Alshabanah, Yuxin Yang 0010, Murali Annavaram |
WSDM | 2 |
| 2024 | Towards Ideal Temporal Graph Neural Networks: Evaluations and Conclusions after 10,000 GPU HoursabstractTemporal Graph Neural Networks (TGNNs) have emerged as powerful tools for modeling dynamic interactions across various domains. The design space of TGNNs is notably complex, given the unique challenges in runtime efficiency and scalability raised by the evolving nature of temporal graphs. We contend that many of the existing works on TGNN modeling inadequately explore the design space, leading to suboptimal designs. Viewing TGNN models through a performance-focused lens often obstructs a deeper understanding of the advantages and disadvantages of each technique. Specifically, benchmarking efforts inherently evaluate models in their original designs and implementations, resulting in unclear accuracy comparisons and misleading runtime. To address these shortcomings, we propose a practical comparative evaluation framework that performs a design space search across well-known TGNN modules based on a unified, optimized code implementation. Using our framework, we make the first efforts towards addressing three critical questions in TGNN design, spending over 10,000 GPU hours: (1) investigating the efficiency of TGNN module designs, (2) analyzing how the effectiveness of these modules correlates with dataset patterns, and (3) exploring the interplay between multiple modules. Key outcomes of this directed investigative approach include demonstrating that the most recent neighbor sampling and attention aggregator outperform uniform neighbor sampling and MLP-Mixer aggregator; Assessing static node memory as an effective node memory alternative, and showing that the choice between static or dynamic node memory should be based on the repetition patterns in the dataset. Our in-depth analysis of the interplay between TGNN modules and dataset patterns should provide a deeper insight into TGNN performance along with potential research directions for designing more general and effective TGNNs. Yuxin Yang 0010, Rajgopal Kannan, Viktor Prasanna 0001 |
Proc. VLDB Endow. | 1 |