摘要
提出了一种挖掘移动对象运动轨迹中频繁轨迹集合的高效算法。算法使用了称为轨迹标识列表的中间量,通过对列表元素的交集来计算轨迹的支持度。算法只需要对数据库进行一次扫描,避免了多次扫描数据库带来的时间消耗,大大提高了挖掘效率。
This paper presents a efficient algorithm to mine frequent movement patterns,which is the set of the frequent trajectories of moving objects.In order to obtain the supports of trajectories,this algorithm uses a intermediate variable called trajectory id list and computes the intersection of them.The database only needs to be scanned once,as a result,the time cost of database scanning could be reduced and the mining efficiency would be increased.
出处
《微计算机信息》
2010年第30期152-153,62,共3页
Control & Automation
关键词
移动对象
频繁轨迹
轨迹标识列表
Moving object
frequent trajectories
trajectory id list