On the Convergence of the Sparse Possibilistic C-Means Algorithm

In this paper, a convergence proof for the recently proposed cost function optimization sparse possibilistic c-means (SPCM) algorithm is provided. Specifically, it is shown that the algorithm will converge to one of the local minima of its associated cost function. It is also shown that similar convergence results can be derived for the well-known possibilistic c-means (PCM) algorithm proposed by Krishnapuram and Keller, 1996, if we view it as a special case of SPCM. Note that the convergence results for PCM are stronger than those established in previous works. © 1993-2012 IEEE