Skip to main content

AEC Algorithm: A Heuristic Approach to Calculating Density-Based Clustering Eps Parameter

  • Conference paper
Advances in Information Systems (ADVIS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4243))

Included in the following conference series:

Abstract

Spatial information processing is an active research field in database technology. Spatial databases store information about the position of individual objects in space [6]. Our current research is focused on providing an efficient caching structure for a telemetric data warehouse. We perform spatial objects clustering when creating levels of the structure. For this purpose we employ a density-based clustering algorithm. The algorithm requires an user-defined parameter Eps. As we cannot get the Eps from user for every level of the structure we propose a heuristic approach for calculating the Eps parameter. Automatic Eps Calculation (AEC) algorithm analyzes pairs of points defining two quantities: distance between the points and density of the stripe between the points. In this paper we describe in detail the algorithm operation and interpretation of the results. The AEC algorithm was implemented in one centralized and two distributed versions. Included test results present the algorithm correctness and efficiency against various datasets.

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. Barclay, T., Slutz, D.R., Gray, J.: TerraServer: A Spatial Data Warehouse. In: Proc. ACM SIGMOD 2000, pp. 307–318 (June 2000)

    Google Scholar 

  2. http://www.lsgi.polyu.edu.hk/sTAFF/zl.li/vol_2_2/02_chen.pdf

  3. http://maps.google.com

  4. Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of 2nd International Conference on Knowledge Discovery and Data Mining (1996)

    Google Scholar 

  5. Gorawski, M., Malczok, R.: On Efficient Storing and Processing of Long Aggregate Lists. DaWaK, Copenhagen, Denmark (2005)

    Google Scholar 

  6. Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Effcient OLAP Operations in Spatial Data Warehouses. LNCS. Springer, Heidelberg (2001)

    Google Scholar 

  7. Wang, X., Hamilton, H.J.: DBRS: A Density-Based Spatial Clustering Method with Random Sampling. In: Proceedings of the 7th PAKDD, Seoul, Korea (2003)

    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

Gorawski, M., Malczok, R. (2006). AEC Algorithm: A Heuristic Approach to Calculating Density-Based Clustering Eps Parameter. In: Yakhno, T., Neuhold, E.J. (eds) Advances in Information Systems. ADVIS 2006. Lecture Notes in Computer Science, vol 4243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890393_10

Download citation

  • DOI: https://doi.org/10.1007/11890393_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46291-0

  • Online ISBN: 978-3-540-46292-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics