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

Yue Zixuan

dblp:399/4630 · DBLP profile ↗
← Back
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
Graph learning · 56% Video understanding and tracking · 44%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
dynamic graph neural network
0.912025
TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics · ICLR 2025
Computer vision › Video understanding and tracking › temporal modeling
sequential dynamics
0.912025
TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics · ICLR 2025
Machine learning › Graph learning
graph learning benchmark
0.312025
TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics · ICLR 2025

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

benchmark construction · 0.9
YearPublicationVenuePosition
2025 TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics
abstract
Future link prediction is a fundamental challenge in various real-world dynamic systems. To address this, numerous temporal graph neural networks (temporal GNNs) and benchmark datasets have been developed. However, these datasets often feature excessive repeated edges and lack complex sequential dynamics, a key characteristic inherent in many real-world applications such as recommender systems and "Who-To-Follow" on social networks. This oversight has led existing methods to inadvertently downplay the importance of learning sequential dynamics, focusing primarily on predicting repeated edges. In this study, we demonstrate that existing methods, such as GraphMixer and DyGFormer, are inherently incapable of learning simple sequential dynamics, such as "a user who has followed OpenAI and Anthropic is more likely to follow AI at Meta next." Motivated by this issue, we introduce the Temporal Graph Benchmark with Sequential Dynamics (TGB-Seq), a new benchmark carefully curated to minimize repeated edges, challenging models to learn sequential dynamics and generalize to unseen edges. TGB-Seq comprises large real-world datasets spanning diverse domains, including e-commerce interactions, movie ratings, business reviews, social networks, citation networks and web link networks. Benchmarking experiments reveal that current methods usually suffer significant performance degradation and incur substantial training costs on TGB-Seq, posing new challenges and opportunities for future research. TGB-Seq datasets, leaderboards, and example codes are available at https://tgb-seq.github.io/.
Lu Yi 0002, Jie Peng 0005, Yanping Zheng, Fengran Mo, Zhewei Wei, Yuhang Ye 0002, Yue Zixuan, Zengfeng Huang
ICLR7