DOI QR코드

DOI QR Code

Trajectory Clustering in Road Network Environment

도로 네트워크 환경을 위한 궤적 클러스터링

  • 백지행 (한양대학교 전자컴퓨터통신공학과) ;
  • 원정임 (한양대학교 정보통신학부) ;
  • 김상욱 (한양대학교 정보통신학부)
  • Published : 2009.06.30

Abstract

Recently, there have been many research efforts proposed on trajectory information. Most of them mainly focus their attention on those objects moving in Euclidean space. Many real-world applications such as telematics, however, deal with objects that move only over road networks, which are highly restricted for movement. Thus, the existing methods targeting Euclidean space cannot be directly applied to the road network space. This paper proposes a new clustering scheme for a large volume of trajectory information of objects moving over road networks. To the end, we first define a trajectory on a road network as a sequence of road segments a moving object has passed by. Next, we propose a similarity measurement scheme that judges the degree of similarity by considering the total length of matched road segments. Based on such similarity measurement, we propose a new clustering algorithm for trajectories by modifying and adjusting the FastMap and hierarchical clustering schemes. To evaluate the performance of the proposed clustering scheme, we also develop a trajectory generator considering the observation that most objects tend to move from the starting point to the destination point along their shortest path, and perform a variety of experiments using the trajectories thus generated. The performance result shows that our scheme has the accuracy of over 95% in comparison with that judged by human beings.

최근 궤적 정보를 이용한 많은 연구들이 진행되고 있으나, 이들 대부분의 연구는 유클리드 공간 내의 궤적들을 대상으로 하고 있다. 그러나 실제 응용에서 대부분의 이동 객체들은 도로 네트워크 공간상에 존재하므로, 유클리드 공간을 대상으로 한 연구들을 도로 네트워크 공간에 적용시키는 것은 적합하지 않다. 본 논문에서는 도로 네트워크 내 이동 객체들의 대용량 궤적 정보를 대상으로 하는 효과적인 클러스터링 기법에 대하여 논한다. 이를 위하여 우선 본 논문에서는 궤적을 각 이동 객체가 시간에 따라 지나온 도로 세그먼트들의 연속으로 정의한다. 다음, 도로 세그먼트들의 길이와 식별자 정보를 이용한 새로운 유사도 측정 함수를 제안하고, 이를 이용하여 측정된 궤적간의 유사도 정보를 기반으로 FastMap과 계층 클러스터링(hierarchical clustering)기법을 이용하여 전체 궤적들을 클러스터링하는 방식을 제안한다. 또한, 본 논문에서는 실제 응용에서 대부분의 이동 객체는 최단 거리를 이용하여 움직인다는 특성을 반영한 새로운 궤적 생성 기법을 제안하고, 이렇게 생성된 궤적 데이터를 이용하여 제안된 클러스터링 기법에 대한 다양한 성능 평가 결과를 보인다. 실험 결과에 따르면 제안된 기법은 사람에 의하여 유사 궤적들을 클러스터링한 결과와 비교하여 95%이상의 높은 정확도를 보였다.

Keywords

References

  1. V. Almeida and R. Guting, 'Indexing the Trajectories of Moving Objects in Networks,' Geoinformatica, Vol.9, No.1, pp.33-60, 2005 https://doi.org/10.1007/s10707-004-5621-7
  2. S. Brakatsoulas, D. Pfoser, and N. Tryfona, 'Modeling, Storing, and Mining Moving Object Databases,' In Proc. Int'l. Symp. on Database Engineering and Applications, pp.68-77, 2004
  3. T. Brinkhoff, 'A Framework for Generating Network-Based Moving Objects,' GeoInformatica, Vol.6, No.2, pp.153-180, 2002 https://doi.org/10.1023/A:1015231126594
  4. L. Chen and R. Ng, 'On the Marriage of Lp-norms and Edit Distance,' In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.1040-1049, 2004
  5. L. Chen, M. Ozsu, and V. Oria, 'Robust and Fast Similarity Search for Moving Object Trajectories,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.491-502, 2005 https://doi.org/10.1145/1066157.1066213
  6. S. Chu et al., 'Iterative Deepening Dynamic Time Warping for Time Series,' In Proc. SIAM Int'l. Conf. on Data Mining, 2002
  7. E. Dijkstra, 'A Note on Two Problems in Connection with Graphs,' Numeriche Mathematik, Vol.1, pp.269-271, 1959 https://doi.org/10.1007/BF01386390
  8. R. Fagin, R. Kumar, and D. Sivakumar, 'Comparing top k lists,' In Proc. Int'l. Symp. on Discrete algorithms, ACM SIAM, pp.28-36, 2003
  9. FH Oldenburg/Ostfriesland/Wilhelmshaven, Network-based Generator of Moving Objects, http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/, 2005
  10. C. Faloutsos and K. Lin, 'Fastmap: A Fast Algorithm for Indexing, Data-Mining, and Visualization of Traditional and Multimedia Datasets,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.163-174, 1995 https://doi.org/10.1145/223784.223812
  11. D. Goldin, R. Mardales, and G. Nagy, 'In Search of Meaning for Time Series Subsequence Clustering: Matching Algorithms Based on a New Distance Measure,' In Proc. Int'l. Conf. on Information and Knowledge Management, pp.347-356, 2006 https://doi.org/10.1145/1183614.1183666
  12. J. Han and M. Kamber, Data Mining: Concepts and Techniques, Academic Press, 2001
  13. T. Haveliwala, 'Topic-Sensitive PageRank,' In Proc. Int'l. Conf. on World Wide Web, WWW, pp.517-526, 2002
  14. X. Huang et al., 'The Islands Approach to Nearest Neighbor Querying in Spatial Networks,' In Proc. Int'l. Symp. on Spatial and Temporal Databases, SSTD, pp.73-90, 2005 https://doi.org/10.1007/11535331_5
  15. K.-S. Kim et al., 'Fast Indexing and Updating Method for Moving Objects on Road Networks,' In Proc. IEEE Int'l. Conf. on Web Information Systems Engineering, pp.34-42, 2003 https://doi.org/10.1109/WISEW.2003.1286784
  16. M. Kolahdouzan and C. Shahabi, 'Voronoi-Based K-Nearest Neighbor Search for Spatial Network Databases,' In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.840-851, 2004
  17. J. Lee, J. Han, and K. Whang, 'Trajectory Clustering: A Partition-and-Group Framework,' In Proc. Int'l. Conf. on Management of Data archive, ACM SIGMOD, pp.593-604, 2007 https://doi.org/10.1145/1247480.1247546
  18. D. Papadias et al., 'Query Processing in Spatial Network Databases,' In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.802-813, 2003
  19. D. Pfoser, C. Jensen, and Y. Theodoridis, 'Novel Approaches to the Indexing of Moving Object Trajectories,' In Proc. Int'l. Conf. on Very Large Databases, pp.395-406, 2000
  20. D. Pfoser and C. Jensen, 'Indexing of Network Constrained Moving Objects,' In Proc. Int'l. Symp. on Advances in Geographic Information Systems, ACMGIS, pp.25-32, 2003 https://doi.org/10.1145/956676.956680
  21. Y. Theodoridis and M. Nascimento, 'Generating Spatiotemporal Datasets on the WWW,' ACM SIGMOD Record, Vol.29, No.3, pp.39-43, 2000 https://doi.org/10.1145/362084.362104
  22. Y. Theodoridis, J. Silva, and M. Nascimento, 'On the Generation of Spatiotemporal Datasets,' LNCS, pp.147-164, 1999
  23. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos, 'On the Generation of Time -Evolving Regional Data,' GeoInformatica, Vol.3, No.3, pp.207-231, 2002 https://doi.org/10.1023/A:1019705618917
  24. M. Vlachos, G. Kollios, and D. Gunopulos, 'Discovering Similar Multidimensional Trajectories,' In Proc. Int'l. Conf. on Data Engineering, IEEE ICDE, pp.673-684, 2002
  25. O. Wolfson et al., 'Moving Object Databases: Issues and Solutions,' In Proc. Int'l. Conf. on Scientific and Statistical Database Management, SSDBM, pp.111-122, 1998 https://doi.org/10.1109/SSDM.1998.688116
  26. Y. Yanagisawa, J. Akahani, and T. Satoh, 'Shape-Based Similarity Query for Trajectory of Mobile Objects,' In Proc. Int'l. Conf. on Mobile Data Management, pp.63-77, 2003