Local convergence of the fuzzy c-Means algorithms

作者:

Highlights:

摘要

Much understanding has recently been gained concerning global convergence properties of the fuzzy c-Means (FCM) family of clustering algorithms. These global convergence properties, which hold for all iteration sequences, guarantee that every FCM iteration sequence converges, at least along a subsequence, to a stationary point of an FCM objective function. In this paper we prove a local convergence property, that is, a property pertaining to iteration sequences started near a solution. Specifically, a simple result is proved which shows that whenever an FCM algorithm is started sufficiently near a minimizer of the corresponding objective function, then the iteration sequence must converge to that particular minimizer. The result guarantees that once captured by the local neighborhood of a minimizer, the succeeding iterate sequence will not escape—thus, infinite oscillation of such a sequence cannot occur. The rate of convergence of the sequence to such a point is also discussed.

论文关键词:Cluster analysis,Fuzzy c-Means,Local convergence,Pattern recognition

论文评审过程:Received 10 September 1985, Accepted 5 December 1985, Available online 19 May 2003.

论文官网地址:https://doi.org/10.1016/0031-3203(86)90047-6