李雯, 夏士雄, 张磊. VR-tree索引结构的轨迹Stop区域快速发现[J]. 微电子学与计算机, 2011, 28(8): 59-62.
引用本文: 李雯, 夏士雄, 张磊. VR-tree索引结构的轨迹Stop区域快速发现[J]. 微电子学与计算机, 2011, 28(8): 59-62.
LI Wen, XIA Shi-xiong, ZHANG Lei. Using VR-tree Index to Fast Find Trajectory Stop Regions[J]. Microelectronics & Computer, 2011, 28(8): 59-62.
Citation: LI Wen, XIA Shi-xiong, ZHANG Lei. Using VR-tree Index to Fast Find Trajectory Stop Regions[J]. Microelectronics & Computer, 2011, 28(8): 59-62.

VR-tree索引结构的轨迹Stop区域快速发现

Using VR-tree Index to Fast Find Trajectory Stop Regions

  • 摘要: 移动对象轨迹stop区域发现是轨迹数据分析的一个重要方面.提出基于VR-tree的轨迹stop区域快速发现方法.首先选择一条轨迹使用DBSCAN算法得到stop区域,把它们作为其他轨迹的stop区域候选,构建VR-tree;然后,对于剩余每条轨迹,先与VR-tree比较,找到与其中的stops相交的区域,标记轨迹包含在这些区域中的点,再对轨迹中其他点使用DBSCAN算法得到新的stops,并将它们作为其他轨迹的候选插入到VR-tree中.每条轨迹的stops由与VR-tree比较获得的stops和新stops区域按照区域覆盖率合并得到.实验使用真实数据集,证明本方法与基于密度的轨迹stop发现方法相比,不仅能很好发现轨迹stops,而且效率提高近60%.

     

    Abstract: Discovering stop regions is an important topic of trajectory data analysis.A novel method using VR-tree index structure is proposed for fast extracting trajectory stops.Firstly,one trajectory is selected and whose stops are found using DBSCAN algorithm,then VR-tree is built according to these stops which are considered as candidate stops of other trajectories.Then,for rest trajectory,compare with the stops storied in VR-tree to find intersecting parts,mark these points which are contained in these regions.Other points of the trajectory are used to find new stops through DBSCAN algorithm,which will be inserted into VR-tree as the candidate of other trajectories.Stops of trajectory are obtained by merging the stops which are composed of two parts,one comes from the results of comparing with VR-tree,and another is the new stops,according to the coverage with each other.Experiments using real data show that comparing with the density based methods,this method not only can find stops very well,but increase efficient nearly 60%.

     

/

返回文章
返回