Robust-learning fuzzy c-means clustering algorithm with unknown number of clusters

•We construct a robust learning-based fuzzy c-means (FCM) framework, called the robust-learning FCM (RL-FCM) algorithm.•The proposed RL-FCM can automatically find the best number of clusters, without any initialization and parameter selection with free of the fuzziness index m.•The computational com...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition Vol. 71; pp. 45 - 59
Main Authors: Yang, Miin-Shen, Nataliani, Yessica
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.11.2017
Subjects:
Entropy penalty terms
Fuzzy c-means (FCM)
Fuzzy clustering
Number of clusters
Robust learning-based schema
Robust-learning FCM (RL-FCM)
Robust learning-based schema
Fuzzy clustering
Number of clusters
Fuzzy c-means (FCM)
Robust-learning FCM (RL-FCM)
Entropy penalty terms
ISSN:0031-3203, 1873-5142
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We construct a robust learning-based fuzzy c-means (FCM) framework, called the robust-learning FCM (RL-FCM) algorithm.•The proposed RL-FCM can automatically find the best number of clusters, without any initialization and parameter selection with free of the fuzziness index m.•The computational complexity of the proposed RL-FCM algorithm is analyzed.•The experimental results and comparisons actually demonstrate these good aspects of RL-FCM where it exhibits three robust characteristics. In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the most commonly used clustering method. Various extensions of FCM had been proposed in the literature. However, the FCM algorithm and its extensions are usually affected by initializations and parameter selection with a number of clusters to be given a priori. Although there were some works to solve these problems in FCM, there is no work for FCM to be simultaneously robust to initializations and parameter selection under free of the fuzziness index without a given number of clusters. In this paper, we construct a robust learning-based FCM framework, called a robust-learning FCM (RL-FCM) algorithm, so that it becomes free of the fuzziness index m and initializations without parameter selection, and can also automatically find the best number of clusters. We first use entropy-type penalty terms for adjusting bias with free of the fuzziness index, and then create a robust learning-based schema for finding the best number of clusters. The computational complexity of the proposed RL-FCM algorithm is also analyzed. Comparisons between RL-FCM and other existing methods are made. Experimental results and comparisons actually demonstrate these good aspects of the proposed RL-FCM where it exhibits three robust characteristics: 1) robust to initializations with free of the fuzziness index, 2) robust to (without) parameter selection, and 3) robust to number of clusters (with unknown number of clusters).
ISSN:0031-3203
1873-5142
DOI:10.1016/j.patcog.2017.05.017