A Novel Rough-based Leader Clustering Algorithm
一种新的基于粗糙集的leader聚类算法

Objects are partitioned into clusters with crisp boundaries in the conventional algorithms. However,clusters do not necessarily have crisp boundaries. Rough set is represented with lower-bound and upper-bound,and is good for the case. At present,there have been some typical algorithms,such as the rough-based k-means clustering algorithm and the rough-based leader clustering algorithm. In this paper,a novel rough-based leader clustering algorithm is proposed,since there are some disadvantages in the RFA algo...