A Clustering Algorithm Based on Adaptive Subcluster Merging

  • Jiani Hu
  • Weihong Deng
  • Jun Guo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4509)


This paper proposes an adaptive subcluster merging (ASM) based clustering algorithm. The ASM algorithm has two stages: subcluster partition and subcluster merging. Specifically, it first applies local expanding with variance constraint to partition subclusters with uniform granularity, and then it adaptively merges the subclusters into clusters with the notion of density. Through these two stages, ASM algorithm can identify clusters of heterogeneous structures. The feasibility of the algorithm has been successfully tested on both synthetic and real-world data sets. Comparative experimental studies of various clustering algorithms are also performed. The results demonstrate that the proposed algorithm performs better than K-means, complete-link hierarchial, density-based and maximum variance algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fred, A.L.N., Leitao, J.M.N.: A new cluster isolation criterion based on dissimilarity increments. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 944–958 (2003)CrossRefGoogle Scholar
  2. 2.
    Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: Proc. of 1998 ACM-SIGMOD International Conference on Management of Data, pp. 73–84 (1998)Google Scholar
  3. 3.
    Halkidi, M., Batistakis, Y., Vazirgiannis, M.: Cluster validity methods: part I. ACM SIGMOD Record 55, 311–331 (2002)Google Scholar
  4. 4.
    Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys 31, 264–323 (1999)CrossRefGoogle Scholar
  5. 5.
    Jain, A.K., Dubes, R.C.: Algorithms for clustering data. Prentice-Hall, Englewood Cliffs (1988)zbMATHGoogle Scholar
  6. 6.
    Karypis, G., Han, E., Kumar, V.: Chameleon: a hierarchical clustering algorithm using dynamic modeling. IEEE Computer 32 (1999)Google Scholar
  7. 7.
    McLachlan, G.J., Basford, K.E.: Mixture models: inference and applications to clustering. Marcel Dekker, New York (1988)zbMATHGoogle Scholar
  8. 8.
    Newman, C.B.D.J., Hettich, S., Merz, C.: UCI repository of machine learning database (1998)Google Scholar
  9. 9.
    Roberts, S., Husmeier, D., Rezek, I., Penny, W.: Bayesian approaches to gaussian mixture modeling. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 1133–1142 (1998)CrossRefGoogle Scholar
  10. 10.
    Sander, J., Ester, M., Kriegel, H.P., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. of 2nd Int. Conf. on Knowledge Discovery and Data Mining, pp. 226–231 (1996)Google Scholar
  11. 11.
    Veenman, C.J., Reinders, M.J.T., Backer, E.: A maximum variance cluster algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 1273–1280 (2002)CrossRefGoogle Scholar
  12. 12.
    Yip, A.M., Ding, C., Chan, T.F.: Dynamic cluster formation using level set methods. IEEE Transactions on Pattern Analysis and Machine Intelligence 28, 877–889 (2006)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Jiani Hu
    • 1
  • Weihong Deng
    • 1
  • Jun Guo
    • 1
  1. 1.Beijing University of Posts and Telecommunications, 100876, BeijingChina

Personalised recommendations