The alternative c-means algorithm has recently been presented by Wu and Yang for robust clustering of data. In this letter, we analyze the convergence of this algorithm by transforming it into an equivalent form with the Legendre transform. It is shown that this algorithm converges to a local optimal solution from any starting point.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kiichi URAHAMA, "Convergence of Alternative C-Means Clustering Algorithms" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 4, pp. 752-754, April 2003, doi: .
Abstract: The alternative c-means algorithm has recently been presented by Wu and Yang for robust clustering of data. In this letter, we analyze the convergence of this algorithm by transforming it into an equivalent form with the Legendre transform. It is shown that this algorithm converges to a local optimal solution from any starting point.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_4_752/_p
Copy
@ARTICLE{e86-d_4_752,
author={Kiichi URAHAMA, },
journal={IEICE TRANSACTIONS on Information},
title={Convergence of Alternative C-Means Clustering Algorithms},
year={2003},
volume={E86-D},
number={4},
pages={752-754},
abstract={The alternative c-means algorithm has recently been presented by Wu and Yang for robust clustering of data. In this letter, we analyze the convergence of this algorithm by transforming it into an equivalent form with the Legendre transform. It is shown that this algorithm converges to a local optimal solution from any starting point.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Convergence of Alternative C-Means Clustering Algorithms
T2 - IEICE TRANSACTIONS on Information
SP - 752
EP - 754
AU - Kiichi URAHAMA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2003
AB - The alternative c-means algorithm has recently been presented by Wu and Yang for robust clustering of data. In this letter, we analyze the convergence of this algorithm by transforming it into an equivalent form with the Legendre transform. It is shown that this algorithm converges to a local optimal solution from any starting point.
ER -