A Robust and High-Dimensional Clustering Algorithm Based on Feature Weight and Entropy

被引:4
作者
Du, Xinzhi [1 ]
机构
[1] Anhui Univ Technol, Sch Comp Sci & Technol, Maanshan 243032, Peoples R China
关键词
fuzzy clustering; high-dimensional data; feature weights; entropy weights; non-Euclidean distance;
D O I
10.3390/e25030510
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Since the Fuzzy C-Means algorithm is incapable of considering the influence of different features and exponential constraints on high-dimensional and complex data, a fuzzy clustering algorithm based on non-Euclidean distance combining feature weights and entropy weights is proposed. The proposed algorithm is based on the Fuzzy C-Means soft clustering algorithm to deal with high-dimensional and complex data. The objective function of the new algorithm is modified with the help of two different entropy terms and a non-Euclidean way of computing the distance. The distance calculation formula enhances the efficiency of extracting the contribution of different features. The first entropy term helps to minimize the clusters' dispersion and maximize the negative entropy to control the clustering process, which also promotes the association between the samples. The second entropy term helps to control the weights of features since different features have different weights in the clustering process. Experiments on real-world datasets indicate that the proposed algorithm gives better clustering results than other algorithms. The experiments demonstrate the proposed algorithm's robustness by analyzing the parameters' sensitivity and comparing the computational distance formulas. In summary, the improved algorithm improves classification performance under noisy interference and high-dimensional datasets, increases computational efficiency, performs well in real-world high-dimensional datasets, and encourages the development of robust noise-resistant high-dimensional fuzzy clustering algorithms.
引用
收藏
页数:17
相关论文
共 39 条
[1]   Model Order Reduction Based on Agglomerative Hierarchical Clustering [J].
Al-Dabooni, Seaar ;
Wunsch, Donald .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2019, 30 (06) :1881-1895
[2]  
[Anonymous], About us
[3]  
Bezdek J. C., 1981, Pattern recognition with fuzzy objective function algorithms
[4]   FCM - THE FUZZY C-MEANS CLUSTERING-ALGORITHM [J].
BEZDEK, JC ;
EHRLICH, R ;
FULL, W .
COMPUTERS & GEOSCIENCES, 1984, 10 (2-3) :191-203
[6]   A comparative study of efficient initialization methods for the k-means clustering algorithm [J].
Celebi, M. Emre ;
Kingravi, Hassan A. ;
Vela, Patricio A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (01) :200-210
[7]  
Chen HP, 2017, NEUROCOMPUTING, V236, P104, DOI 10.1016/j.neucom.2016.09.103
[8]   M3W: Multistep Three-Way Clustering [J].
Du, Mingjing ;
Zhao, Jingqi ;
Sun, Jiarui ;
Dong, Yongquan .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (04) :5627-5640
[9]   Unsupervised learning of prototypes and attribute weights [J].
Frigui, H ;
Nasraoui, O .
PATTERN RECOGNITION, 2004, 37 (03) :567-581
[10]   Adaptive fuzzy c-means algorithm based on local noise detecting for image segmentation [J].
Guo, Fang-Fang ;
Wang, Xiu-Xiu ;
Shen, Jie .
IET IMAGE PROCESSING, 2016, 10 (04) :272-279