| WhereNext: a location predictor on trajectory pattern mining |
| Full text |
Mov
(10:15),
Pdf
(539 KB)
|
Source
|
International Conference on Knowledge Discovery and Data Mining
archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
table of contents
Paris, France
SESSION: Research track papers
table of contents
Pages 637-646
Year of Publication: 2009
ISBN:978-1-60558-495-9
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 67, Downloads (12 Months): 228, Citation Count: 0
|
|
|
ABSTRACT
The pervasiveness of mobile devices and location based services is leading to an increasing volume of mobility data.This side eect provides the opportunity for innovative methods that analyse the behaviors of movements. In this paper we propose WhereNext, which is a method aimed at predicting with a certain level of accuracy the next location of a moving object. The prediction uses previously extracted movement patterns named Trajectory Patterns, which are a concise representation of behaviors of moving objects as sequences of regions frequently visited with a typical travel time. A decision tree, named T-pattern Tree, is built and evaluated with a formal training and test process. The tree is learned from the Trajectory Patterns that hold a certain area and it may be used as a predictor of the next location of a new trajectory finding the best matching path in the tree. Three dierent best matching methods to classify a new moving object are proposed and their impact on the quality of prediction is studied extensively. Using Trajectory Patterns as predictive rules has the following implications: (I) the learning depends on the movement of all available objects in a certain area instead of on the individual history of an object; (II) the prediction tree intrinsically contains the spatio-temporal properties that have emerged from the data and this allows us to define matching methods that striclty depend on the properties of such movements. In addition, we propose a set of other measures, that evaluate a priori the predictive power of a set of Trajectory Patterns. This measures were tuned on a real life case study. Finally, an exhaustive set of experiments and results on the real dataset are presented.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. ICDE 2007: 716--725.
|
| |
2
|
F. Giannotti, M. Nanni, and D. Pedreschi. Efficient mining of temporally annotated sequences. SIAM, 2006.
|
 |
3
|
Fosca Giannotti , Mirco Nanni , Fabio Pinelli , Dino Pedreschi, Trajectory pattern mining, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, August 12-15, 2007, San Jose, California, USA
[doi> 10.1145/1281192.1281230]
|
| |
4
|
F. Giannotti, D. Pedreschi, and et al. Geopkdd: Geographic privacy-aware knowledge discovery and delivery (european project), 2008.
|
| |
5
|
|
| |
6
|
K. Kianmehr and R. Alhajj. Effective classification by integrating support vector machine and association rule mining. IDEAL 2006: 920--927.
|
| |
7
|
B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. KDD 1998: 80--86.
|
| |
8
|
M. Morzy. Prediction of moving object location based on frequent trajectories. ISCIS, volume 4263 of LNCS, pages 583--592. Springer, 2006.
|
| |
9
|
|
| |
10
|
M. Nanni, B. Kuijpers, C. Korner, M. May, and D. Pedreschi. Spatiotemporal data mining. In F. Giannotti and D. Pedreschi, editors, Mobility, Data Mining, and Privacy: Geographic Knoweledge Discovery. Springer-Verlag, 2008.
|
| |
11
|
R. Ortale, E. Ritacco, N. Pelekis, R. Trasarti, G. Costa, F. Giannotti, G. Manco, and C. Renso. Daedalus: A knowledge discovery analysis framework for movement data. SEBD, 2008.
|
 |
12
|
|
| |
13
|
|
|