Skip to main content

CBCM: A Cell-Based Clustering Method for Data Mining Applications

  • Conference paper
  • First Online:
Book cover Advances in Web-Age Information Management (WAIM 2002)

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

Included in the following conference series:

  • 325 Accesses

Abstract

Data mining applications have recently required a large amount of high-dimensional data. However, most clustering methods for the data miming applications do not work efficiently for dealing with large, high-dimensional data because of the so-called ‘curse of dimensionality’ and the limitation of available memory. In this paper, we propose a new cell-based clustering method (CBCM) which is more efficient for large, high-dimensional data than the existing clustering methods. Our CBCM provides an efficient cell creation algorithm using a space-partitioning technique and uses a filtering-based index structure using an approximation technique. In addition, we compare the performance of our CBCM with the CLIQUE method in terms of cluster construction time, precision, and retrieval time.

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. Berchtold S., Bohm C., Keim D., Kriegel H.-P., “A Cost Model for Nearest Neighbor Serarch in High-Dimensional Data Space”, ACM PODS Symposium on Principles of Databases Systems, Tucson, Arizona, 1997.

    Google Scholar 

  2. Jiawei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2000.

    Google Scholar 

  3. Ng R.T., Han J., “Efficient and Effective Clustering Methods for Spatial Data Mining”, Proc. 20th Int. Conf. on Very Large Data Bases, Morgan Kaufmann, 1994, pp. 144–155.

    Google Scholar 

  4. Kaufman L., Rousseeuw P.J., “Finding Groups in Data: An Introduction to Cluster Analysis”, John Wiley & Sons, 1990.

    Google Scholar 

  5. Zhang T., Ramakrishnan R., Linvy M., “BIRCH: An Efficient Data Clustering Method for Very Large Databases”, Proc. ACM SIGMOD Int. Conf. on Management of Data, ACM Press, 1996, pp. 103–114.

    Google Scholar 

  6. Ester M., Kriegel H.-P., Sander J., Xu X., “A Density Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, AAAI Press, 1996.

    Google Scholar 

  7. Wang W., Yang J., Muntz R., “STING: A Statistical Information Grid Approach to Spatial Data Mining”, Proc. 23rd Int. Conf. on Very Large Data Bases, Morgan Kaufmann, 1997.

    Google Scholar 

  8. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan, “Automatic Subspace Clustering of High Dimensional Data Mining Applications”, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1998, pp. 94–105.

    Google Scholar 

  9. http://www.almaden.ibm.com/cs/quest.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, JW. (2002). CBCM: A Cell-Based Clustering Method for Data Mining Applications. In: Meng, X., Su, J., Wang, Y. (eds) Advances in Web-Age Information Management. WAIM 2002. Lecture Notes in Computer Science, vol 2419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45703-8_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45703-8_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44045-1

  • Online ISBN: 978-3-540-45703-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics