A Robust Distance-Weighted Collaborative Filtering Method for Route Recommendation Based on Historical Trajectory Data

Modern navigation systems try to provide users with the optimal route considering multiple factors, such as travel time and user preference. However, the sampling of historical route data could be discrete and intermittent, which brings a great challenge to learning user preference correctly. Meanwhile, route recommendation methods often face the problem of insufficient robustness and stability, which deteriorates the user experience. This paper introduces an effective approach to reconstructing routes from historical trajectory data with a low sampling rate using an entropy-based method for GPS trajectory segmentation and a hidden Markov model to match trajectories to road networks. We further introduce a distance-weighted collaborative filtering (DWCF) method for route recommendation, considering both driver preference and route distance. Experiments based on massive driving trajectory data show that the DWCF method can effectively learn driver preference from historical data and show superior robustness and stability over the other benchmark methods.

Authors

Institutions

Publication Details

Published
2024-12-11
DOI
https://doi.org/10.1061/9780784485484.335
Citations
1
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Robust Distance-Weighted Collaborative Filtering Method for Route Recommendation Based on Historical Trajectory Data

Xiao Hu, Yunxuan Li, Meng Li, Huiping Li et al.
1 citations
Data Management and Algorithms
0.35
article

A Robust Distance-Weighted Collaborative Filtering Method for Route Recommendation Based on Historical Trajectory Data

Xiao Hu, Yunxuan Li, Meng Li, Huiping Li, Qi Yu, Ke Zhang
article en
1 citations

Abstract

Modern navigation systems try to provide users with the optimal route considering multiple factors, such as travel time and user preference. However, the sampling of historical route data could be discrete and intermittent, which brings a great challenge to learning user preference correctly. Meanwhile, route recommendation methods often face the problem of insufficient robustness and stability, which deteriorates the user experience. This paper introduces an effective approach to reconstructing routes from historical trajectory data with a low sampling rate using an entropy-based method for GPS trajectory segmentation and a hidden Markov model to match trajectories to road networks. We further introduce a distance-weighted collaborative filtering (DWCF) method for route recommendation, considering both driver preference and route distance. Experiments based on massive driving trajectory data show that the DWCF method can effectively learn driver preference from historical data and show superior robustness and stability over the other benchmark methods.

Beijing University of Technology (CN), Tsinghua University (CN)
Openalex Percentile: Top 41%
Data Management and Algorithms
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.