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
Affiliated Institutions
Related Publications
On clusterings-good, bad and spectral
We propose a new measure for assessing the quality of a clustering. A simple heuristic is shown to give worst-case guarantees under the new measure. Then we present two results ...
A Rapidly Convergent Descent Method for Minimization
A powerful iterative descent method for finding a local minimum of a function of several variables is described. A number of theorems are proved to show that it always converges...
Multidirectional search: a direct search algorithm for parallel machines
In recent years there has been a great deal of interest in the development of optimization algorithms which exploit the computational power of parallel computer architectures. W...
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
We investigate variants of Lloyd's heuristic for clustering high dimensional data in an attempt to explain its popularity (a half century after its introduction) among practitio...
Properties of an adaptive archiving algorithm for storing nondominated vectors
Search algorithms for Pareto optimization are designed to obtain multiple solutions, each offering a different tradeoff of the problem objectives. To make the different solution...
Publication Info
- Year
- 1980
- Type
- article
- Volume
- PAMI-2
- Issue
- 1
- Pages
- 1-8
- Citations
- 968
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/tpami.1980.4766964
- PMID
- 22499617