Year: 2007
Type: report
Abstract: Existing trajectory clustering algorithms group similar tra-jectories 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, espe-cially 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 seg-ments together into a cluster. The primary advantage of this framework is to discover common sub-trajectories from a tra-jectory database. Based on this partition-and-group frame-work, we develop a trajectory clustering algorithm TRA-CLUS. Our algorithm consists of two phases: partitioning and grouping. For the first phase, we present a formal trajec-tory partitioning algorithm using the minimum description length (MDL) principle. For the second phase, we present a density-based line-segment clustering algorithm. Exper-imental results demonstrate that TRACLUS correctly dis-covers common sub-trajectories from real trajectory data.
Authors: Jae-gil Lee, Jiawei Han, Kyu-young Whang
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6996850568
