4.4 Article

Swarm: Mining Relaxed Temporal Moving Object Clusters

期刊

PROCEEDINGS OF THE VLDB ENDOWMENT
卷 3, 期 1, 页码 723-734

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.14778/1920841.1920934

关键词

-

资金

  1. Boeing company
  2. NSF [BD1-07-Movehonk, CNS-0931975]
  3. U.S. Air Force Office of Scientific Research MIMI [FA9550-08-1-0265]
  4. U.S. Army Research Laboratory [W911NF-09-2-0053]
  5. Direct For Computer & Info Scie & Enginr
  6. Div Of Information & Intelligent Systems [1017362] Funding Source: National Science Foundation

向作者/读者索取更多资源

Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to filed the moving objects that travel together. Existing methods put a strong constraint in defining moving object cluster, that they require the moving objects to stick together for consecutive timestamps. Our key observation is that the moving objects in a cluster may actually diverge temporarily and congregate at certain timestamps. Motivated by this, we propose the concept of swarm which captures the moving objects that move within arbitrary shape of clusters for certain timestamps that are possibly nonconsecutive. The goal of our paper is to rind all discriminative swarms, namely closed swarm. While the search space for closed swarms is prohibitively huge, we design a method, ObjectGrowth, to efficiently retrieve the answer. In ObjectGrowth, two effective pruning strategies are proposed to greatly reduce the search space and a novel closure checking rule is developed to report closed swarms on-the fly. Empirical studies on the real data as well as large synthetic data demonstrate the effectiveness and efficiency of our methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据