Local Density-based Hierarchical Clustering using Minimum Spanning Tree

Abstract

In this paper, we propose a clustering algorithm to find clusters of different sizes, shapes and densities. Density and Hierarchical based approaches are adopted in the algorithm using Minimum Spanning Tree, resulting in a new algorithm – Local Density-based Hierarchical Clustering Algorithm using Minimum Spanning Tree (LDHCMST). The algorithm is divided into two stages. In the first stage, local density is estimated at each data point. In the second stage, hierarchical approach is used by merging clusters according to the cluster distance. The proposed algorithm improves the effectiveness of clustering result in which data are distributed in different shapes and different density, and that it can get a better clustering efficiency.