Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
531502 | Pattern Recognition | 2008 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
G. Gan, J. Wu,