JOURNAL BROWSE
Search
Advanced SearchSearch Tips
An Efficient Clustering Algorithm for Massive GPS Trajectory Data
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Journal of KIISE
  • Volume 43, Issue 1,  2016, pp.40-46
  • Publisher : Korean Institute of Information Scientists and Engineers
  • DOI : 10.5626/JOK.2016.43.1.40
 Title & Authors
An Efficient Clustering Algorithm for Massive GPS Trajectory Data
Kim, Taeyong; Park, Bokuk; Park, Jinkwan; Cho, Hwan-Gue;
 
 Abstract
Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.
 Keywords
trajectory clustering;GPS data;road map generation;line sweeping;
 Language
Korean
 Cited by
1.
최대 중첩구간을 이용한 새로운 GPS 궤적 클러스터링,김태용;박보국;박진관;조환규;

정보과학회 컴퓨팅의 실제 논문지, 2016. vol.22. 9, pp.419-425 crossref(new window)
 References
1.
J.-G. Lee, J. Han and K.-Y. Whang, "Trajectory clustering: a partition-and-group framework," Proc. of ACM SIGMOD, pp. 593-604, 2007.

2.
J. Biagioni and J. Eriksson, "Inferring road maps from global positioning system traces," Journal of the Transportation Research Board : Transportation Research Record, Vol. 2291, No. 8, pp. 61-71, 2012. crossref(new window)

3.
L. Cao and J. Krumm, "From GPS traces to a routable road map," Proc. of ACM SIGSPATIAL, pp. 3-12, 2009.

4.
S. Jang, T. Kim and S. Lee, "Map generation system with lightweight GPS trace data," ICACT, pp. 1489-1493, 2010.

5.
K. Buchin, M. Buchin, M. van Kreveld, M. Loffler, Rodrigo I. Silveira, C. Wenk and L. Wiratma, "Median trajectories," Algorithmica, Vol. 66, No. 3, pp. 595-614, Jul. 2013. crossref(new window)

6.
M van. Kreveld and L. Wiratma, "Median trajectories using well-visited regions and shortest paths," Proc. of ACM GIS, pp. 241-250, 2011.

7.
K. R. Zalik and B. Zalik, "A sweep-line algorithm for spatial clustering," Advances in Engineering Software, Vol. 40, No. 6, pp. 445-451, Jun. 2009. crossref(new window)

8.
H. Alt and M. Godau, "Computing the Frechet distance between two polygonal curves," International Journal of Computational Geometry & Applications, Vol. 5, No. 1&2, pp. 75-91, 1995. crossref(new window)

9.
P. K. Agarwal, R. B. Avraham, H. Kaplan and M. Sharir, "Computing the Discrete Fréchet Distance in Subquadratic Time," SIAM J. Computing, Vol. 43, No. 2, pp. 429-444, Mar. 2014. crossref(new window)