Browse > Article
http://dx.doi.org/10.5626/KTCP.2015.21.2.101

Recommendation of Best Empirical Route Based on Classification of Large Trajectory Data  

Lee, Kye Hyung (Sangmyung Univ.)
Jo, Yung Hoon (Sangmyung Univ.)
Lee, Tea Ho (Sangmyung Univ.)
Park, Heemin (Sangmyung Univ.)
Publication Information
KIISE Transactions on Computing Practices / v.21, no.2, 2015 , pp. 101-108 More about this Journal
Abstract
This paper presents the implementation of a system that recommends empirical best routes based on classification of large trajectory data. As many location-based services are used, we expect the amount of location and trajectory data to become big data. Then, we believe we can extract the best empirical routes from the large trajectory repositories. Large trajectory data is clustered into similar route groups using Hadoop MapReduce framework. Clustered route groups are stored and managed by a DBMS, and thus it supports rapid response to the end-users' request. We aim to find the best routes based on collected real data, not the ideal shortest path on maps. We have implemented 1) an Android application that collects trajectories from users, 2) Apache Hadoop MapReduce program that can cluster large trajectory data, 3) a service application to query start-destination from a web server and to display the recommended routes on mobile phones. We validated our approach using real data we collected for five days and have compared the results with commercial navigation systems. Experimental results show that the empirical best route is better than routes recommended by commercial navigation systems.
Keywords
trajectory data; best route; classification; MapReduce; navigation; android application;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Apache Hadoop. [online]. Available: http://hadoop.apache.org (downloaded 2014, Aug. 5)
2 K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl, "Constrained K-means Clustering with Background Knowledge," International Conference on Machine Learning, pp. 577-584, 2001.
3 P. S. Bradley, K. P. Bennett, and A. Demiriz, "Constrained k-means clustering," Technical Report MSR-TR-2000-65, Microsoft Research, Redmond, WA, 2000.
4 H.-W. Yun. "Path based K-means Clustering for RFID Data Sets," Journal of information and communication convergence engineering, Vol. 6, Issue 4, pp. 434-438, Dec. 2008.   과학기술학회마을
5 J. Lim, K. Kim, J. Kim, H. Oh, S. Yoon, S. Park, S. Yoon, J. Han, K. Bok, J. Yoo, "Design and Implementation of a Realtime Optimal Traffic Route Guidance System Through Big Data Analysis," 2014 Fall Conference of Korea Contents Association, pp. 297-298, 2014.
6 S. Yang, C. Choi, H. Choi, "Design and Implementation of Vehicle Route Tracking System using Hadoop-Based Bigdata Image Processing," Journal of Digital Contents Society, Vol. 14, No. 4, pp. 447-454, Dec. 2013.   과학기술학회마을   DOI   ScienceOn
7 J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, and Y. Huang, "T-Drive: Driving Directions Based on Taxi Trajectories," ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 99-108, 2010.
8 Naver Map. [online], Available: http://map.naver.com. (accessed 2014, Nov. 3)
9 SK Telecom T-Map Navigation. [online]. Available: http://www.tmap.co.kr/tmap2. (accessed 2014, Nov. 3)
10 B. C. Dean. "Continuous-time dynamic shortest path algorithms. Master's thesis," Massachusetts Institute of Technology, 1999.