A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms

1980 IEEE Transactions on Pattern Analysis and Machine Intelligence 968 citations

Abstract

In this paper the convergence of a class of clustering procedures, popularly known as the fuzzy ISODATA algorithms, is established. The theory of Zangwill is used to prove that arbitrary sequences generated by these (Picard iteration) procedures always terminates at a local minimum, or at worst, always contains a subsequence which converges to a local minimum of the generalized least squares objective functional which defines the problem.

Keywords

Cluster analysisConvergence (economics)MathematicsSubsequenceAlgorithmFuzzy logicFuzzy clusteringClass (philosophy)Computer scienceMathematical optimizationArtificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
1980
Type
article
Volume
PAMI-2
Issue
1
Pages
1-8
Citations
968
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

968
OpenAlex
71
Influential
736
CrossRef

Cite This

James C. Bezdek (1980). A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence , PAMI-2 (1) , 1-8. https://doi.org/10.1109/tpami.1980.4766964

Identifiers

DOI
10.1109/tpami.1980.4766964
PMID
22499617

Data Quality

Data completeness: 77%