A novel spatial obstructed distance by dynamic piecewise linear chaotic map and dynamic nonlinear PSO

Authors:
Xueping Zhang;Yawei Liu;Jiayao Wang;Haohua Du
Affiliations:
,School of Information Science and Engineering, Henan University of Technology, Zhengzhou, China;School of Information Science and Engineering, Henan University of Technology, Zhengzhou, China;,School of Information Science and Engineering, Henan University of Technology, Zhengzhou, China;School of computer science and engineering, Beihang University, Beijing, China
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Year:
2010

Citing 3
Cited 0

Constraint-based clustering in large databases

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Coordinate Particle Swarm Optimization with Dynamic Piecewise-mapped and Nonlinear Inertia Weights

AICI '09 Proceedings of the 2009 International Conference on Artificial Intelligence and Computational Intelligence - Volume 01
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

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 Dynamic Piecewise Linear Chaotic Map and Dynamic Nonlinear Particle Swarm Optimization (PNPSO) based on Grid model to obtain obstructed distance, which is named PNPGSOD, it is not only simple and easy to actualize, but also convergent rapidly, the experimental results are provided to verify the effectiveness and practicability.