Abstract: 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

Key words: Clustering, Rough set, K-means algorithm, Leader algorithm