Spatial Clustering With Obstacles Constraints Based on Genetic Algorithms and K-Medoids

Spatial clustering has been an active research area in Spatial Data Mining (SDM). Many methods on spatial clustering have been proposed in the literature, but few of them have taken into account constraints that may be present in the data or constraints on the clustering. In this paper, the authors discuss the problem of spatial clustering with obstacles constraints and propose a novel spatial clustering method based on Genetic Algorithms (GAs) and KMedoids, called GKSCOC, which aims to cluster spatial data with obstacles constraints. The GKSCOC algorithm can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints and practicalities of spatial clustering.