Skip to main content

A Novel Spatial Obstructed Distance by Dynamic Piecewise Linear Chaotic Map and Dynamic Nonlinear PSO

  • Conference paper
  • 2182 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6146))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Li, D.R., Wang, S.L., Li, D.Y.: Spatial data mining theory applications. Science Publishing House (2006)

    Google Scholar 

  2. Tung, A.K.H., Han, J., Lakshmanan, L.V.S., Ng, R.T.: Constraint-based clustering in large database. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 405–419. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Lozano-perez, T.: Automatic planning of manipulator transfer movements. IEEE Trans. on Sys. Man an Cyb., 681–698 (1981)

    Google Scholar 

  4. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik, 269–271 (1959)

    Google Scholar 

  5. Chabini, I., Lan, S.: Adaptations of the algorithm for the computation of fartest paths in deterministic discrete-time dynamic networks. IEEE Transactions on intellingent transportation systems, 60–74 (2002)

    Google Scholar 

  6. Liu, H.L., Su, R.J., Gao, Y.: Coordinate Particle Swarm Optimization with Dynamic Piecewise-mapped and Nonlinear Inertia Weights. In: Proceedings of the 2009 International Conference on Artificial Intelligence and Computational Intelligence (AICI 2009), Shanghai China, pp. 124–128 (2009)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, vol. IV, pp. 1942–1948 (1995)

    Google Scholar 

  8. Frans, V.D.B.: An Analysis of Particle Swarm Optimizers. Ph.D. thesis, University of Pretoria (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, X., Liu, Y., Wang, J., Du, H. (2010). A Novel Spatial Obstructed Distance by Dynamic Piecewise Linear Chaotic Map and Dynamic Nonlinear PSO. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics