Spatial clustering with constraints has been a new topic in spatial data mining. A novel Spatial Clustering with Obstacles Constraints (SCOC) by dynamic piecewise-mapped and nonlinear inertia weights particle swarm optimization is proposed in this paper. The experiments show that the 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; and it performs better than PSO K-Medoids SCOC in terms of quantization error and has higher constringency speed than Genetic KMedoids SCOC. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Zhang, X., Du, H., & Wang, J. (2010). Spatial Clustering with Obstacles Constraints by dynamic piecewise-mapped and nonlinear inertia weights PSO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6118 LNAI, pp. 254–261). https://doi.org/10.1007/978-3-642-13657-3_29
Mendeley helps you to discover research relevant for your work.