4.7 Article

A convergence theorem for the fuzzy subspace clustering (FSC) algorithm

Journal

PATTERN RECOGNITION
Volume 41, Issue 6, Pages 1939-1947

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2007.11.011

Keywords

clustering; subspace clustering; analysis of algorithms; convergence; fuzzy set

Ask authors/readers for more resources

We establish the convergence of the fuzzy subspace clustering (FSC) algorithm by applying Zangwill's convergence theorem. We show that the iteration sequence produced by the FSC algorithm terminates at a point in the solution set S or there is a subsequence converging to a point in S. In addition, we present experimental results that illustrate the convergence properties of the FSC algorithm in various scenarios. (C) 2007 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available