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

Xiaofei Xiong

dblp:48/7647 · 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

Databases, data management, data science and information retrieval · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › dynamic graph learning
continuous-time dynamic graph
0.912025
DyFMVP: Say Goodbye to Staleness! Fresh Memory Vigorous Preserver for Continuous-Time Dynamic Graph · ICDE 2025
Machine learning › Graph learning
dynamic graph learning
0.912025
DyFMVP: Say Goodbye to Staleness! Fresh Memory Vigorous Preserver for Continuous-Time Dynamic Graph · ICDE 2025
Machine learning › Graph learning › dynamic graph learning
memory-based temporal graph neural networks
0.912025
DyFMVP: Say Goodbye to Staleness! Fresh Memory Vigorous Preserver for Continuous-Time Dynamic Graph · ICDE 2025

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

recurrent neural network · 0.9neural ordinary differential equation · 0.9attention mechanism · 0.9
YearPublicationVenuePosition
2025 DyFMVP: Say Goodbye to Staleness! Fresh Memory Vigorous Preserver for Continuous-Time Dynamic Graph
abstract
Continuous-time dynamic graphs (CTDG) composed of chronological events, arise in many real-world complex network applications with high dynamics. Memory-based temporal graph neural networks, due to capacity to update and retain historical node states, excel at capturing dynamic changes, handling long-term dependencies with better interpretability compared to memory-less methods. Despite the effectiveness, memory-based methods suffer from two fatal fundamental flaws (i.e. long-standing staleness and memory offline update time issues), which are usually overlooked by constraints of rigid assumptions in recent works. To address the above flaws, in this work, we propose a novel Dynamic Fresh Memory Vigorous Preserver named DyFMVP, a well-designed state-traceable dual memory architecture for efficient anti-staling representation learning. To eliminate staleness within memory, a continuous memory neural ordinary differential equation process (NDP) is proposed to model the underlying memory transition distribution, rejuvenating the memory to a fresh state. In addition, a history-augmented temporal graph attention is proposed to enhance neighbor aggregation in a history-aware manner. Furthermore, a time-aligning RNN-ODE (TARO) restarter is proposed to be offline updating-free and restart at any future timestamps flexibly. Extensive experiments on various downstream tasks demonstrate the primary model DyFMVP and restarter TARO significantly outperform other state-of-the-art CTDG methods by a large margin, while also exhibiting strong robustness against extreme sparsity and long-term interval. Our code has been available on GitHub11https://github.com/CrescentMoon3/icde2025DyFMVP.
Jianye Pang, Xinjie Zhu, Xiaofei Xiong
ICDE3