Abstract
In this paper a new algorithm for fuzzy clustering is presented. The proposed algorithm utilizes the idea of relaxation. Convergence of the proposed algorithm is proved and limits on the relaxation parameter are derived. Stopping criteria and resulting convergence behaviour of the algorithms are discussed. The performance of the new algorithm is compared to the fuzzy c-means algorithm by testing both on three published data sets. Theoretical and empirical results reported in this paper show that the new algorithm is more efficient and leads to significant computational savings.
| Original language | English |
|---|---|
| Pages (from-to) | 177-188 |
| Number of pages | 12 |
| Journal | Fuzzy Sets and Systems |
| Volume | 61 |
| Issue number | 2 |
| DOIs | |
| State | Published - 24 Jan 1994 |
Bibliographical note
Funding Information:This work was partially supported by the Natural Science and Engineering Research Council of Canada through a research grant to the first author. The second author acknowledges the support of King Fahd University of Petroleum and Minerals. The Relaxation Algorithm was coded by Mr. Heru T. Natalisa and the computational results of Section 6 were obtained by him. Earlier discussion on the use of relaxation with Dr. M. A. Ismail is acknowledged.
Keywords
- Fuzzy c-means algorithm
- cluster analysis
- fuzzy clustering
- pattern recognition
- relaxation techniques
ASJC Scopus subject areas
- Logic
- Artificial Intelligence