Huang, Guangyan, Zhang, Yanchun, He, Jing and Ding, Zhiming (2011) Efficiently Retrieving Longest Common Route Patterns of Moving Objects By Summarizing Turning Regions. In: Advances in Knowledge Discovery and Data Mining: 15th Pacific-Asia Conference, PAKDD 2011, Shenzhen, China, May 24-27, 2011, Proceedings, Part I. Huang, Joshua Zhexue, Cao, Longbing and Srivastava, Jaideep, eds. Lecture Notes in Computer Science . Springer, Heidelberg, pp. 375-386.

Abstract

The popularity of online location services provides opportunities to discover useful knowledge from trajectories of moving objects. This paper addresses the problem of mining longest common route (LCR) patterns. As a trajectory of a moving object is generally represented by a sequence of discrete locations sampled with an interval, the different trajectory instances along the same route may be denoted by different sequences of points (location, timestamp). Thus, the most challenging task in the mining process is to abstract trajectories by the right points. We propose a novel mining algorithm for LCR patterns based on turning regions (LCRTurning), which discovers a sequence of turning regions to abstract a trajectory and then maps the problem into the traditional problem of mining longest common subsequences (LCS). Effectiveness of LCRTurning algorithm is validated by an experimental study based on various sizes of simulated moving objects datasets.

Search Google Scholar

Repository staff login