This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
A Trajectory Clustering Algorithm Based on Symmetric Neighborhood
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Trajectory clustering is attractive for the task of class identification in spatial database. Existing trajectory clustering algorithm TRCLUS uses global parameters to discover common trajectories. However, it can not discover small and dense clusters and be sensitive to two input parameters. Based on the partition-and-group framework, we propose a simple but effective trajectory clustering algorithm based on symmetric neighborhood named BSNTC, which needs only one input parameter which eases the sensitivity of parameters in a certain extent. The proposed measure considers both neighbors and reverse neighbors of trajectories when estimating its density distribution. Also, we use an accumulator without calculating influence outlier of each trajectory to reduce the computation cost and corresponding storage cost. A comprehensive performance evaluation and analysis shows that our method is not only efficient in the computation but also effective in arbitrary shape and different densities trajectory databases.
Index Terms:
Trajectory Clustering, Symmetric Neighborhood, Neighbors and Reverse Neighbors
Citation:
Yu Zhang, Dechang Pi, "A Trajectory Clustering Algorithm Based on Symmetric Neighborhood," csie, vol. 3, pp.640-645, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.