A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
- 1 January 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-2 (1) , 1-8
- https://doi.org/10.1109/tpami.1980.4766964
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
This publication has 7 references indexed in Scilit:
- A new approach to clusteringPublished by Elsevier ,2004
- Prototype classification and feature selection with fuzzy setsIEEE Transactions on Systems, Man, and Cybernetics, 1977
- Numerical taxonomy with fuzzy setsJournal of Mathematical Biology, 1974
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated ClustersJournal of Cybernetics, 1973
- Cluster Validity with Fuzzy SetsJournal of Cybernetics, 1973
- A clustering technique for summarizing multivariate dataBehavioral Science, 1967
- Fuzzy setsInformation and Control, 1965