Yan Lin

Yan Lin

Auto-generated profile, based on publicly available information

Yan Lin

Department of Computer Science, Aalborg University, Aalborg, Denmark

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
20 July 2025
Verified
Conference Paper
Open access
XQXiangfei Qiu
Xiangfei Qiu
XWXingjian Wu
Xingjian Wu
YLYan Lin
Yan Lin
CGChenjuan Guo
Chenjuan Guo
Jilin HuJilin Hu
Jilin Hu
BYBin Yang
Bin Yang

12 September 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TWTonglong Wei
Tonglong Wei
YLYoufang Lin
Youfang Lin
SGShengnan Guo
Shengnan Guo
YLYan Lin
Yan Lin
YHYiheng Huang
Yiheng Huang
HWHuaiyu Wan
Huaiyu Wan
Trajectory data is essential for various applications. However, publicly available trajectory datasets remain limited in scale due to privacy concerns, which hinders the development of trajectory mining and applications. Although some trajectory generation methods have been proposed to expand dataset scale, they generate trajectories in the geographical coordinate system, posing two limitations for practical applications: 1) failing to ensure that the generated trajectories are road-constrained. 2) lacking road-related information. In this paper, we propose a new problem, road network-constrained trajectory (RNTraj) generation, which can directly generate trajectories on the road network with road-related information. Specifically, RNTraj is a hybrid type of data, in which each point is represented by a discrete road segment and a continuous moving rate. To generate RNTraj, we design a diffusion model called Diff-RNTraj, which can effectively handle the hybrid RNTraj using a continuous diffusion framework by incorporating a pre-training strategy to embed hybrid RNTraj into continuous representations. During the sampling stage, a RNTraj decoder is designed to map the continuous representation generated by the diffusion model back to the hybrid RNTraj format. Furthermore, Diff-RNTraj introduces a novel loss function to enhance trajectory's spatial validity. Extensive experiments conducted on two datasets demonstrate the effectiveness of Diff-RNTraj.

13 November 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
YLYan Lin
Yan Lin
HWHuaiyu Wan
Huaiyu Wan
Jilin HuJilin Hu
Jilin Hu
SGShengnan Guo
Shengnan Guo
BYBin Yang
Bin Yang
CJChristian S. Jensen
Christian S. Jensen
Given an origin (O), a destination (D), and a departure time (T), an Origin-Destination (OD) travel time oracle~(ODT-Oracle) returns an estimate of the time it takes to travel from O to D when departing at T. ODT-Oracles serve important purposes in map-based services. To enable the construction of such oracles, we provide a travel-time estimation (TTE) solution that leverages historical trajectories to estimate time-varying travel times for OD pairs. The problem is complicated by the fact that multiple historical trajectories with different travel times may connect an OD pair, while trajectories may vary from one another. To solve the problem, it is crucial to remove outlier trajectories when doing travel time estimation for future queries. We propose a novel, two-stage framework called Diffusion-based Origin-destination Travel Time Estimation (DOT), that solves the problem. First, DOT employs a conditioned Pixelated Trajectories (PiT) denoiser that enables building a diffusion-based PiT inference process by learning correlations between OD pairs and historical trajectories. Specifically, given an OD pair and a departure time, we aim to infer a PiT. Next, DOT encompasses a Masked Vision Transformer~(MViT) that effectively and efficiently estimates a travel time based on the inferred PiT. We report on extensive experiments on two real-world datasets that offer evidence that DOT is capable of outperforming baseline methods in terms of accuracy, scalability, and explainability.

27 December 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YLYan Lin
Yan Lin
HWHuaiyu Wan
Huaiyu Wan
SGShengnan Guo
Shengnan Guo
JHJilin Hu
Jilin Hu
CJChristian S. Jensen
Christian S. Jensen
YLYoufang Lin
Youfang Lin
Spatio-temporal trajectories provide valuable information about movement and travel behavior, enabling various downstream tasks that in turn power real-world applications. Learning trajectory embeddings can improve task performance but may incur high computational costs and face limited training data availability. Pre-training learns generic embeddings by means of specially constructed pretext tasks that enable learning from unlabeled data. Existing pre-training methods face (i) difficulties in learning general embeddings due to biases towards certain downstream tasks incurred by the pretext tasks, (ii) limitations in capturing both travel semantics and spatio-temporal correlations, and (iii) the complexity of long, irregularly sampled trajectories. To tackle these challenges, we propose Maximum Multi-view Trajectory Entropy Coding (MMTEC) for learning general and comprehensive trajectory embeddings. We introduce a pretext task that reduces biases in pre-trained trajectory embeddings, yielding embeddings that are useful for a wide variety of downstream tasks. We also propose an attention-based discrete encoder and a NeuralCDE-based continuous encoder that extract and represent travel behavior and continuous spatio-temporal correlations from trajectories in embeddings, respectively. Extensive experiments on two real-world datasets and three downstream tasks offer insight into the design properties of our proposal and indicate that it is capable of outperforming existing trajectory embedding methods.

9 February 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HWHuaiyu Wan
Huaiyu Wan
YLYan Lin
Yan Lin
SGShengnan Guo
Shengnan Guo
YLYoufang Lin
Youfang Lin
With the increasing accumulation of spatial-temporal trajectory data, location-based data mining has recently been extensively studied. A fundamental research topic in this field is learning the embedding vectors of locations through self-supervised pre-training. Pre-trained embedding vectors can utilize the highly available unlabeled trajectory data, and benefit downstream tasks in multiple aspects. However, most existing methods ignore the temporal information hidden in the visited time of locations in trajectories. Considering that human activities are highly regulated by specific periods of a day, temporal information can reflect some intrinsic characteristics of locations, so it is necessary to fuse them into location embedding vectors. In this paper, we propose a Time-Aware Location Embedding (TALE) pre-training method based on the CBOW framework, which is able to incorporate temporal information into the learned embedding vectors of locations. A novel temporal tree structure is designed to extract temporal information during the calculation of Hierarchical Softmax. In order to verify the effectiveness of TALE, we apply the learned embedding vectors into three downstream location-based prediction tasks, i.e., location classification, location visitor flow prediction and user next location prediction. Experiments are conducted on four real-world user trajectory datasets, and the experimental results demonstrate that our TALE model can obviously help downstream tasks gain better performance.

22 December 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
TWTonglong Wei
Tonglong Wei
YLYoufang Lin
Youfang Lin
SGShengnan Guo
Shengnan Guo
YLYan Lin
Yan Lin
EZEffective Graph Modeling and Contrastive Learning Zhao
Effective Graph Modeling and Contrastive Learning Zhao
HWHuaiyu Wan
Huaiyu Wan