Skip to main content

A Clustering Method for Large Spatial Databases

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3044))

Included in the following conference series:

Abstract

The rapid developments in the availability and access to spatially referenced information in a variety of areas, has induced the need for better analysis techniques to understand the various phenomena. In particular spatial clustering algorithms which groups similar spatial objects into classes can be used for the identification of areas sharing common characteristics. The aim of this paper is to present a density-based algorithm for the discover of clusters in large spatial data set which is a modification of a recently proposed algorithm.This is applied to a real data set related to homogeneous agricultural environments.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bailey, T.C., Gatrell, A.C.: Interactive spatial data analysis. Addison-Wesley Longman, Edinburgh (1995)

    Google Scholar 

  2. Ester, M., Kriegel, H.P., Sander, J., Xiaowei, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceeding of the 2nd International Confererence on Knowledge Discovery and Data Mining, pp. 94–99 (1996)

    Google Scholar 

  3. Fayyad, U., Piatesky -Shapiro, G., Smyth, P.: From Data Mining to Knowledge Discovery in Databases (1996), http://www.kdnuggets.com/gpspubs/aimag-kdd-overview-1996-fayyad.pdf

  4. Han, J., Kamber, M., Tung, A.K.H.: Spatial Clutering Methods in Data Mining: A Survey (2001), ftp://ftp.fas.sfu.ca/pub/cs/han/pdf/gkdbk01.pdf

  5. Koperski, K., Han, J., Adhikary, J.: Mining Knowledge in Geographical Data (1998), ftp://ftp.fas.sfu.ca/pubcs/han/pdf/geosurvey98.pdf

  6. Prestamburgo, M.: La classificazionedegli ambiti agricoli: una proposta metodologica (1981)

    Google Scholar 

  7. Sander, J., Ester, M., Kriegel, H.: P.,Xiaowei, X.: Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and its applications (1999), http://www.dbs.informatik.uni-muenchen.de/Publikationen/

  8. Schoier, G.: Blockmodeling techniques for Web Mining. In: Procedings in Computational Statistics, COMPSTAT 2002, pp. 201–206. Springer, Berlin (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schoier, G., Borruso, G. (2004). A Clustering Method for Large Spatial Databases. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_114

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24709-8_114

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22056-5

  • Online ISBN: 978-3-540-24709-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics