Self-Adaptive Trajectory Segmentation
- they are based on critical thresholds that the user needs to choose accurately, and in most cases it is difficult to understand what value is the best;
- such thresholds are global, i.e., the same threshold value applies to all the moving individuals, irrespective of any distinctive characteristics they might have.
Problem Formulation and Proposed Solution
Existing trajectory segmentation methods assume that the same rules and the same parameters should apply to all moving objects. Our objective is to overcome this limitation, making the segmentation process adaptive to the individual and taking into consideration her overall mobility.
The proposed solution to the individual cut threshold problem consists in fixing the spatial threshold to a global value (i.e. to be used for all users) and then in studying the segmentations that we would obtain by applying different temporal thresholds. When very small values of τ are used, the segmentation obtained will contain a huge number of very short segments, till the extreme case where each point forms its own segment. As the threshold is increased, more and more segments will merge together, since some of the former splitting points will fall below τ. The process is expected to gradually enlarge the trajectory segments by first including simple slowdowns (i.e. not really stop points), then temporary stops (e.g. at traffic lights), and so on.
Our approach consists in (virtually) monitoring such progression, and detect the moment where an anomalous increase in the number of segments is observed, which represents a sort of change of state. We called the procedure as ATS (self-Adaptive Trajectory Segmentation). We experimented the new approach (ATS) described above over a real dataset of GPS vehicle traces. The results commented in the following refer to 2000 users of the area of Rome (Italy), and London (UK). We first analyzed the personal temporal thresholds returned by ATS, then we propose a quantitative and qualitative evaluation of the results for understanding the benefits of the novel method with respect to existing ones. We compare ATS against the trajectory segmentation method with fixed parameters proposed in [1].
Figure. Time threshold distributions for trajectories in Rome and London selected by ATS for each user (vertical axis represents value frequencies in log-scale). The peaks show the ideal thresholds to be set to build the trajectories.
Although every user has her own mobility behavior with its own mix of regular and more erratic behaviours [2], we observe two clear peaks in the distributions for both Rome and London. This supports the intuition behind our approach, namely to have a self-adaptive procedure selecting a personalized best temporal threshold for each user. Selecting one single threshold value for all the data might negatively affect the segmentation of some users, partitioning their trajectories either too much or too little.
Though preliminary, the experiments show that it is possible to derive user-adaptive cut thresholds, improving the performances of the segmentation over less flexible solutions. This is an ongoing work, and several improvements are being explored. Among them, the future lines of research will aim to derive thresholds for trajectory segmentation which are not only user-adaptive, but also location-adaptive, thus considering the fact that a stop at different places might require time intervals of different duration to be considered a significant stay – and thus a trajectory cut point. Also, we will study the possibility of exploiting the context around the (moving) user, such as the mobility of other users and the geographical area surrounding the candidate stops.
The paper describing this research has been presented to the workshop “BMDA 2020: Third International Workshop in Big Mobility Data Analytics”.
Written by Agnese Bonavita agnese.bonavita@sns.it
Revised by Luca Pappalardo
References
[1] Luca Pappalardo et al. 2015. Returners and explorers dichotomy in human mobility. Nature communications 6 (2015), 8166.
[2] Roberto Trasarti et al. 2011. Mining mobility user profiles for car pooling. In KDD. ACM, 1190–1198.