On a Distributed Approach for Density-Based Clustering

Efficient extraction of useful knowledge from very large datasets is still a challenge, mainly when the datasets are distributed, heterogeneous and of different quality depending of the various nodes involved. To reduce the overhead cost due to communications, most of the existing distributed clustering approaches generates global models by aggregating local results obtained on each individual node. The complexity and quality of solutions depend highly on the quality of the aggregation. In this respect, we propose distributed density-based clustering that both reduces the communication overheads and improves the quality of the global models by considering the shapes of local clusters. From preliminary results we show that this algorithm is very promising.