Issue No. 09 - September (2007 vol. 19)
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.
Spatial databases, Temporal databases, Clustering
D. Lin, B. C. Ooi and C. S. Jensen, "Continuous Clustering of Moving Objects," in IEEE Transactions on Knowledge & Data Engineering, vol. 19, no. , pp. 1161-1174, 2007.