Sequential adding clustering algorithm

The sequential adding clustering algorithm herein presented adds cluster centers, assigns points to clusters, merges and removes clusters (deleting their centers) iteratively in order to find the optimal cluster partition. Additionally, the algorithm optimizes the cluster center positions by minimizing the ’sum of within-cluster distances’. The preliminary clustering results show that the algorithm is effective and efficient.