Spatial clustering algorithm with obstacles constraints by quantum particle swarm optimization and K-Medoids

The classical K-Medoids algorithm is easily trapped into local extremum and is sensitive to initialization. After analyzed the existing algorithms of spatial clustering with obstacles constraints, the paper proposed a new spatial clustering algorithm with obstacles constraints combined QPSO with K-M...

Celý popis

Podrobná bibliografia

Vydané v:	2010 Second International Conference on Computational Intelligence and Natural Computing Ročník 2; s. 105 - 108
Hlavní autori:	Yang Teng-Fei, Zhang Xue-Ping
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2010
Predmet:	Algorithm design and analysis Clustering algorithms Convergence K-Medoids algorithm obstacle constraints Optimization Particle swarm optimization Partitioning algorithms QPSO algorithm spatial clustering Sun
ISBN:	9781424477050, 1424477050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!