A robust deterministic annealing algorithm for data clustering

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.