432 Y. Zhang et al.
1 Introduction
The widespread use of mobile devices has resulted in a proliferation of trajectory
data, which contain a wealth of mobility information that is critical to location-
based services, e.g., route optimization [29] and travel time estimation [6].
Trajectory data use discrete spatial-temporal point pairs to describe the
motion of objects in continuous time and space. Due to the limitations of equip-
ment and environment such as equipment failure and signal missing, many trajec-
tories are recorded at a low sampling rate or with missing locations, called incom-
plete trajectories. Too large sampling interval between two consecutive sampling
points can lose detailed information and lead to high uncertainty [30], which
affects downstream applications (e.g., indexing [12], clustering [20], and min-
ing [11,24,25]) negatively. Therefore, it is important to recover missing spatial-
temporal points for incomplete trajectories and reduce their uncertainty.
In general, previous studies on trajectory recovery can be divided into two
directions. The first direction focuses primarily on modeling users’ transition
pattern among different locations to predict users’ missing locations [4,7,8,10,
15,19,25–27]. The basic task is essentially a classification task, and the recov-
ered trajectories are usually composed of locations or POIs. The second direction
aims to recover the specific geographic coordinates of trajectories at the miss-
ing timestamps based on the incomplete trajectory data recorded [2,5,9,14,16–
18,23,24,28]. The final rebuilt trajectories usually consist of precise (GPS or
road network) coordinates. In this work, we focus on the second direction, i.e.,
recovering precise GPS coordinates for incomplete trajectories.
A straightforward approach for the second direction is to regard a single
trajectory as two-dimensional time series directly and apply time series impu-
tation methods to recover incomplete trajectories [2,5,9,16,17,28]. These meth-
ods exhaust all the precise information of a single incomplete trajectory when
recovering it and work quite well when the proportion of the missing trajectory
data is small. However, their effectiveness decreases significantly as the miss-
ing proportion increases, which means that they cannot deal with the sparse
trajectory data. Another common solution for this problem is cell-based meth-
ods [14,18,23,24], which divide the space into discrete cells and then recover
the missing trajectories described by cells. They further design different post-
calibration algorithms to refine the results. These methods transform the trajec-
tory recovery problem from infinitely continuous space into finite discrete space,
which reduce the complexity of prediction to improve the capacity of modeling
transition patterns. Although the cell-based methods can alleviate the problem
of data sparsity to some extent, they only use the information contained in the
incomplete trajectory instead of making full use of information coming from
other trajectories. Besides, some extra noise and inaccurate information would
inevitably be introduced since these methods use cells to represent trajectories.
Furthermore, in the calibration stage, there is a lack of available information for
getting accurate trajectory coordinates.
Exploiting the similarity among different trajectories to model the complex
mobility regularity for incomplete trajectories, we propose a novel trajectory
相关文档
评论