A Dynamic Clustering Algorithm for Mobile Objects

Authors:
Dominique Fournier;Gaële Simon;Bruno Mermet
Affiliations:
LITIS EA 4051, 25 rue Philippe Lebon, BP 540 76058 Le Havre cedex,;GREYC CNRS UMR 6072, 6 Boulevard du Maréchal Juin 14050 CAEN cedex,;GREYC CNRS UMR 6072, 6 Boulevard du Maréchal Juin 14050 CAEN cedex,
Venue:
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Year:
2007

Citing 7
Cited 1

The dynamics of collective sorting robot-like ants and ant-like robots

Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Requirements for clustering data streams

ACM SIGKDD Explorations Newsletter
Clustering data streams

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
TECNO-STREAMS: Tracking Evolving Clusters in Noisy Data Streams with a Scalable Immune System Learning Model

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Clustering moving objects

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Evolutionary clustering

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining

Dynamic k-means: a clustering technique for moving object trajectories

International Journal of Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a multiagent algorithm for dynamic clustering is presented. This kind of clustering is intended to manage mobile data and so, to be able to continuously adapt the built clusters. First of all, potential applications of this algorithm are presented. Then the specific constraints for this kind of clustering are studied. A multiagent architecture satisfying these constraints is described. It combines an ants algorithm with a cluster agents layer which are executed simultaneously. Finally, the first experimental results of our work are presented.