Trajectory clustering: A partition-and-group framework

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 311
  • Download : 0
Existing trajectory clustering algorithms group similar trajectories as a whole, thus discovering common trajectories. Our key observation is that clustering trajectories as a whole could miss common sub-trajectories. Discovering common sub-trajectories is very useful in many applications, especially if we have regions of special interest for analysis. In this paper, we propose a new partition-and-group framework for clustering trajectories, which partitions a trajectory into a set of line segments, and then, groups similar line segments together into a cluster. The primary advantage of this framework is to discover common sub-trajectories from a trajectory database. Based on this partition-and-group framework, we develop a trajectory clustering algorithm TRACLUS. Our algorithm consists of two phases: partitioning and grouping. For the first phase, we present a formal trajectory partitioning algorithm using the minimum description length(MDL) principle. For the second phase, we present a density-based line-segment clustering algorithm. Experimental results demonstrate that TRACLUS correctly discovers common sub-trajectories from real trajectory data.
Publisher
Association for Computing Machinery (ACM)
Issue Date
2007-06-12
Language
ENG
Citation

SIGMOD 2007: ACM SIGMOD International Conference on Management of Data, pp.593 - 604

ISSN
0730-8078
URI
http://hdl.handle.net/10203/12501
Appears in Collection
IE-Conference Papers(학술회의논문)

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0