Computational experience on four algorithms for the hard clustering problem

@article{AlSultan1996ComputationalEO,
  title={Computational experience on four algorithms for the hard clustering problem},
  author={Khaled S. Al-Sultan and M. Maroof Khan},
  journal={Pattern Recognition Letters},
  year={1996},
  volume={17},
  pages={295-308}
}
In this paper, we consider the problem of clustering m objects in c clusters. The objects are represented by points in n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center is minimized. The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm… CONTINUE READING
Highly Cited
This paper has 88 citations. REVIEW CITATIONS
49 Citations
1 References
Similar Papers

Citations

Publications citing this paper.

88 Citations

0510'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 88 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

ADAPTATION NATURAL A © Copyright: King Fahd University of Petroleum & Minerals; http://www.kfupm.edu.sa

  • JH HOLLAND
  • 1975

Similar Papers

Loading similar papers…