Swarm: Mining relaxed temporal moving object clusters

Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays

Research output: Contribution to journalArticle

215 Citations (Scopus)

Abstract

Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find 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 themoving objects that move within arbitrary shape of clusters for certain timestamps that are possibly nonconsecutive. The goal of our paper is to find 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-thefly. Empirical studies on the real data as well as large synthetic data demonstrate the effectiveness and efficiency of our methods.

Original languageEnglish (US)
Pages (from-to)723-734
Number of pages12
JournalProceedings of the VLDB Endowment
Volume3
Issue number1
DOIs
StatePublished - Sep 2010

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Li, Zhenhui ; Ding, Bolin ; Han, Jiawei ; Kays, Roland. / Swarm : Mining relaxed temporal moving object clusters. In: Proceedings of the VLDB Endowment. 2010 ; Vol. 3, No. 1. pp. 723-734.
@article{21239aae9f9c48289ae9200ef33f46d4,
title = "Swarm: Mining relaxed temporal moving object clusters",
abstract = "Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find 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 themoving objects that move within arbitrary shape of clusters for certain timestamps that are possibly nonconsecutive. The goal of our paper is to find 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-thefly. Empirical studies on the real data as well as large synthetic data demonstrate the effectiveness and efficiency of our methods.",
author = "Zhenhui Li and Bolin Ding and Jiawei Han and Roland Kays",
year = "2010",
month = "9",
doi = "10.14778/1920841.1920934",
language = "English (US)",
volume = "3",
pages = "723--734",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "Very Large Data Base Endowment Inc.",
number = "1",

}

Swarm : Mining relaxed temporal moving object clusters. / Li, Zhenhui; Ding, Bolin; Han, Jiawei; Kays, Roland.

In: Proceedings of the VLDB Endowment, Vol. 3, No. 1, 09.2010, p. 723-734.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Swarm

T2 - Mining relaxed temporal moving object clusters

AU - Li, Zhenhui

AU - Ding, Bolin

AU - Han, Jiawei

AU - Kays, Roland

PY - 2010/9

Y1 - 2010/9

N2 - Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find 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 themoving objects that move within arbitrary shape of clusters for certain timestamps that are possibly nonconsecutive. The goal of our paper is to find 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-thefly. Empirical studies on the real data as well as large synthetic data demonstrate the effectiveness and efficiency of our methods.

AB - Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find 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 themoving objects that move within arbitrary shape of clusters for certain timestamps that are possibly nonconsecutive. The goal of our paper is to find 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-thefly. Empirical studies on the real data as well as large synthetic data demonstrate the effectiveness and efficiency of our methods.

UR - http://www.scopus.com/inward/record.url?scp=80052749496&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052749496&partnerID=8YFLogxK

U2 - 10.14778/1920841.1920934

DO - 10.14778/1920841.1920934

M3 - Article

AN - SCOPUS:80052749496

VL - 3

SP - 723

EP - 734

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 1

ER -