By Topic

Clustering Spatial Data with Obstacles Using Improved Ant Colony Optimization and Hybrid Particle Swarm Optimization

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 ; Qingzhou Zhang ; Zhongshan Fan ; 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 improved ant colony optimization (IACO) and hybrid particle swarm optimization (HPSO) method for SCOC. In the process of doing so, we first use IACO to obtain the shortest obstructed distance, which is an effective method for arbitrary shape obstacles, and then we develop a novel HPKSCOC based on HPSO and K-Medoids to cluster spatial data with obstacles, which can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints.

Published in:

Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on  (Volume:2 )

Date of Conference:

18-20 Oct. 2008