Skip to main content

A New Cell-Based Clustering Method for High-Dimensional Data Mining Applications

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

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

Abstract

Many clustering methods are not suitable for high-dimensional data mining applications 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 for the high-dimensional data mining applications. The proposed clustering method provides efficient cell creation and cell insertion algorithms using a space-partitioning technique, as well as makes use of a filtering-based index structure using an approximation technique. In addition, we compare the performance of our cell-based clustering method with the CLIQUE method which is well known as an efficient grid-based clustering method for high-dimensional data. The experimental results show that our clustering method achieves better performance on cluster construction time 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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  2. Gan, G., Wu, J.: Subspace Clustering for High Dimensional Categorical Data. ACM SIGKDD Explorations networks 6(2), 87–94 (2004)

    Article  Google Scholar 

  3. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic Subspace Clustering of High Dimensional Data Mining Applications. In: Proc. of ACM SIGMOD, pp. 94–105 (1998)

    Google Scholar 

  4. Nagesh, H., Goil, S., Choudhary, A.: A Scalable Parallel Subspace Clustering Algorithm for Massive data Sets. In: Proc. of Int. Conf. on parallel Processing, pp. 477–486 (2000)

    Google Scholar 

  5. Aggrawal, C., Wolf, J., Yu, P., Procopiuc, C., Park, J.: Fast Algorithms for Projected Clustering. In: Proc. of ACM SIGMOD, pp. 61–72 (1999)

    Google Scholar 

  6. Woo, K., Lee, J.: FINDIT: A Fast and Intelligent Subspace Clustering Algorithm using Dimension Voting. PhD thesis, Korea Advanced Institute of Sci.&Tech, Dept. of CS (2002)

    Google Scholar 

  7. Procopiuc, C., Jones, M., Agrawal, P., Murali, T.: A More Carlo Algorithm for Fast Projective Clustering. Proc. of ACM SIGMOD, 418–427 (2002)

    Google Scholar 

  8. 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

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, JW. (2005). A New Cell-Based Clustering Method for High-Dimensional Data Mining Applications. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552413_56

Download citation

  • DOI: https://doi.org/10.1007/11552413_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28894-7

  • Online ISBN: 978-3-540-31983-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics