DocumentCode
1896560
Title
A Novel Spatial Obstructed Distance Using Quantum-Behaved Particle Swarm Optimization
Author
Zhang, Xueping ; Yi, Hong ; Cao, Dan ; Liu, Yawei ; Yang, Tengfei
Author_Institution
Sch. of Inf. Sci. & Eng., Henan Univ. of Technol., Zhengzhou, China
Volume
1
fYear
2009
fDate
10-11 Oct. 2009
Firstpage
233
Lastpage
236
Abstract
Spatial clustering with obstacles constraints (SCOC) has been a new topic in spatial data mining (SDM). Spatial obstructed distance (SOD) is the key to SCOC. The obstacles constraint is generally ignored in computing distance between two points, and it leads to the clustering result which is of no value, so obstructed distance has a great effect upon clustering result. In this paper, we propose a novel spatial obstructed distance using quantum-behaved particle swarm optimization (QPSO) based on grid model to obtain obstructed distance, which is named QPGSOD. The experimental results show that QPGSOD is effective, and it can not only give attention to higher local constringency speed and stronger global optimum search.
Keywords
data mining; particle swarm optimisation; pattern clustering; quantum computing; grid model; quantum-behaved particle swarm optimization; spatial clustering with obstacles constraints; spatial data mining; spatial obstructed distance; Automation; Clustering algorithms; Constraint optimization; Data engineering; Data mining; Educational technology; Information science; Laboratories; Particle swarm optimization; Quantum computing; Grid model; Particle Swarm Optimization; Quantum-Behaved; Spatial Obstructed Distance;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Computation Technology and Automation, 2009. ICICTA '09. Second International Conference on
Conference_Location
Changsha, Hunan
Print_ISBN
978-0-7695-3804-4
Type
conf
DOI
10.1109/ICICTA.2009.64
Filename
5287666
Link To Document