A hybrid clustering procedure for concentric and chain-like clusters

  • M. Narasimha Murty
  • G. Krishna
Article

Abstract

K-means algorithm is a well known nonhierarchical method for clustering data. The most important limitations of this algorithm are that: (1) it gives final clusters on the basis of the cluster centroids or the seed points chosen initially, and (2) it is appropriate for data sets having fairly isotropic clusters. But this algorithm has the advantage of low computation and storage requirements. On the other hand, hierarchical agglomerative clustering algorithm, which can cluster nonisotropic (chain-like and concentric) clusters, requires high storage and computation requirements. This paper suggests a new method for selecting the initial seed points, so that theK-means algorithm gives the same results for any input data order. This paper also describes a hybrid clustering algorithm, based on the concepts of multilevel theory, which is nonhierarchical at the first level and hierarchical from second level onwards, to cluster data sets having (i) chain-like clusters and (ii) concentric clusters. It is observed that this hybrid clustering algorithm gives the same results as the hierarchical clustering algorithm, with less computation and storage requirements.

Key words

Nonhierarchical agglomerative multilevel theory seed point selection partitioning relabeling representative samples chain-like and concentric clusters 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. A. Hartigan,Clustering algorithms (Wiley, New York, 1975).Google Scholar
  2. 2.
    M. R. Anderberg,Cluster analysis for applications (Academic Press, New York, 1973).Google Scholar
  3. 3.
    M. Narasimha Murty and G. Krishna, “A computationally efficient technique for data-clustering,”Pattern Recognition, Vol. 12, pp. 153, 1980.Google Scholar
  4. 4.
    J. B. MacQueen, “Some methods for classification and analysis of multivariate observations,”Proc. Symp. Math. Stat. and Probability, 5th, Berkely, AD 669871 (Berkeley, 1967), pp. 281.Google Scholar
  5. 5.
    D. J. McRae, “MIKCA: A FORTRAN IV iterative k-means cluster analysis program,”Behavioral Science, Vol. 16, pp.423 (1971).Google Scholar
  6. 6.
    M. M. Astrahn, “Speech analysis by clustering or the hyperphoneme method,”Stanford artificial intelligence project, AD 709067 (Stanford Univ., California, 1970).Google Scholar
  7. 7.
    G. H. Ball and D. J. Hall, “PROMENADE-An outline pattern recognition system,”RADC-TR-67-310, AD 822174 (Stanford Res. Inst, California (1967), pp. 72.Google Scholar
  8. 8.
    G. Nagy, “State of the art in pattern recognition,”Proc. IEEE, Vol. 56, pp. 836 (May 1968).Google Scholar

Copyright information

© Plenum Publishing Corporation 1981

Authors and Affiliations

  • M. Narasimha Murty
    • 1
  • G. Krishna
    • 1
  1. 1.School of AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations