A hybrid clustering procedure for concentric and chain-like clusters

@article{Murty1981AHC,
  title={A hybrid clustering procedure for concentric and chain-like clusters},
  author={M. Narasimha Murty and G. Krishna},
  journal={International Journal of Computer & Information Sciences},
  year={1981},
  volume={10},
  pages={397-412}
}
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… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS
14 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Clustering algorithms (Wiley

  • J. A. Hartigan
  • New York,
  • 1975
Highly Influential
4 Excerpts

PROMENADE--An outline pattern recognition system," RADC-TR-67-310, AD

  • G. H. Ball, J D., Hall
  • 1967
Highly Influential
3 Excerpts

A FORTRAN IV iterative K-means cluster analysis program," Behavioral Science, Vol

  • D. J. McRae, MIKCA
  • 16, pp. 423
  • 1971
1 Excerpt

Astrahn, "Speech analysis by clustering or the hyperphoneme method," Stanford artificial intelligence project, AD 709067 (Stanford

  • M M.
  • 1970

Similar Papers

Loading similar papers…