Spatial Clustering with Obstacles Constraints by Hybrid Particle Swarm Optimization with GA Mutation | SpringerLink
Skip to main content

Spatial Clustering with Obstacles Constraints by Hybrid Particle Swarm Optimization with GA Mutation

  • Conference paper
Advances in Neural Networks - ISNN 2008 (ISNN 2008)

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

Included in the following conference series:

  • 3069 Accesses

Abstract

In this paper, we propose a novel Spatial Clustering with Obstacles Constraints (SCOC) by an advanced Hybrid Particle Swarm Optimization (HPSO) with GA mutation. In the process of doing so, we first use HPSO to get obstructed distance, and then we developed a novel HPKSCOC based on HPSO and K-Medoids to cluster spatial data with obstacles constraints. The experimental results show that the HPKSCOC 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 Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 14299
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Tung, A.K.H., Hou, J., Han, J.: Spatial Clustering in the Presence of Obstacles. In: 2001 International Conference on Data Engineering, pp. 359–367 (2001)

    Google Scholar 

  2. Estivill-Castro, V., Lee, I.J.: AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles. In: 2000 International Workshop on Temporal, Spatial and Spatial-Temporal Data Mining, pp. 133–146 (2000)

    Google Scholar 

  3. Zaïane, O.R., Lee, C.H.: Clustering Spatial Data When Facing Physical Constraints. In: The 2002 IEEE International Conference on Data Mining, pp. 737–740 (2002)

    Google Scholar 

  4. Wang, X., Rostoker, C., Hamilton, H.J.: DBRS+: Density-Based Spatial Clustering in the Presence of Obstacles and Facilitators (2004), ftp.cs.uregina.ca/Research/Techreports/2004-09.pdf

    Google Scholar 

  5. Zhang, X., Wang, J., Wu, F., Fan, Z., Li, X.: A Novel Spatial Clustering with Obstacles Constraints Based on Genetic Algorithms and K-Medoids. In: The Sixth International Conference on Intelligent Systems Design and Applications, pp. 605–610 (2006)

    Google Scholar 

  6. Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: The Sixth International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)

    Google Scholar 

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

    Google Scholar 

  8. Bergh, F.V.D.: An Analysis of Particle Swarm Optimizers. Ph.D. Thesis, University of Pretoria (2001)

    Google Scholar 

  9. Esmin, A.A.A., Lambert-Torres, G., Alvarenga, G.B.: Hybrid Evolutionary Algorithm Based on PSO and GA Mutation. In: The 6th International Conference on Hybrid Intelligent Systems, p. 57 (2006)

    Google Scholar 

  10. Zhao, F., Zhang, Q., Wang, L.: A Scheduling Holon Modeling Method with Petri Net and its Optimization with a Novel PSO-GA Algorithm. In: The 10th International Conference on Computer Supported Cooperative Work in Design, pp. 1302–1307 (2006)

    Google Scholar 

  11. Qin, Y., Sun, D., Li, N., Cen, Y.: Path Planning for Mobile Robot Using the Particle Swarm Optimization with Mutation Operator. In: The Third International Conference on Machine Learning and Cybernetics, pp. 2473–2478 (2004)

    Google Scholar 

  12. Habib, M.K., Asama, H.: Efficient Method to Generate Collision Free Paths for Autonomous Mobile Robot Based on New Free Space Structuring Approach. In: 1991 International Workshop on Intelligent Robots and Systems, pp. 563–567 (1991)

    Google Scholar 

  13. Van der Merwe, D.W., Engelbrecht, A.P.: Data Clustering Using Particle Swarm Optimization. In: IEEE Congress on Evolutionary Computation 2003, pp. 215–220 (2003)

    Google Scholar 

  14. Xiao, X., Dow, E.R., Eberhart, R., Miled, Z.B., Oppelt, R.J.: Gene Clustering Using Self-Organizing Maps and Particle Swarm Optimization. In: The 2003 International Conference on Parallel and Distributed Processing Symposium, p. 154 (2003)

    Google Scholar 

  15. Cui, X., Potok, T.E., Palathingal, P.: Document Clustering Using Particle Swarm Optimization. In: 2005 IEEE on Swarm Intelligence Symposium, pp. 185–191 (2005)

    Google Scholar 

  16. Omran, M.G.H.: Particle Swarm Optimization Methods for Pattern Recognition and Image Processing. Ph.D. Thesis, University of Pretoria (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, X., Yin, H., Zhang, H., Fan, Z. (2008). Spatial Clustering with Obstacles Constraints by Hybrid Particle Swarm Optimization with GA Mutation. In: Sun, F., Zhang, J., Tan, Y., Cao, J., Yu, W. (eds) Advances in Neural Networks - ISNN 2008. ISNN 2008. Lecture Notes in Computer Science, vol 5263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87732-5_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87732-5_64

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87731-8

  • Online ISBN: 978-3-540-87732-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics