Reliability-based of robust fuzzy flustering

被引:0
|
作者
Pan J.-Y. [1 ]
Gao P. [2 ]
Gao Y.-L. [3 ]
Xie Y.-W. [1 ]
Xiong Y.-H. [3 ]
机构
[1] College of Information Engineering, Jimei University, Xiamen
[2] College of Marine Navigation, Jimei University, Xiamen
[3] College of Aeronautics and Astronautics, Xiamen University, Xiamen
基金
中国国家自然科学基金;
关键词
Ensemble learning; Fuzzy C-means (FCM); K-nearest neighbor constraint; Local information; Size imbalance;
D O I
10.7641/CTA.2020.00480
中图分类号
学科分类号
摘要
Compared with the k-means algorithm, fuzzy C-means (FCM) considers the interaction between different data clusters by introducing fuzzy membership degree, thus avoiding the clustering center overlapping problem. However, fuzzy membership degree has the structural characteristics of trailing and warp-tail, which makes FCM algorithm very sensitive to noise points and outliers. In addition, the FCM algorithm tends to classify the data cluster with average size, so it is sensitive to data cluster size also, which makes the algorithm not good for clustering imbalanced data clusters. To solve these problems, a reliability-based of robust fuzzy clustering algorithm (RRFCM) is proposed in this paper. The algorithm is based on the current clustering results, the reliability analysis was carried out on the sample points, using the reliability of the sample points and local neighbor information, highlight the separability between different data clusters, so as to improve the robustness of the algorithm for noises, and reduce the sensitivity to cluster size and behave better on unbalanced data cluster size, better generalization capability of the clustering results are obtained. Compared with related algorithms, the algorithm achieves the optimal results in artificial data sets, UCI real data sets and image segmentation experiments. © 2021, Editorial Department of Control Theory & Applications South China University of Technology. All right reserved.
引用
收藏
页码:516 / 528
页数:12
相关论文
共 28 条
  • [1] CHEN Xinquan, ZHOU Lingjing, LIU Yaozhong, Review on clustering algorithms, Journal of Integration Technology, 6, 3, pp. 41-49, (2017)
  • [2] GONG Dunwei, JIANG Yuqing, ZHANG Yong, Et al., K-mean algorithm for optimizing the number of clusters based on particle swarm optimization, Control Theory & Applications, 26, 10, pp. 1175-1179, (2009)
  • [3] ZHU Zhanlong, LIU Yongjun, A novel algorithm by incorporating chaos optimization and improved fuzzy c-means for image segmentation, Acta Electronica Sinica, 48, 5, pp. 975-984, (2020)
  • [4] WANG Jun, WANG Shitong, DENG Zhaohong, Survey on challenges in clustering analysis research, Control and Decision, 27, 3, pp. 321-328, (2012)
  • [5] CHEN Jinyin, HE Huihao, Density-based clustering algorithm for numerical and categorical data with mixed distance measure methods, Control Theory & Applications, 32, 8, pp. 993-1002, (2015)
  • [6] GAO Yunlong, WANG Zhihao, PAN Jinyan, Et al., Robust fuzzy Cmeans based on adaptive relaxation, Journal of Electronics and Information Technology, 42, 7, pp. 1774-1781, (2020)
  • [7] KRISHNAPURAM R, KELLER J M., A possibilistic approach to clustering, IEEE Transactions on Fuzzy Systems, 1, 2, pp. 98-110, (1993)
  • [8] PAL N R, PAL K, BEZDEK J C., A mixed C-means clustering model, (1997)
  • [9] ZHANG Zhihua, ZHENG Nanning, SHI Gang, Maximum entropy clustering algorithm and global convergence analysis, Science China (E): Technological Sciences, 31, 1, pp. 59-70, (2001)
  • [10] PAL N R, PAL K, KELLER J M, Et al., A possibilistic fuzzy c-means clustering algorithm, IEEE Transactions on Fuzzy Systems, 13, 4, pp. 517-530, (2005)