Advertisement

An Efficient Hybrid Hierarchical Agglomerative Clustering (HHAC) Technique for Partitioning Large Data Sets

  • P. A. Vijaya
  • M. Narasimha Murty
  • D. K. Subramanian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3776)

Abstract

In this paper, an efficient Hybrid Hierarchical Agglomerative Clustering (HHAC) technique is proposed for effective clustering and prototype selection for pattern classification. It uses the characteristics of both partitional (an incremental scheme) and Hierarchical Agglomerative Clustering (HAC) schemes. Initially, an incremental, partitional clustering algorithm – leader is used for finding the subgroups/subclusters. It reduces the time and space requirements incurred in the formation of the subclusters using the conventional hierarchical agglomerative schemes or other methods. Further, only the subcluster representatives are merged to get a required number of clusters using a hierarchical agglomerative scheme which now requires less space and time when compared to that of using it on the entire training set. Thus, this hybrid scheme would be suitable for clustering large data sets and we can get a hierarchical structure consisting of clusters and subclusters. The subcluster representatives of a cluster can also handle its arbitrary/non-spherical shape. The experimental results (Classification Accuracy (CA) using the prototypes obtained and the computation time) of the proposed algorithm are promising.

References

  1. 1.
    Arnaud, D., Patrice, B., Gerard, V.L.: A Fuzzy Hybrid Hierarchical Clustering Method with a New Criterionable to Find the Optimal Partition. Fuzzy Sets and Systems 128(3), 323–338 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Harlow, T.J., Gogarten, J.P., Ragan, M.A.: A Hybrid Clustering Approach to Recognition of Protein Families in 114 Microbial Genomes. BMC Bioinformatics 5(45), 1–14 (2004)Google Scholar
  3. 3.
    Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)CrossRefGoogle Scholar
  4. 4.
    Mark, J.V., Katherine, S.P.: A New Algorithm for Hybrid Hierarchical Clustering with Visualization and the Bootstrap. Journal of Statistical Planning and Inference 117(2), 275–303 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Pujari, A.K.: Data Mining Techniques. Universities Press (India) Private Limited (2000)Google Scholar
  6. 6.
    Vijaya, P.A., Murty, M.N., Subramanian, D.K.: Leaders-Subleaders: An Efficient Hierarchical Clustering Algorithm for Large Data Sets. Pattern Recognition Letters 25, 503–511 (2004)CrossRefGoogle Scholar
  7. 7.
    Vijaya, P.A., Murty, M.N., Subramanian, D.K.: Analysis of Leader based Clustering Algorithms for Pattern Classification. Accepted for publication in the Proceedings of the 2nd IICAI, December 2005, Pune, India (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • P. A. Vijaya
    • 1
  • M. Narasimha Murty
    • 1
  • D. K. Subramanian
    • 1
  1. 1.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations