Yi Xu

Dr. Yi Xu


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
27 July 2023 in Information Fusion
Verified
Journal Article
Closed access
YXYi Xu
Yi Xu
LHLiangzhe Han
Liangzhe Han
TZTongyu Zhu
Tongyu Zhu
LSLeilei Sun
Leilei Sun
BDBowen Du
Bowen Du
WLWeifeng Lv
Weifeng Lv

1 March 2024 in Information Fusion
Verified
Journal Article
Closed access
MCMao Chen
Mao Chen
LHLiangzhe Han
Liangzhe Han
YXYi Xu
Yi Xu
TZTongyu Zhu
Tongyu Zhu
JWJibin Wang
Jibin Wang
LSLeilei Sun
Leilei Sun

12 March 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
TLTianxi Liao
Tianxi Liao
LHLiangzhe Han
Liangzhe Han
YXYi Xu
Yi Xu
TZTongyu Zhu
Tongyu Zhu
LSLeilei Sun
Leilei Sun
BDBowen Du
Bowen Du
Travel time estimation (TTE) is a fundamental and challenging problem for navigation and travel planning. Though many efforts have been devoted to this task, most of the previous research has focused on extracting useful features of the routes to improve the estimation accuracy. In our opinion, the key issue of TTE is how to handle the rich spatiotemporal information underlying a route and how to model the multi-faceted factors that affect travel time. Along this line, we propose a multi-faceted route representation learning framework that divides a route into three sequences: a trajectory sequence consists of GPS coordinates to describe spatial information, an attribute sequence to encode the features of each road segment, and a semantic sequence consists of the IDs of road segments to capture the context information of routes. Then, we design a sequential learning module and transformer encoder to get the representations of three sequences for each route respectively. Finally, we fuse the multi-faceted route representations together, and provide a self-supervised learning module to improve the generalization of final representation. Experiments on two real-world datasets demonstrate that our method could provide more accurate travel time estimation than baselines, and all the multi-faceted route representations contribute to the improvement of estimation accuracy.

30 October 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JTJingwen Tian
Jingwen Tian
LHLiangzhe Han
Liangzhe Han
MCMao Chen
Mao Chen
YXYi Xu
Yi Xu
ZCZhuo Chen
Zhuo Chen
WLWeifeng Lv
Weifeng Lv

1 June 2025 in Information Fusion
Verified
Journal Article
Closed access
YXYi Xu
Yi Xu
ZDZerong Deng
Zerong Deng
TZTongyu Zhu
Tongyu Zhu
LHLiangzhe Han
Liangzhe Han
LSLeilei Sun
Leilei Sun
HSHao Sheng
Hao Sheng

7 November 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YXYi Xu
Yi Xu
LHLiangzhe Han
Liangzhe Han
TZTongyu Zhu
Tongyu Zhu
LSLeilei Sun
Leilei Sun
BDBowen Du
Bowen Du
WLWeifeng Lv
Weifeng Lv
Origin-Destination demand prediction is a fundamental and important task in the urban transportation system. It is more challenging and complex than region demand prediction since it needs to predict traffic demand for each pair of regions rather than a single region, which means $N^2$ time series need to be predicted given $N$ stations. Most existing works are mainly proposed for the region (or station) demand prediction. On the other hand, previous Origin-Destination demand prediction methods only follow a single discrete-time setting while the input data are continuous-time OD orders, which means these methods have not sufficiently leveraged the rich information for demand prediction. To solve these challenges, we propose a novel framework consisting of both continuous-time and discrete-time representation learning modules for Origin-Destination demand prediction. Firstly, we construct memorable representations of all nodes and design a continuous-time learning module to update the nodes’ representations once a time-stamped OD transaction is observed. Then, a discrete-time representation learning module is proposed to generate discrete-time messages containing information across a fixed time interval from a macro perspective. Next, a co-updater module is designed to fuse messages from both continuous-time and discrete-time channels into node memory. Last, a graph attention module is developed, which generates final node embeddings using updated node memory and predicts the forthcoming OD demand matrix based on them. The experimental results on real-world datasets show that our method leads to significant and consistent improvements compared to other methods.