By Topic

Hybrid Particle Swarm Optimization with GA Mutation to Solve Spatial Clustering with Obstacles Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Xueping Zhang ; Comput. Sci. & Eng., Henan Univ. of Technol., Zhengzhou ; Yixun Liu ; Jiayao Wang ; Gaofeng Deng
more authors

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).

Published in:

Computational Intelligence and Design, 2008. ISCID '08. International Symposium on  (Volume:1 )

Date of Conference:

17-18 Oct. 2008