Skip to main content

A Spatial Clustering Algorithm Based on SOFM

  • Conference paper
Advanced Data Mining and Applications (ADMA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4093))

Included in the following conference series:

  • 2822 Accesses

Abstract

This paper analyses some important characteristics of self-organization map network. Based on this analysis, we propose a method that can overcome the insufficiencies of single self-organization feature map (SOFM) network. The implementation detail of our proposed self-organizing feature map network algorithm is also discussed. Our proposed algorithm has a number of advantages. It can overcome the insufficiencies identified in other similar clustering algorithms. It is able to find clusters in different shapes and is insensitive to input data sequence. It can process noisy and multi-dimensional data well in multi-resolutions. Furthermore the proposed clustering method can find the dense or sparse areas with different data distributions. It will be convenient to discover the distribution mode and interesting relationship among data. We have conducted numerous experiments in order to justify this novel ideal of spatial data clustering. It has been shown that the proposed method can be applied to spatial clustering well.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ordonez, C., Omiecinski, E.: Discovery association rules based on image content. In: Proceedings of the 1999 IEEE Forum on Research and Technology Advances in Digital Libraries, Baltimore, MD, May 19-21, 1999, pp. 38–49 (1999)

    Google Scholar 

  2. Bloch, I.: Fuzzy relative position between objects in image processing: A morphological approach. IEEE Transactions on Patten Analysis and Machine Intelligence 21(7), 657–664 (1999)

    Article  Google Scholar 

  3. Shekhar, S., Huang, Y., Wu, W., Lu, C.T., Chawla, S.: What’s Spatial About Spatial Data Mining: Three Case Studies. In: Kumar, V., Grossman, R., Kamath, C., Nambaru, K. (eds.) Data Mining for Scientific Engineering Applications, Kluwer Academic, Dordrecht (2001)

    Google Scholar 

  4. Han, J., Koperski, K., Stefanovic, N.: GeoMiner.A System Prototype for Spatial Data Mining [C]. In: Proc. ACM SIGMOD Conference on the Management of Data Tucson Arizona (1997)

    Google Scholar 

  5. Pokajac, D., Obradovic, Z.: Improved Spatial-Temporal Forecasting through Modeling of Spatial Residuals in Recent History. In: Proc. First SIAM Int’I Conf on Data Mining SDM 2001, Chicago, USA (2001)

    Google Scholar 

  6. Roddick, J.F., Spiliopoulou, M., Hornsby, K.: An Updated Bibliography of Temporal, Spatial, and Spatio-temporal Data Mining Research. In: Roddick, J.F., Hornsby, K. (eds.) TSDM 2000. LNCS (LNAI), vol. 2007, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qu, Z., Wang, L. (2006). A Spatial Clustering Algorithm Based on SOFM. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_28

Download citation

  • DOI: https://doi.org/10.1007/11811305_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37025-3

  • Online ISBN: 978-3-540-37026-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics