Jingbo Zhou
ABSTRACT
Path prediction is useful in a wide range of applications. Most of the existing solutions, however, are based on eager learning methods where models and patterns are extracted from historical trajectories and then used for future prediction. Since such approaches are committed to a set of statistically significant models or patterns, problems can arise in dynamic environments where the underlying models change quickly or where the regions are not covered with statistically significant models or patterns.
We propose a "semi-lazy" approach to path prediction that builds prediction models on the fly using dynamically selected reference trajectories. Such an approach has several advantages. First, the target trajectories to be predicted are known before the models are built, which allows us to construct models that are deemed relevant to the target trajectories. Second, unlike the lazy learning approaches, we use sophisticated learning algorithms to derive accurate prediction models with acceptable delay based on a small number of selected reference trajectories. Finally, our approach can be continuously self-correcting since we can dynamically re-construct new models if the predicted movements do not match the actual ones.
Our prediction model can construct a probabilistic path whose probability of occurrence is larger than a threshold and which is furthest ahead in term of time. Users can control the confidence of the path prediction by setting a probability threshold. We conducted a comprehensive experimental study on real-world and synthetic datasets to show the effectiveness and efficiency of our approach.
- M. Arulampalam, S. Maskell, N. Gordon, and T. Clapp. A tutorial on particle filters for online nonlinear/non-gaussian bayesian tracking. IEEE Transactions on Signal Processing, 50(2):174--188, 2002. Google Scholar
Digital Library
- J. L. Bentley. Multidimensional binary search trees used for associative searching. COMMUN. ACM, 18(9):509--517, 1975. Google ScholarDigital Library
- T. Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6(2):153--180, 2002. Google ScholarDigital Library
- Y. Bu, L. Chen, A. Fu, and D. Liu. Efficient anomaly monitoring over moving object trajectory streams. In SIGKDD, pages 159--168, 2009. Google ScholarDigital Library
- R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. TKDE, 16(9):1112--1127, 2004. Google ScholarDigital Library
- W. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. J. of classification, 1(1):7--24, 1984.Google ScholarCross Ref
- G. Forney Jr. The viterbi algorithm. Proceedings of the IEEE, 61(3):268--278, 1973.Google ScholarCross Ref
- H. Jeung, Q. Liu, H. Shen, and X. Zhou. A hybrid prediction model for moving objects. In ICDE, pages 70--79, 2008. Google ScholarDigital Library
- H. Jeung, M. Yiu, X. Zhou, and C. Jensen. Path prediction and predictive range querying in road network databases. The VLDB Journal, 19(4):585--602, 2010. Google ScholarDigital Library
- J. Joseph, F. Doshi-Velez, and N. Roy. A bayesian nonparametric approach to modeling mobility patterns. In AAAI, pages 1587--1593, 2010.Google Scholar
- H. Karimi and X. Liu. A predictive location model for location-based services. In GIS, pages 126--133, 2003. Google ScholarDigital Library
- J. Kleinberg. Computing: The wireless epidemic. Nature, 449:287--288, 2007.Google ScholarCross Ref
- J. Krumm and E. Horvitz. Predestination: Inferring destinations from partial trajectories. In UbiComp, pages 243--260, 2006. Google ScholarDigital Library
- X. Li, Z. Li, J. Han, and J. Lee. Temporal outlier detection in vehicle traffic data. In ICDE, pages 1319--1322, 2009. Google ScholarDigital Library
- M. Lin, W.-J. Hsu, and Z. Q. Lee. Predictability of individuals' mobility with high-resolution positioning data. In UbiComp, pages 381--390, 2012. Google ScholarDigital Library
- A. Monreale, F. Pinelli, R. Trasarti, and F. Giannotti. Wherenext: a location predictor on trajectory pattern mining. In SIGKDD, pages 637--646, 2009. Google ScholarDigital Library
- M. Morzy. Prediction of moving object location based on frequent trajectories. In ISCIS, pages 583--592, 2006. Google ScholarDigital Library
- M. Morzy. Mining frequent trajectories of moving objects for location prediction. In MLDM, pages 667--680, 2007. Google ScholarDigital Library
- M. Musolesi and C. Mascolo. Mobility models for systems evaluation. a survey. Middleware for Network Eccentric and Mobile Applications, pages 43--62, 2009.Google ScholarCross Ref
- A. Sadilek and J. Krumm. Far out: Predicting long-term human mobility. In AAAI, pages 814--820, 2012.Google Scholar
- L. Tang, X. Yu, S. Kim, J. Han, W. Peng, Y. Sun, H. Gonzalez, and S. Seith. Multidimensional analysis of atypical events in cyber-physical data. In ICDE, pages 1025--1036, 2012. Google ScholarDigital Library
- L. Tang, Y. Zheng, J. Yuan, J. Han, A. Leung, C. Hung, and W. Peng. On discovery of traveling companions from streaming trajectories. In ICDE, pages 186--197, 2012. Google ScholarDigital Library
- Y. Tao, C. Faloutsos, D. Papadias, and B. Liu. Prediction and indexing of moving objects with unknown motion patterns. In SIGMOD, pages 611--622, 2004. Google ScholarDigital Library
- S. Šaltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In SIGMOD, pages 331--342, 2000. Google ScholarDigital Library
- W. Wu, W. S. Ng, S. Krishnaswamy, and A. Sinha. To taxi or not to taxi? - enabling personalised and real-time transportation decisions for mobile users. In MDM, pages 320--323, 2012. Google ScholarDigital Library
- A. Y. Xue, R. Zhang, Y. Zheng, X. Xie, J. Huang, and Z. Xu. Destination prediction by sub-trajectory synthesis and privacy protection against such prediction. In ICDE, 2013.Google ScholarDigital Library
- G. Yavaş, D. Katsaros, Ö. Ulusoy, and Y. Manolopoulos. A data mining approach for location prediction in mobile environments. Data & Knowledge Engineering, 54(2):121--146, 2005. Google ScholarDigital Library
- J. Ying, W. Lee, T. Weng, and V. Tseng. Semantic trajectory mining for location prediction. In GIS, pages 34--43, 2011. Google ScholarDigital Library
- B. Zhou, X. Wang, and X. Tang. Understanding collective crowd behaviors: Learning a mixture model of dynamic pedestrian-agents. In CVPR, pages 2871--2878, 2012. Google ScholarDigital Library
Index Terms
- A “semi-lazy” approach to probabilistic path prediction in dynamic environments
Recommendations
Path-based next trace prediction
MICRO 30: Proceedings of the 30th annual ACM/IEEE international symposium on MicroarchitectureThe trace cache has been proposed as a mechanism for providing increased fetch bandwidth by allowing the processor to fetch across multiple branches in a single cycle. But to date predicting multiple branches per cycle has meant paying a penalty in ...
Merging path and gshare indexing in perceptron branch prediction
We introduce the hashed perceptron predictor, which merges the concepts behind the gshare, path-based and perceptron branch predictors. This predictor can achieve superior accuracy to a path-based and a global perceptron predictor, previously the most ...
A Multi-Strategy Approach to KNN and LARM on Small and Incrementally Induced Prediction Knowledge
ADMA '09: Proceedings of the 5th International Conference on Advanced Data Mining and ApplicationsMost classification problems assume that there are sufficient training sets to induce the prediction knowledge. Few studies are focused on the label prediction according to the small knowledge. Hence, a classification algorithm in which the prediction ...
Comments