A novel spatial clustering with obstacles constraints based on PNPSO and K-medoids

  • Xueping Zhang*
  • , Haohua Du
  • , Tengfei Yang
  • , Guangcai Zhao
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose a novel Spatial Clustering with Obstacles Constraints (SCOC) based on Dynamic Piecewise Linear Chaotic Map and Dynamic Nonlinear Particle Swarm Optimization (PNPSO) and K-Medoids, which is called PNPKSCOC. The contrastive experiments show that PNPKSCOC is effective and has better practicalities, and it performs better than PSO K-Medoids SCOC in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC.

Original languageEnglish
Title of host publicationAdvances in Swarm Intelligence - First International Conference, ICSI 2010, Proceedings
Pages476-483
Number of pages8
EditionPART 2
DOIs
StatePublished - 2010
Event1st International Conference on Advances in Swarm Intelligence, ICSI 2010 - Beijing, China
Duration: 12 Jun 201015 Jun 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6146 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Conference on Advances in Swarm Intelligence, ICSI 2010
Country/TerritoryChina
CityBeijing
Period12/06/1015/06/10

Keywords

  • K-Medoids
  • Nonlinear Inertia Weights
  • Obstacles Constraints
  • Particle Swarm Optimization
  • Piecewise Linear Chaotic Map
  • Spatial Clustering

Fingerprint

Dive into the research topics of 'A novel spatial clustering with obstacles constraints based on PNPSO and K-medoids'. Together they form a unique fingerprint.

Cite this