Indexed by:
Abstract:
The paper proposed a novel Ant Colony Optimization (ACO) and Quantum Particle Swarm Optimization (QPSO) method for Spatial Clustering with Obstacles Constraints (SCOC). We first developed AQPGSOD using ACO and QPSO based on grid model to obtain obstructed distance, and then we presented a new QPKSCOC based on QPSO and K-Medoids to cluster spatial data with obstacles. The experimental results show that AQPGSOD is effective, and QPKSCOC 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. © 2009 IEEE.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
Year: 2009
Volume: 1
Page: 154-158
Language: English
Cited Count:
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2
Affiliated Colleges: