TGCR:an Efficient Algorithm for Mining Swarm in Trajectory Databases
Advance of positioning technology have enabled mass trajectory dation of moving objects obtain more convenient.These moving objects always exists special behaviour correlation on spatio-temporal characteristics, and this information is important in somedomains, such as prisoner monitoring, factory management, and the study of social behaviour, Many studies have focused on relative motion pattern mining algorithm, but the inefficiency of mining algorithms is still a problem. In this paper, we propose an efficient algorithm, Time Growth Cluster Recombinant algorithm(TGCR),for discovering swarm pattern, which is a group of relaxed aggregation moving objects. The algorithm construct maximum moving objectsets according to the clustering result of each timestamp, and record corresponding maximum time set of the maximum moving objectsets over time. TGCRemploys three update rules to update candidate swarm list at each timestamp and proposes an insert rule to greatly reduce the redundant candidalt items in the list. In addition, closure checking rule is presented for obtaining closed swarm patterns on fly. We performed an experimental evaluation of the correctness and efficiency of our algorithm using large synthetic data. The results of Experiments demonstrate that TGCRdiscovers swarm patterns as same as objectGrowth algorithm and our algorithm have higher performance than objectGrowth. The further algorithm enhanced can be applicable to real-time trajectory data processing system.
data mining motion patterns mining swarm moving objects trajectory database
Yanwei Yu Qin Wang Jun Kuang Jie He
School of computer&communication engineering,University of Science&Technology Beijing No 30th XueYuan RD,Haidian District,Beijing,China
国际会议
福州
英文
90-95
2011-06-29（万方平台首次上网日期，不代表论文的发表时间）