scientific article; zbMATH DE number 4082764
[For the entire collection see Zbl 0648.00013.] We show by counterexample that the solution set of the basic convergence theorem for the fuzzy ISODATA clustering algorithms is not the set of local minima. Furthermore, we give a theorem which shows that the result for the example holds more generally. In the process we also show that the algorithms are potentially subject to ``cluster-splitting and suffer in that inspection of a given solution does not necessarily show the presence or absence of compact well-separated clusters. Finally, the nature of the counterexamples indicates that there are problems for which the domains of attraction to an undesirable solution can be large.
- Local convergence of the fuzzy c-means algorithms
- Relational duals of the c-means clustering algorithms
- On the mathematical and numerical properties of the fuzzy \(c\)-means algorithm
- Aggregation operators for soft decision making in water resources
- On the convergence of some possibilistic clustering algorithms
- Convergence properties of the generalized fuzzy c-means clustering algorithms
- On the Convergence of the Fuzzy Clustering Algorithm “Fuzzy ISODATA”
- Convergence and Consistency of Fuzzy c-means/ISODATA Algorithms
- Convergence theory for fuzzy c-means: Counterexamples and repairs
- scientific article; zbMATH DE number 4082765 (Why is no real title available?)
- scientific article; zbMATH DE number 2164338 (Why is no real title available?)
- Counterexamples to convergence theorem of maximum-entropy clustering algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3811541)