Abstract. Recently, clustering algorithms based on rough set theory have gained increasing attention. For example, Lingras et al. introduced a rough k-means that assigns objects to lower and upper approximations of clusters. The objects in the lower approximation surely belong to a cluster while the membership of the objects in an upper approximation is uncertain. Therefore, the core cluster, defined by the objects in the lower approximation is surrounded by a buffer or boundary set with objects with unclear membership status. In this paper, we introduce an evolutionary rough k-medoid clustering algorithm. Evolutionary rough k-medoid clustering belongs to the families of Lingras' rough k-means and classic k-medoids algorithms. We apply the evolutionary rough k-medoids to synthetic as well as to real data sets and compare the results to Lingras' rough k-means. We also introduce a rough version of the Davies-Bouldin-Index as a cluster validity index for the family of rough clustering algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.