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

Jianye Pang

dblp:251/5752 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-0009-2817ORCID · corroborated

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

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
ICDE1
2023 3D Shuffle-Mixer: An Efficient Context-Aware Vision Learner of Transformer-MLP Paradigm for Dense Prediction in Medical Volume
abstract
Dense prediction in medical volume provides enriched guidance for clinical analysis. CNN backbones have met bottleneck due to lack of long-range dependencies and global context modeling power. Recent works proposed to combine vision transformer with CNN, due to its strong global capture ability and learning capability. However, most works are limited to simply applying pure transformer with several fatal flaws (i.e., lack of inductive bias, heavy computation and little consideration for 3D data). Therefore, designing an elegant and efficient vision transformer learner for dense prediction in medical volume is promising and challenging. In this paper, we propose a novel 3D Shuffle-Mixer network of a new Local Vision Transformer-MLP paradigm for medical dense prediction. In our network, a local vision transformer block is utilized to shuffle and learn spatial context from full-view slices of rearranged volume, a residual axial-MLP is designed to mix and capture remaining volume context in a slice-aware manner, and a MLP view aggregator is employed to project the learned full-view rich context to the volume feature in a view-aware manner. Moreover, an Adaptive Scaled Enhanced Shortcut is proposed for local vision transformer to enhance feature along spatial and channel dimensions adaptively, and a CrossMerge is proposed to skip-connect the multi-scale feature appropriately in the pyramid architecture. Extensive experiments demonstrate the proposed model outperforms other state-of-the-art medical dense prediction methods.
Jianye Pang, Cheng Jiang 0001, Jianbo Chang, Ming Feng, Renzhi Wang 0002, Jianhua Yao 0001
IEEE Trans. Medical Imaging1