期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2006
卷号：6
期号：10
页码：109-114
出版社：International Journal of Computer Science and Network Security
摘要：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, we discuss the problem of spatial clustering with obstacles constraints and propose a novel spatial clustering method based on Genetic Algorithms (GAs) and K-Medoids, 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. The results on real datasets show that the GKSCOC algorithm performs better than the IKSCOC algorithm in terms of quantization error
