Two-Stage Data Mining Based Vehicle Navigation Algorithm in Urban Traffic Network

Article Preview

Abstract:

Along with the development of Intelligent Transportation System, traffic detectors collect numerous transportation state data in information databases and accumulate. Such data is greatly meaningful to the vehicle navigation. In this paper, we propose a noble two-stage algorithm about vehicle navigation by using data mining methods on the historical and current transportation dataset. This algorithm begins with picking sensitive data about start and end point in an urban traffic network, and data from related (or nearest) road fragments. Referring to current time and season, the algorithm gives an evaluation to every related road fragments and outputs a most reasonable route between start and end point. The experimental and theoretical analyzes show that this algorithm can form an efficient and effective route in reasonable time.

You have full access to the following eBook

Info:

Periodical:

Pages:

133-137

Citation:

Online since:

July 2012

Authors:

Export:

Share:

Citation:

[1] M. Garey, D. Johnson. Computers and Intractability: A Guide to the Theory of Np-completeness. W. H. Freeman and Company, 1979.

Google Scholar

[2] G. Yang. The Complexity of Mining Maximal Frequent Itemsets and Maximal Frequent Patterns. 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, WA, USA, 2004:344–353.

DOI: 10.1145/1014052.1014091

Google Scholar

[3] X. Yan, J. Han. gSpan: Graph-based Substructure Pattern Mining. IEEE International Conference on Data Mining (ICDM). Maebashi City, Japan, 2002:548–551.

DOI: 10.1109/icdm.2002.1184038

Google Scholar

[4] J. Huan, W. Wang, J. Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. IEEE International Conference on Data Mining (ICDM). Melbourne, Florida, USA, 2003:549–552

DOI: 10.1109/icdm.2003.1250974

Google Scholar

[5] S. Yang, X. Yan, B. Zong, A. Khan. Towards Effective Partition Management for Large Graphs. SIGMOD'12 (Proc. 2012 Int. Conf. on Management of Data), Jun 2012.

DOI: 10.1145/2213836.2213895

Google Scholar

[6] Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, John Paul Sondag. Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach. Very Large Databases 2007 (VLDB '07), September 23-28: 794-805.

Google Scholar

[7] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 24.3: Dijkstra's algorithm, p.595–601.

Google Scholar

[8] T. Brinkhoff. Network-based generator of moving objects. Technical report, IAPG, http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/.

Google Scholar