Qinglin Tan

Qinglin Tan


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 July 2021 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
JHJianbin Huang
Jianbin Huang
QTQinglin Tan
Qinglin Tan
HLHe Li
He Li
ALAo Li
Ao Li
LHLongji Huang
Longji Huang

1 March 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
ZZZhenghao Zhang
Zhenghao Zhang
JHJianbin Huang
Jianbin Huang
QTQinglin Tan
Qinglin Tan
HSHeli Sun
Heli Sun
YZYU Zhou
YU Zhou

5 December 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
JHJianbin Huang
Jianbin Huang
QTQinglin Tan
Qinglin Tan
RQRuijie Qi
Ruijie Qi
HLHe Li
He Li

1 June 2026 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
QTQinglin Tan
Qinglin Tan
HLHe Li
He Li
XLXuejiao Li
Xuejiao Li
JHJianbin Huang
Jianbin Huang
JCJiangtao Cui
Jiangtao Cui
PYPhilip S. Yu
Philip S. Yu
Congestion propagates in urban road networks following latent patterns, constrained by the physical topology of the road network and influenced by human mobility behavior. Exploring and leveraging these patterns can provide decision-making support for traffic management authorities. However, existing methods typically assume independent congestion effects, neglecting the sequential impacts of congestion propagation and failing to capture long-term dependencies in the spreading process. To address these limitations, we propose a novel reinforcement learning-based congestion propagation pattern mining method (named GRL_CPP). This approach formalizes congestion propagation as a Markov Decision Process (MDP) and employs reinforcement learning algorithms to continuously optimize decisions, automatically learning long-term dependencies within congestion propagation sequences. With the exploration mechanism of reinforcement learning, GRL_CPP can actively identify the most discriminative propagation patterns in complex traffic environments while avoiding unrealistic assumptions. Extensive experiments on both real-world and synthetic datasets demonstrate that our method significantly outperforms state-of-the-art baselines, achieving over 41% average improvements in real-world bidirectional congestion analysis across various data sparsity scenarios, and 74% improvement in the F1-score for true propagation graph reconstruction.