A Novel Algorithm for Dual Similarity Clusters Using Minimum Spanning Tree

摘要

The minimum spanning tree clustering algorithm is capable of detecting clusters with irregular boundaries. In this paper we propose minimum spanning trees based clustering algorithm. The algorithm produces k clusters with center and it also creates a dend