Frequent route based continuous moving object location- and density prediction on road networks

Emerging trends in urban mobility have accelerated the need for effective traffic prediction and management systems. The present paper proposes a novel approach to using continuously streaming moving object trajectories for traffic prediction and management. The approach continuously performs three functions for streams of moving object positions in road networks: 1) management of current evolving trajectories, 2) incremental mining of closed frequent routes, and 3) prediction of near-future locations and densities based on 1) and 2). The approach is empirically evaluated on a large real-world data set of moving object trajectories, originating from a fleet of taxis, illustrating that detailed closed frequent routes can be efficiently discovered and used for prediction.

[1]  Christian S. Jensen,et al.  Enabling Routes of Road Network Constrained Movements as Mobile Service Context , 2007, GeoInformatica.

[2]  Haris N. Koutsopoulos,et al.  Requirements and potential of GPS-based floating car data for traffic management: Stockholm case study , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[3]  Christian S. Jensen,et al.  Indexing of moving objects for location-based services , 2002, Proceedings 18th International Conference on Data Engineering.

[4]  David J. DeWitt,et al.  NiagaraCQ: a scalable continuous query system for Internet databases , 2000, SIGMOD '00.

[5]  Jiawei Han,et al.  BIDE: efficient mining of frequent closed sequences , 2004, Proceedings. 20th International Conference on Data Engineering.

[6]  Hiroki Arimura,et al.  LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets , 2003, FIMI.

[7]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[8]  Mohammed J. Zaki,et al.  CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.

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

[10]  Hans-Peter Kriegel,et al.  Statistical Density Prediction in Traffic Networks , 2008, SDM.

[11]  Beng Chin Ooi,et al.  Effective Density Queries on ContinuouslyMoving Objects , 2006, 22nd International Conference on Data Engineering (ICDE'06).

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

[13]  Kai-Florian Richter,et al.  A Uniform Handling of Different Landmark Types in Route Directions , 2007, COSIT.

[14]  Tore Risch,et al.  Scalable Splitting of Massive Data Streams , 2010, DASFAA.

[15]  Philippe Bonnet,et al.  Towards Sensor Database Systems , 2001, Mobile Data Management.

[16]  Hiroki Arimura,et al.  LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets , 2004, FIMI.

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

[18]  Jae-Gil Lee,et al.  Mining Massive RFID, Trajectory, and Traffic Data Sets , 2008, Knowledge Discovery and Data Mining.

[19]  Anna Monreale,et al.  Location prediction within the mobility data analysis environment DAEDALUS , 2008, MobiQuitous.

[20]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[21]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

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

[23]  Anna Monreale,et al.  Location prediction within the mobility data analysis environment DAEDALUS , 2008, Mobiquitous 2008.

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

[25]  Christian S. Jensen,et al.  Path prediction and predictive range querying in road network databases , 2010, The VLDB Journal.

[26]  Torben Bach Pedersen,et al.  Highly scalable trip grouping for large-scale collective transportation systems , 2008, EDBT '08.

[27]  Tore Risch,et al.  Massive scale-out of expensive continuous queries , 2011, Proc. VLDB Endow..

[28]  Jian Pei,et al.  Mining Access Patterns Efficiently from Web Logs , 2000, PAKDD.

[29]  Robert Weibel,et al.  Towards a taxonomy of movement patterns , 2008, Inf. Vis..

[30]  Gyözö Gidofalvi,et al.  From Trajectories of Moving Objects to Route-based Traffic Prediction and Management , 2010 .

[31]  Jian Pei,et al.  CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[32]  Shashi Shekhar,et al.  Data Mining and Visualization of Twin-Cities Traffic Data , 2001 .

[33]  Jong-Dae Kim,et al.  Path Prediction of Moving Objects on Road Networks Through Analyzing Past Trajectories , 2007, KES.

[34]  Dimitrios Gunopulos,et al.  On-Line Discovery of Dense Areas in Spatio-temporal Databases , 2003, SSTD.

[35]  Gyözö Gidofalvi,et al.  Developing a Benchmark for Using Trajectories of Moving Objects in Traffic Prediction and Management , 2010 .

[36]  Torben Bach Pedersen,et al.  Mining Long, Sharable Patterns in Trajectories of Moving Objects , 2009, STDBM.

[37]  Tore Risch,et al.  Distributed data integration by object‐oriented mediator servers , 2001, Concurr. Comput. Pract. Exp..

[38]  Andrew Heybey,et al.  Tribeca: A System for Managing Large Databases of Network Traffic , 1998, USENIX Annual Technical Conference.

[39]  Calton Pu,et al.  Continual Queries for Internet Scale Event-Driven Information Delivery , 1999, IEEE Trans. Knowl. Data Eng..

[40]  Tore Risch,et al.  Functional Data Integration in a Distributed Mediator System , 2004 .

[41]  Qing Liu,et al.  A Hybrid Prediction Model for Moving Objects , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[42]  Torben Bach Pedersen,et al.  Data Modeling for Mobile Services in the Real World , 2003, SSTD.

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

[44]  Kai Zheng,et al.  Probabilistic range queries for uncertain trajectories on road networks , 2011, EDBT/ICDT '11.

[45]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[46]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[47]  Anna C. Gilbert,et al.  QuickSAND: Quick Summary and Analysis of Network Data , 2001 .