EDBT 2026 Demo / reviewers in the wild / expert
Yanjun Qin
dblp:210/3849
· DBLP profile ↗
8ranked-venue papers in the field
3as first author
8since 2021 · last 2026
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Other / Interdisciplinary · 3 (1 first)Database Systems & Data Management · 2Information Retrieval & Web Search · 2 (1 first)Knowledge Engineering, Semantic Web & Information Systems · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | STEP: Stable Gradient Projection for Continual LearningabstractContinual learning (CL) aims to enable networks to learn continuously from sequentially arriving task streams while avoiding catastrophic forgetting (CF) of previously learned tasks. In recent years, Orthogonal gradient projection (OGP)-based CL methods have garnered significant attention from the research community due to their remarkable performance. However, existing OGP approaches overlook two critical issues: (1) representation matrices are typically constructed via random sampling, which introduces misclassified and class-imbalanced samples into the projection basis, contaminating important gradient directions and degrading stability; and (2) task-specific output scale variations induce domain drift, resulting in projection bias that weakens orthogonal constraints across tasks. To address these limitations, we propose Stable Gradient Projection for Continual Learning (STEP), a plug-and-play enhancement framework for OGP-based CL that integrates Correctness-aware Balanced Sampling (CBS) to construct purified and class-balanced projection subspaces using only correctly classified samples, and Sigmoid Attention Constraint (SAC) to enforce consistent output scaling via a sigmoid-based gating mechanism, thereby mitigating scale-induced projection bias. Extensive experiments on Split CIFAR-100, CIFAR-100 Superclass, and 5-Datasets demonstrate that STEP consistently improves state-of-the-art OGP methods, achieving up to +1.4% average accuracy (ACC) gains on Split CIFAR-100, improving backward transfer (BWT) from − 0.37 to − 0.09 for GPM and from − 1.06 to − 0.73 for SGP, and attaining 93.28% ACC with positive BWT (0.17) on 5-Datasets. These results validate STEP as a simple yet effective strategy for enhancing stability–plasticity balance in OGP-based CL. Longlong Zhai, Jiao Tian, Yanjun Qin, Shaochen Jiang, Chong Peng 0001, Panpan Zheng |
ICMR | 5 |
| 2025 | A diffusion-based feature enhancement approach for driving behavior classification with EEG data
Yanjun Qin, Shanghang Zhang, Xiaoming Tao 0001 |
Adv. Eng. Informatics | 2 |
| 2024 | STWave$^+$+: A Multi-Scale Efficient Spectral Graph Attention Network With Long-Term Trends for Disentangled Traffic Flow ForecastingabstractTraffic forecasting is crucial for public safety and resource optimization, yet is very challenging due to the temporal changes and the dynamic spatial correlations. To capture these intricate dependencies, spatio-temporal networks, such as recurrent neural networks with graph convolution networks, are applied. However, traffic forecasting is still a non-trivial task because of three major challenges: 1) Previous spatio-temporal networks are based on end-to-end training and thus fail to handle the distribution shift in the non-stationary traffic time series. 2) Existing methods always utilize the one-hour input to forecast future traffic and the long-term historical trend knowledge is ignored. 3) The efficient and effective algorithm for modeling multi-scale spatial correlations is still lacking in prior networks. Therefore, in this paper, rather than proposing yet another end-to-end model, we provide a novel disentangle-fusion framework STWave+to mitigate the distribution shift issue. The framework first decouples the complex one-hour traffic data into stable trends and fluctuating events, followed by a dual-channel spatio-temporal network to model trends and events, respectively. Moreover, long-term trends are used as a self-supervised signal in STWave+to teach overall temporal information into one-hour trends through a contrastive loss. Finally, reasonable future traffic can be predicted through the adaptive fusion of one-hour trends and events. Additionally, we incorporate a novel query sampling strategy and multi-scale graph wavelet positional encoding into the full graph attention network to efficiently and effectively model dynamic hierarchical spatial correlations. Extensive experiments on four traffic datasets show the superiority of our approach,i.e., the higher forecasting accuracy with lower computational cost. Yuchen Fang 0001, Yanjun Qin, Haiyong Luo, Fang Zhao 0003, Kai Zheng 0001 |
IEEE Trans. Knowl. Data Eng. | 2 |
| 2023 | When Spatio-Temporal Meet Wavelets: Disentangled Traffic Forecasting via Efficient Spectral Graph Attention NetworksabstractTraffic forecasting is crucial for public safety and resource optimization, yet is very challenging due to the temporal changes and the dynamic spatial correlations of the traffic data. To capture these intricate dependencies, spatio-temporal networks, such as recurrent neural networks with graph convolution networks, graph convolution networks with temporal convolution networks, and temporal attention networks with full graph attention networks, are applied. However, previous spatio-temporal networks are based on end-to-end training and thus fail to handle the distribution shift in the non-stationary traffic time series. On the other hand, the efficient and effective algorithm for modeling spatial correlations is still lacking in prior networks.In this paper, rather than proposing yet another end-to-end model, we aim to provide a novel disentangle-fusion framework STWave to mitigate the distribution shift issue. The framework first decouples the complex traffic data into stable trends and fluctuating events, followed by a dual-channel spatio-temporal network to model trends and events, respectively. Finally, reasonable future traffic can be predicted through the fusion of trends and events. Besides, we incorporate a novel query sampling strategy and graph wavelet-based graph positional encoding into the full graph attention network to efficiently and effectively model dynamic spatial correlations. Extensive experiments on six traffic datasets show the superiority of our approach, i.e., the higher forecasting accuracy with lower computational cost. Yuchen Fang 0001, Yanjun Qin, Haiyong Luo, Fang Zhao 0003, Bingbing Xu 0001, Liang Zeng 0002, Chenxing Wang 0001 |
ICDE | 2 |
| 2023 | Spatio-temporal hierarchical MLP network for traffic forecasting
Yanjun Qin, Haiyong Luo, Fang Zhao 0003, Yuchen Fang 0001, Xiaoming Tao 0001, Chenxing Wang 0001 |
Inf. Sci. | 1 |
| 2022 | Next Point-of-Interest Recommendation with Auto-Correlation Enhanced Multi-Modal Transformer NetworkabstractNext Point-of-Interest (POI) recommendation is a pivotal issue for researchers in the field of location-based social networks. While many recent efforts show the effectiveness of recurrent neural network-based next POI recommendation algorithms, several important challenges have not been well addressed yet: (i) The majority of previous models only consider the dependence of consecutive visits, while ignoring the intricate dependencies of POIs in traces; (ii) The nature of hierarchical and the matching of sub-sequence in POI sequences are hardly model in prior methods; (iii) Most of the existing solutions neglect the interactions between two modals of POI and the density category. To tackle the above challenges, we propose an auto-correlation enhanced multi-modal Transformer network (AutoMTN) for the next POI recommendation. Particularly, AutoMTN uses the Transformer network to explicitly exploits connections of all the POIs along the trace. Besides, to discover the dependencies at the sub-sequence level and attend to cross-modal interactions between POI and category sequences, we replace self-attention in Transformer with the auto-correlation mechanism and design a multi-modal network. Experiments results on two real-world datasets demonstrate the ascendancy of AutoMTN contra state-of-the-art methods in the next POI recommendation. Yanjun Qin, Yuchen Fang 0001, Haiyong Luo, Fang Zhao 0003, Chenxing Wang 0001 |
SIGIR | 1 |
| 2022 | Memory attention enhanced graph convolution long short-term memory network for traffic forecastingabstractIn recent years, traffic forecasting has gradually attracted attention in data mining because of the increasing availability of large-scale traffic data. However, it faces substantial challenges of complex temporal-spatial correlations in traffic. Recent studies mainly focus on modeling the local spatial correlations by utilizing graph neural networks and neglect the influence of long-distance spatial correlations. Besides, most existing works utilize recurrent neural networks-based encoder–decoder architecture to forecast multistep traffic volume and suffer from accumulative errors in recurrent neural networks. To deal with these issues, we propose the memory attention (MA) enhanced graph convolution long short-term memory network (MAEGCLSTM), a novel deep learning model for traffic forecasting. Specifically, MAEGCLSTM combines the MA and the vanilla graph convolution long short-term memory to capture global and local spatio-temporal dependencies, respectively. Then MAEGCLSTM utilizes a simplified GCLSTM to effectively fuse the global and local information. Moreover, we integrate the MAEGCLSTM into an encoder–decoder architecture to forecast multistep traffic volume. Besides MAEGCLSTM, we add the convolution neural network and encoder–decoder attention into the decoder to ease accumulative errors caused by iterative prediction and gain whole historical information from the encoder. Experiments on four real-world traffic data sets show that our model significantly outperforms by up to 6.07 % $6.07 \% $ improvement in L 1 $L1$ measure over 14 baselines. Yanjun Qin, Fang Zhao 0003, Yuchen Fang 0001, Haiyong Luo, Chenxing Wang 0001 |
Int. J. Intell. Syst. | 1 |
| 2022 | An abnormal driving behavior recognition algorithm based on the temporal convolutional network and soft thresholdingabstractMost traffic accidents are caused by bad driving habits. Online monitoring of the abnormal driving behaviors of drivers can help reduce traffic accidents. Recently, abnormal driving behavior recognition based on the sensors' data embedded in commodity smartphones has attracted much attention. Though much progress has been made about driving behavior recognition, the existing works cannot achieve high recognition accuracy and show poor robustness. To improve the driving behaviors recognition accuracy and robustness, we propose an algorithm based on Soft Thresholding and Temporal Convolutional Network (S-TCN) for driving behavior recognition. In this algorithm, we first introduce a soft attention mechanism to learn the importance of different sensors. The TCN has the advantages of small memory requirement and high computational efficiency. And the soft thresholding can further filter the redundant features and extract the main features. So, we fuse the TCN and soft thresholding to improve the model's stability and accuracy. Our proposed model is extensively evaluated on four real public data sets. The experimental results show that our proposed model outperforms best state-of-the-art baselines by 2.24%. Yunyun Zhao, Hongwei Jia, Haiyong Luo, Fang Zhao 0003, Yanjun Qin |
Int. J. Intell. Syst. | 5 |