Skip to main content

A Grid Clustering Algorithm Based on Reference and Density

  • Conference paper
Advances in Computer Science – ASIAN 2005. Data Management on the Web (ASIAN 2005)

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

Included in the following conference series:

  • 450 Accesses

Abstract

In the paper, a new kind of clustering algorithm called GCARD is proposed. Besides the merits of Density-Based clustering analysis and its efficiency, GCARD can capture the shape and extent of clusters by core grid units, and then analyze data based on the references of core grid units. We present a method of RGUBR to improve the accuracy of grid clustering method, so it can be used to discover information in very large databases.

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

References

  1. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Simoudis, E., Han, J.W., Fayyad, U.M. (eds.) Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, pp. 226–231 (1996)

    Google Scholar 

  2. Zhou, B., Cheung, D., Kao, B.: A Fast Algorithm for Density-Based Clustering. In: Zhong, N., Zhou, L. (eds.) Proceedings of the Third Pacific-Asia Conference on Knowledge Discovery and Data Mining, Heidelberg, pp. 338–349 (1999)

    Google Scholar 

  3. Agrawal, R., Gehrke, J., Gunopolos, D., Raghavan, P.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Application. In: Haas, L.M., Tiwary, A. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, pp. 94–105 (1998)

    Google Scholar 

  4. Schikuta, E.: Grid Clustering: An Efficient Hierarchical Clustering Method for Very Large Data Set. In: Proceedings of the 13th International Conference on Pattern Recongition, vol. 2, pp. 101–105 (1996)

    Google Scholar 

  5. Yang, M., Wu, K.: A Similarity-Based Robust Clustering Method. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 434–448 (2004)

    Article  Google Scholar 

  6. Berchtold, S., Bohm, C., Kriegel, H.P.: The pyramid- technique: towards breaking the curse of dimensionality. In: Haas, L.M., Tiwary, A. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, pp. 142–153 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yong-Sheng, X., Wei, Z., Juan, W., Zong-Yi, H., Tian-Qi, K., Xin-Zheng, X. (2005). A Grid Clustering Algorithm Based on Reference and Density. In: Grumbach, S., Sui, L., Vianu, V. (eds) Advances in Computer Science – ASIAN 2005. Data Management on the Web. ASIAN 2005. Lecture Notes in Computer Science, vol 3818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596370_34

Download citation

  • DOI: https://doi.org/10.1007/11596370_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30767-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics