Continuous Clustering of Moving Objects

This paper considers the problem of efficiently maintaining a clustering of a dynamic set of data points that move continuously in two-dimensional Euclidean space. This problem has received little attention and introduces new challenges to clustering. The paper proposes a new scheme that is capable...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering 2007-09, Vol.19 (9), p.1161-1174
Main Authors: Jensen, C.S., Dan Lin, Beng Chin Ooi
Format: Article
Language:English
Subjects:
Applied sciences
Clustering
Clustering algorithms
Clusters
Computer science
control theory
systems
Data analysis
Data compression
Data points
Data processing. List processing. Character string processing
Data structures
Deletion
Dynamics
Exact sciences and technology
Image processing
Information systems. Data bases
Insertion
Memory organisation. Data processing
Pattern recognition
Personal digital assistants
Proposals
Software
Spatial databases
Temporal databases
Two dimensional
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers the problem of efficiently maintaining a clustering of a dynamic set of data points that move continuously in two-dimensional Euclidean space. This problem has received little attention and introduces new challenges to clustering. The paper proposes a new scheme that is capable of incrementally clustering moving objects. This proposal employs a notion of object dissimilarity that considers object movement across a period of time, and it employs clustering features that can be maintained efficiently in incremental fashion. In the proposed scheme, a quality measure for incremental clusters is used for identifying clusters that are not compact enough after certain insertions and deletions. An extensive experimental study shows that the new scheme performs significantly faster than traditional ones that frequently rebuild clusters. The study also shows that the new scheme is effective in preserving the quality of moving-object clusters.
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2007.1054