Mining the Shortest Path within a Travel Time Constraint in Road Network Environments

In recent years, a number of studies have been done on GPS (Global Positioning System) due to the wide applications. One important research issue is on the GPS navigation. In this paper, we propose a novel data mining algorithm named PATE (prediction-based algorithm for travel time evaluation) that can efficiently predict the travel time of a navigation path and precisely recommends the navigation path to the users under a user-specified travel time constraint in road network environments. To our best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, we propose a novel search structure named NPST (navigation path search tree) for efficiently finding the shortest navigation path that meets the user-specified travel time constraint. Through a series of experiments, the proposed method was shown to have excellent performance under different system conditions.

[1]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[2]  Sudhir Kumar Barai,et al.  Data mining applications in transportation engineering , 2003 .

[3]  M. Parent,et al.  Rule based prediction of fastest paths on urban networks , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[4]  Philip S. Yu,et al.  Efficient Data Mining for Path Traversal Patterns , 1998, IEEE Trans. Knowl. Data Eng..

[5]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[6]  Eamonn J. Keogh,et al.  A symbolic representation of time series, with implications for streaming algorithms , 2003, DMKD '03.

[7]  Barry Smyth,et al.  Time based patterns in mobile-internet surfing , 2006, CHI.

[8]  Vincent S. Tseng,et al.  Efficient mining and prediction of user behavior patterns in mobile web systems , 2006, Inf. Softw. Technol..

[9]  Yves Duthen,et al.  Improvement of a Shortest Routes Algorithm , 2007, 2007 IEEE Intelligent Transportation Systems Conference.

[10]  Divyakant Agrawal,et al.  FATES: Finding A Time dEpendent Shortest path , 2003, Mobile Data Management.

[11]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[12]  A. El-Rabbany.  Introduction to GPS: The Global Positioning System , 2002 .

[13]  Mark Levene,et al.  Data Mining of User Navigation Patterns , 1999, WEBKDD.

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Man Hon Wong,et al.  Mining Popular Paths in a Transportation Database System with Privacy Protection , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[16]  Faramroze Engineer.  Fast Shortest Path Algorithms for Large Road Networks , .

[17]  Barry Smyth,et al.  Predicting navigation patterns on the mobile-internet using time of the week , 2005, WWW '05.

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

[19]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[20]  Jiawei Han,et al.  Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach , 2007, VLDB.