首页> 外文会议>Data Engineering (ICDE), 2012 IEEE 28th International Conference on >On Discovery of Traveling Companions from Streaming Trajectories
【24h】

On Discovery of Traveling Companions from Streaming Trajectories

机译:从流轨迹中发现旅行伴游

获取原文
获取原文并翻译 | 示例

摘要

The advance of object tracking technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data stream. In this study, we investigate the problem of discovering object groups that travel together (i.e., traveling companions) from trajectory stream. Such technique has broad applications in the areas of scientific study, transportation management and military surveillance. To discover traveling companions, the monitoring system should cluster the objects of each snapshot and intersect the clustering results to retrieve moving-together objects. Since both clustering and intersection steps involve high computational overhead, the key issue of companion discovery is to improve the algorithm's efficiency. We propose the models of closed companion candidates and smart intersection to accelerate data processing. A new data structure termed traveling buddy is designed to facilitate scalable and flexible companion discovery on trajectory stream. The traveling buddies are micro-groups of objects that are tightly bound together. By only storing the object relationships rather than their spatial coordinates, the buddies can be dynamically maintained along trajectory stream with low cost. Based on traveling buddies, the system can discover companions without accessing the object details. The proposed methods are evaluated with extensive experiments on both real and synthetic datasets. The buddy-based method is an order of magnitude faster than existing methods. It also outperforms other competitors with higher precision and recall in companion discovery.
机译:对象跟踪技术的进步导致以轨迹数据流的形式收集大量的时空数据。在这项研究中,我们调查了从轨迹流中发现一起旅行的对象组(即旅行的同伴)的问题。这种技术在科学研究,运输管理和军事监视领域具有广泛的应用。为了发现旅行的同伴,监视系统应将每个快照的对象聚类,并与聚类结果相交以检索一起移动的对象。由于聚类和相交步骤都涉及大量的计算开销,因此伴随发现的关键问题是提高算法的效率。我们提出了封闭的同伴候选者和智能路口的模型,以加快数据处理。设计了一种称为旅行伙伴的新数据结构,以促进在轨迹流上进行可伸缩且灵活的同伴发现。行进的伙伴是紧密结合在一起的对象的微型组。通过仅存储对象关系而不是它们的空间坐标,可以以低成本动态地沿着轨迹流维护伙伴。基于旅行伙伴,系统可以在不访问对象详细信息的情况下发现同伴。所提出的方法在真实数据集和合成数据集上均进行了广泛的实验评估。基于伙伴的方法比现有方法快一个数量级。它还在同伴发现方面具有更高的精度和召回率,优于其他竞争对手。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号