A thorough analysis of the suppressed fuzzy C-means algorithm

László Szilágyi, Sándor M. Szilágyi, Z. Benyó

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Suppressed fuzzy c-means (s-FCM) clustering was introduced in [Fan, J. L., Zhen, W. Z., Xie, W. X.: Suppressed fuzzy c-means clustering algorithm. Patt. Recogn. Lett. 24, 1607-1612 (2003)] with the intention of combining the higher speed of hard c-means (HCM) clustering with the better classification properties of fuzzy c-means (FCM) algorithm. They added an extra computation step into the FCM iteration, which created a competition among clusters: lower degrees of memberships were diminished according to a previously set suppression rate, while the largest fuzzy membership grew by swallowing all the suppressed parts of the small ones. Suppressing the FCM algorithm was found successful in the terms of accuracy and working time, but the authors failed to answer a series of important questions. In this paper we attempt to clarify the view upon the optimality and the competitive behavior of s-FCM via analytical computations and numerical analysis.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages203-210
Number of pages8
Volume5197 LNCS
DOIs
Publication statusPublished - 2008
Event13th Iberoamerican Congress on Pattern Recognition, CIARP 2008 - Havana, Cuba
Duration: Sep 9 2008Sep 12 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5197 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th Iberoamerican Congress on Pattern Recognition, CIARP 2008
CountryCuba
CityHavana
Period9/9/089/12/08

Fingerprint

Fuzzy C-means Algorithm
Fuzzy C-means Clustering
Fuzzy C-means
Fuzzy Membership
Clustering algorithms
Fans
Clustering Algorithm
Numerical analysis
Numerical Analysis
Optimality
High Speed
Clustering
Iteration
Series
Term

Keywords

  • Alternating optimization
  • Competitive clustering
  • Fuzzy c-means algorithm
  • Suppressed fuzzy c-means algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Szilágyi, L., Szilágyi, S. M., & Benyó, Z. (2008). A thorough analysis of the suppressed fuzzy C-means algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5197 LNCS, pp. 203-210). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5197 LNCS). https://doi.org/10.1007/978-3-540-85920-8_25

A thorough analysis of the suppressed fuzzy C-means algorithm. / Szilágyi, László; Szilágyi, Sándor M.; Benyó, Z.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5197 LNCS 2008. p. 203-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5197 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Szilágyi, L, Szilágyi, SM & Benyó, Z 2008, A thorough analysis of the suppressed fuzzy C-means algorithm. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5197 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5197 LNCS, pp. 203-210, 13th Iberoamerican Congress on Pattern Recognition, CIARP 2008, Havana, Cuba, 9/9/08. https://doi.org/10.1007/978-3-540-85920-8_25
Szilágyi L, Szilágyi SM, Benyó Z. A thorough analysis of the suppressed fuzzy C-means algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5197 LNCS. 2008. p. 203-210. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-85920-8_25
Szilágyi, László ; Szilágyi, Sándor M. ; Benyó, Z. / A thorough analysis of the suppressed fuzzy C-means algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5197 LNCS 2008. pp. 203-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1237b9ddaf924078a163388006e05852,
title = "A thorough analysis of the suppressed fuzzy C-means algorithm",
abstract = "Suppressed fuzzy c-means (s-FCM) clustering was introduced in [Fan, J. L., Zhen, W. Z., Xie, W. X.: Suppressed fuzzy c-means clustering algorithm. Patt. Recogn. Lett. 24, 1607-1612 (2003)] with the intention of combining the higher speed of hard c-means (HCM) clustering with the better classification properties of fuzzy c-means (FCM) algorithm. They added an extra computation step into the FCM iteration, which created a competition among clusters: lower degrees of memberships were diminished according to a previously set suppression rate, while the largest fuzzy membership grew by swallowing all the suppressed parts of the small ones. Suppressing the FCM algorithm was found successful in the terms of accuracy and working time, but the authors failed to answer a series of important questions. In this paper we attempt to clarify the view upon the optimality and the competitive behavior of s-FCM via analytical computations and numerical analysis.",
keywords = "Alternating optimization, Competitive clustering, Fuzzy c-means algorithm, Suppressed fuzzy c-means algorithm",
author = "L{\'a}szl{\'o} Szil{\'a}gyi and Szil{\'a}gyi, {S{\'a}ndor M.} and Z. Beny{\'o}",
year = "2008",
doi = "10.1007/978-3-540-85920-8_25",
language = "English",
isbn = "3540859195",
volume = "5197 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "203--210",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A thorough analysis of the suppressed fuzzy C-means algorithm

AU - Szilágyi, László

AU - Szilágyi, Sándor M.

AU - Benyó, Z.

PY - 2008

Y1 - 2008

N2 - Suppressed fuzzy c-means (s-FCM) clustering was introduced in [Fan, J. L., Zhen, W. Z., Xie, W. X.: Suppressed fuzzy c-means clustering algorithm. Patt. Recogn. Lett. 24, 1607-1612 (2003)] with the intention of combining the higher speed of hard c-means (HCM) clustering with the better classification properties of fuzzy c-means (FCM) algorithm. They added an extra computation step into the FCM iteration, which created a competition among clusters: lower degrees of memberships were diminished according to a previously set suppression rate, while the largest fuzzy membership grew by swallowing all the suppressed parts of the small ones. Suppressing the FCM algorithm was found successful in the terms of accuracy and working time, but the authors failed to answer a series of important questions. In this paper we attempt to clarify the view upon the optimality and the competitive behavior of s-FCM via analytical computations and numerical analysis.

AB - Suppressed fuzzy c-means (s-FCM) clustering was introduced in [Fan, J. L., Zhen, W. Z., Xie, W. X.: Suppressed fuzzy c-means clustering algorithm. Patt. Recogn. Lett. 24, 1607-1612 (2003)] with the intention of combining the higher speed of hard c-means (HCM) clustering with the better classification properties of fuzzy c-means (FCM) algorithm. They added an extra computation step into the FCM iteration, which created a competition among clusters: lower degrees of memberships were diminished according to a previously set suppression rate, while the largest fuzzy membership grew by swallowing all the suppressed parts of the small ones. Suppressing the FCM algorithm was found successful in the terms of accuracy and working time, but the authors failed to answer a series of important questions. In this paper we attempt to clarify the view upon the optimality and the competitive behavior of s-FCM via analytical computations and numerical analysis.

KW - Alternating optimization

KW - Competitive clustering

KW - Fuzzy c-means algorithm

KW - Suppressed fuzzy c-means algorithm

UR - http://www.scopus.com/inward/record.url?scp=55349149725&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55349149725&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85920-8_25

DO - 10.1007/978-3-540-85920-8_25

M3 - Conference contribution

AN - SCOPUS:55349149725

SN - 3540859195

SN - 9783540859192

VL - 5197 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 203

EP - 210

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -