Unsupervised Trajectory Sampling
Abstract
A novel methodology for efficiently sampling Trajectory Databases (TD) for mobility data mining purposes is presented. In particular, a three-step unsupervised trajectory sampling methodology is proposed, that initially adopts a symbolic vector representation of a trajectory which, using a similarity-based voting technique, is transformed to a continuous function that describes the representativeness of the trajectory in the TD. This vector representation is then relaxed by a merging algorithm, which identifies the maximal representative portions of each trajectory, at the same time preserving the space-time mobility pattern of the trajectory. Finally, a novel sampling algorithm operating on the previous representation is proposed, allowing us to select a subset of a TD in an unsupervised way encapsulating the behavior (in terms of mobility patterns) of the original TD. An experimental evaluation over synthetic and real TD demonstrates the efficiency and effectiveness of our approach.
Cite
Text
Pelekis et al. "Unsupervised Trajectory Sampling." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010. doi:10.1007/978-3-642-15939-8_2Markdown
[Pelekis et al. "Unsupervised Trajectory Sampling." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010.](https://mlanthology.org/ecmlpkdd/2010/pelekis2010ecmlpkdd-unsupervised/) doi:10.1007/978-3-642-15939-8_2BibTeX
@inproceedings{pelekis2010ecmlpkdd-unsupervised,
title = {{Unsupervised Trajectory Sampling}},
author = {Pelekis, Nikos and Kopanakis, Ioannis and Panagiotakis, Costas and Theodoridis, Yannis},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2010},
pages = {17-33},
doi = {10.1007/978-3-642-15939-8_2},
url = {https://mlanthology.org/ecmlpkdd/2010/pelekis2010ecmlpkdd-unsupervised/}
}