A Hybrid Prediction Model for Moving Objects

Existing prediction methods in moving objects databases cannot forecast locations accurately if the query time is far away from the current time. Even for near future prediction, most techniques assume the trajectory of an object's movements can be represented by some mathematical formulas of motion functions based on its recent movements. However, an object's movements are more complicated than what the mathematical formulas can represent. Prediction based on an object's trajectory patterns is a powerful way and has been investigated by several work. But their main interest is how to discover the patterns. In this paper, we present a novel prediction approach, namely The Hybrid Prediction Model, which estimates an object's future locations based on its pattern information as well as existing motion functions using the object's recent movements. Specifically, an object's trajectory patterns which have ad-hoc forms for prediction are discovered and then indexed by a novel access method for efficient query processing. In addition, two query processing techniques that can provide accurate results for both near and distant time predictive queries are presented. Our extensive experiments demonstrate that proposed techniques are more accurate and efficient than existing forecasting schemes.

[1]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[2]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[3]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[4]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[5]  Sajal K. Das,et al.  LeZi-update: an information-theoretic approach to track mobile users in PCS networks , 1999, MobiCom.

[6]  S JensenChristian,et al.  Indexing the positions of continuously moving objects , 2000 .

[7]  Christian S. Jensen,et al.  Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD Conference.

[8]  Nikos Mamoulis,et al.  Similarity search in sets and categorical data using the signature tree , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[9]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[10]  Charu C. Aggarwal,et al.  On nearest neighbor indexing of nonlinear trajectories , 2003, PODS '03.

[11]  Yufei Tao,et al.  Spatial queries in dynamic environments , 2003, TODS.

[12]  George Kollios,et al.  Mining, indexing, and querying historical spatiotemporal data , 2004, KDD.

[13]  Jignesh M. Patel,et al.  STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.

[14]  Christos Faloutsos,et al.  Prediction and indexing of moving objects with unknown motion patterns , 2004, SIGMOD '04.

[15]  Jeffrey Considine,et al.  Spatio-temporal aggregation using sketches , 2004, Proceedings. 20th International Conference on Data Engineering.

[16]  Dimitrios Gunopulos,et al.  Indexing mobile objects using dual transformations , 2004, The VLDB Journal.

[17]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[18]  Hiroyuki Kitagawa,et al.  Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets , 2004, STDBM.

[19]  Özgür Ulusoy,et al.  A data mining approach for location prediction in mobile environments , 2005, Data Knowl. Eng..

[20]  Meng Hu,et al.  TrajPattern: Mining Sequential Patterns from Imprecise Trajectories of Mobile Objects , 2006, EDBT.

[21]  Sanjay Chawla,et al.  Mining Spatio-temporal Association Rules, Sources, Sinks, Stationary Regions and Thoroughfares in Object Mobility Databases , 2006, DASFAA.

[22]  Dino Pedreschi,et al.  Trajectory pattern mining , 2007, KDD '07.