Convergence and Consistency of Fuzzy c-means/ISODATA Algorithms

The fuzzy c-means/ISODATA algorithm is usually described in terms of clustering a finite data set. An equivalent point of view is that the algorithm clusters the support points of a finite-support probability distribution. Motivated by recent work on the hard version of the algorithm, this paper ext...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence 1987-09, Vol.PAMI-9 (5), p.661-668
Main Author: Sabin, Michael J.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Applied sciences
Artificial intelligence
c-means
Clustering algorithms
Computer science
control theory
systems
consistency
Convergence
Distribution functions
Exact sciences and technology
fixed point
fuzzy clustering
Fuzzy sets
ISODATA
Iterative algorithms
k-means
Partitioning algorithms
Pattern recognition. Digital image processing. Computational geometry
Probability distribution
Prototypes
stationary point
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The fuzzy c-means/ISODATA algorithm is usually described in terms of clustering a finite data set. An equivalent point of view is that the algorithm clusters the support points of a finite-support probability distribution. Motivated by recent work on the hard version of the algorithm, this paper extends the definition to arbitrary distributions and considers asymptotic properties. It is shown that fixed points of the algorithm are stationary points of the fuzzy objective functional, and vice versa. When the algorithm is iteratively applied to an initial prototype set, the sequence of prototype sets produced approaches the set of fixed points. If an unknown distribution is approximated by the empirical distribution of stationary, ergodic observations, then as the number of observations grows large, fixed points of the algorithm based on the empirical distribution approach fixed points of the algorithm based on the true distribution. Furthermore, with respect to minimizing the fuzzy objective functional, the algorithm based on the empirical distribution is asymptotically at least as good as the algorithm based on the true distribution.
ISSN:0162-8828
1939-3539
DOI:10.1109/TPAMI.1987.4767960