Clustering with a minimum spanning tree of scale-free-like structure
In this study a novel approach to graph-theoretic clustering is presented. A clustering algorithm which uses a structure called scale-free minimum spanning tree is presented and its performance is compared with standard minimum spanning tree clustering and k-means methods. The results show that the proposed method is a potential clustering procedure after some further analysis is done.
minimum spanning tree graph-theoretic clustering scale-free networks