A DYNAMIC CLUSTERING TECHNIQUE USING MINIMUM- SPANNING TREE
V.M.K. Prasad Goura, Madhusudana Rao Nalluri, M. Rajasekhar Reddy · 2011
Clustering technique is one of the most important and basic tool for data mining. In this paper, we present a clustering algorithm that is inspired by minimum spanning tree. Given the minimum spanning tree over a data set, selects or rejects the edges of the MST in process of forming the clusters, depending on the threshold value. The Algorithm is invoked repeatedly until all the clusters are fully formed. We present experimental results of our algorithm on some synthetic data sets as well as real world data sets.