A robust deterministic annealing algorithm for data clustering

@article{Yang2005ARD,
  title={A robust deterministic annealing algorithm for data clustering},
  author={XuLei Yang and Qing Song and Yi-Lei Wu},
  journal={Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.},
  year={2005},
  volume={3},
  pages={1878-1882 vol. 3}
}
In this paper, a new robust deterministic annealing (RDA) clustering algorithm is proposed. This method takes advantages of conventional noise clustering (NC) and deterministic annealing (DA) algorithms in terms of independence of data initialization, ability to avoid poor local optima, better performance for unbalanced data, and robustness against noise. The superiority of the proposed RDA clustering algorithm is supported by simulation results. 
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

References

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

A Fuzzy Relative of the ISODATA Process and its Use in Detecting Compact Well-Separated Cluster

  • J. C. Dunn
  • Journal of Cybernetics, vol.3,
  • 1974
1 Excerpt