A new distributed algorithm for large data clustering

Abstract

This paper presents a new distributed data clustering algorithm, which operates successfully on huge data sets. The algorithm is designed based on a classical clustering algorithm, called PAM [8, 9] and a spanning tree-based clustering algorithm, called Clusterize [3]. It out- performs its counterparts both in clustering quality and execution time. The algorithm also better utilizes the computing resources associated with the clusterization process. The algorithm operates in linear time.