跳到主要导航 跳到搜索 跳到主要内容

Spatial Clustering with Obstacles Constraints by dynamic piecewise-mapped and nonlinear inertia weights PSO

  • Xueping Zhang*
  • , Haohua Du
  • , Jiayao Wang
  • *此作品的通讯作者
  • Henan University of Technology
  • Information Engineering University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Spatial clustering with constraints has been a new topic in spatial data mining. A novel Spatial Clustering with Obstacles Constraints (SCOC) by dynamic piecewise-mapped and nonlinear inertia weights particle swarm optimization is proposed in this paper. The experiments show that the algorithm 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; and it performs better than PSO K-Medoids SCOC in terms of quantization error and has higher constringency speed than Genetic KMedoids SCOC.

源语言英语
主期刊名Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings
254-261
页数8
版本PART 1
DOI
出版状态已出版 - 2010
活动14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010 - Hyderabad, 印度
期限: 21 6月 201024 6月 2010

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
编号PART 1
6118 LNAI
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010
国家/地区印度
Hyderabad
时期21/06/1024/06/10

指纹

探究 'Spatial Clustering with Obstacles Constraints by dynamic piecewise-mapped and nonlinear inertia weights PSO' 的科研主题。它们共同构成独一无二的指纹。

引用此