摘要

To address the problem of uncertain trajectories, we suggest a candidate segments approach to uncertain clustering accuracy. This approach is based on a Hilbert curve spatial partitioning to map the trajectory points to spatial regions. Based on candidate regions of uncertain trajectories segments, we construct candidate segments to model uncertain trajectories. For the large number of candidate segments, we use a sketch-based approach in order to create hash-compressed candidate segments representations of the clusters. Based on the sketch, we show a similarity measurement algorithm of incoming uncertain trajectory to clusters. An algorithm for determining the assignment of incoming trajectory to clusters is given. Final, we verify the accuracy and efficiency of the proposed scheme via experiments.

全文