Skip to main content

A GENERAL INCREMENTAL HIERARCHICAL CLUSTERING METHOD

  • Conference paper

Abstract

Data mining, i.e., clustering analysis, is a challenging task due to the huge amounts of data. In this paper, we propose a general incremental hierarchical clustering method dealing with incremental data sets in data warehouse environment for data mining to reduce the cost further. As an example, we put forward ICHAMELEON, the improvement of CHAMELEON, which is a hierarchical clustering method, and demonstrate that ICHAMELEON is highly efficient in terms of time complexity. Experimental results on very large data sets are presented which show the efficiency of ICHAMELEON compared with CHAMELEON.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. J.W. Han and M. Kamber (2001), Data Mining Concepts and Techniques. Higher Education Press, Beijing.

    Google Scholar 

  2. L. Kaufman and P.J. Rousseeuw (1990), Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons Press, New York.

    Google Scholar 

  3. S. Guha, R. Rastogi and K. Shim (1998), Cure: an efficient clustering algorithm for large databases. International Conference on Management of Data, pp. 73–84.

    Google Scholar 

  4. G. Karypis, E.-H. Han and V. Kumar (1999), CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Computer, pp. 68–75.

    Google Scholar 

  5. H. Samet (1990), The Design and Analysis of Spatial Data Structures. Addison-Wesley Press.

    Google Scholar 

  6. G. Karypis and V. Kumar (1998), hMETIS 1.5: a hypergraph partitioning package. Technical report, Available at http://www.cs.umn.edu/~ metis.

    Google Scholar 

  7. H.T. Bai, J.G. Sun, Y. Jiao and C.Q. Xu (2002), Implementation and comparison of network optimization algorithms. Journal of Jilin University (Information Science edition), 40, 4, pp. 59–68.

    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

About this paper

Cite this paper

He, L., Bai, H., Sun, J., Jin, C. (2006). A GENERAL INCREMENTAL HIERARCHICAL CLUSTERING METHOD. In: LIU, G., TAN, V., HAN, X. (eds) Computational Methods. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-3953-9_45

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-3953-9_45

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-3952-2

  • Online ISBN: 978-1-4020-3953-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics