The alternative c-means algorithm has recently been presented by Wu and Yang  for robust clustering of data. In this letter, we analyze the convergence of this algorithm by transforming it into an equivalent form with the Legendre transform. It is shown that this algorithm converges to a local optimal solution from any starting point.
|Number of pages||3|
|Journal||IEICE Transactions on Information and Systems|
|Publication status||Published - Apr 2003|
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Graphics and Computer-Aided Design