Regularized fuzzy c-means clustering and its behavior at point of infinity

Yuchi Kanzawa, Sadaaki Miyamoto

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


This study shows that a general regularized fuzzy cmeans (rFCM) clustering algorithm, including some conventional clustering algorithms, can be constructed if a given regularizer function value, its derivative function value, and its inverse derivative function value can be calculated. Furthermore, the results of the study show that the behavior of the fuzzy classification function for rFCM at an infinity point is similar to that for some conventional clustering algorithms.

Original languageEnglish
Pages (from-to)485-492
Number of pages8
JournalJournal of Advanced Computational Intelligence and Intelligent Informatics
Issue number3
Publication statusPublished - 2019 May


  • Fuzzy clustering
  • regularization

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


Dive into the research topics of 'Regularized fuzzy c-means clustering and its behavior at point of infinity'. Together they form a unique fingerprint.

Cite this