Alpha-Cut Implemented Fuzzy Clustering Algorithms and Switching Regressions

Authors:
Miin-Shen Yang;Kuo-Lung Wu;June-Nan Hsieh;Jian Yu
Affiliations:
Dept. of Appl. Math., Chung Yuan Christian Univ., Chungli;-;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2008

Citing 0
Cited 9

Generalized fuzzy C-means clustering algorithm with improved fuzzy partitions

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Fuzzy PCA-guided robust k-means clustering

IEEE Transactions on Fuzzy Systems
A class of fuzzy clusterwise regression models

Information Sciences: an International Journal
A novel function approximation based on robust fuzzy regression algorithm model and particle swarm optimization

Applied Soft Computing
Fuzzy clustering of time series in the frequency domain

Information Sciences: an International Journal
Use of a fuzzy granulation--degranulation criterion for assessing cluster validity

Fuzzy Sets and Systems
Analysis of parameter selections for fuzzy c-means

Pattern Recognition
Fuzzy clustering of human activity patterns

Fuzzy Sets and Systems
Clustering construction on a multimodal probability model

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the fuzzy c-means (FCM) clustering algorithm, almost none of the data points have a membership value of 1. Moreover, noise and outliers may cause difficulties in obtaining appropriate clustering results from the FCM algorithm. The embedding of FCM into switching regressions, called the fuzzy c-regressions (FCRs), still has the same drawbacks as FCM. In this paper, we propose the -cut implemented fuzzy clustering algorithms, referred to as , which allow the data points being able to completely belong to one cluster. The proposed algorithms can form a cluster core for each cluster, where data points inside a cluster core will have a membership value of 1 so that it can resolve the drawbacks of FCM. On the other hand, the fuzziness index plays different roles for FCM and . We find that the clustering results obtained by are more robust to noise and outliers than FCM when a larger is used. Moreover, the cluster cores generated by are workable for various data shape clusters, so that is very suitable for embedding into switching regressions. The embedding of into switching regressions is called . The proposed provides better results than FCR for environments with noise or outliers. Numerical examples show the robustness and the superiority of our proposed methods.