DocumentCode
2021008
Title
Hybrid Particle Swarm Optimization with GA Mutation to Solve Spatial Clustering with Obstacles Constraints
Author
Zhang, Xueping ; Liu, Yixun ; Wang, Jiayao ; Deng, Gaofeng ; Zhang, Chuang
Author_Institution
Comput. Sci. & Eng., Henan Univ. of Technol., Zhengzhou
Volume
1
fYear
2008
fDate
17-18 Oct. 2008
Firstpage
299
Lastpage
302
Abstract
Spatial clustering with obstacles constraints (SCOC) has been a new topic in spatial data mining (SDM). In this paper, we propose an advanced hybrid particle swarm optimization (HPSO) with GA mutation for SCOC. In the process of doing so, we first use HPSO to get obstructed distance, and then we developed a novel HPKSCOC based on HPSO and K-Medoids to cluster spatial data with obstacles constraints. The experimental results demonstrate the effectiveness and efficiency of the proposed method, which performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).
Keywords
data mining; genetic algorithms; particle swarm optimisation; pattern clustering; K-Medoids; genetic algorithm mutation; hybrid particle swarm optimization; obstacles constraint; spatial clustering; spatial data mining; Bridges; Computational intelligence; Computer science; Data engineering; Data mining; Design engineering; Equations; Genetic mutations; Particle swarm optimization; Quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Design, 2008. ISCID '08. International Symposium on
Conference_Location
Wuhan
Print_ISBN
978-0-7695-3311-7
Type
conf
DOI
10.1109/ISCID.2008.115
Filename
4725613
Link To Document