返回
An improved FCM clustering algorithm with adaptive weights based on PSO-TVAC algorithm
DOI:10.1007/s10489-021-02801-9.png)
摘要
En 中文
Fuzzy c-means clustering algorithm (FCM), as the most widely used clustering algorithm, works by iteratively updating the membership degree and the cluster centers to improve the effectiveness of clustering. The performance of FCM algorithm is chiefly evaluated by intra-cluster compactness and inter-cluster separation. However, it has some defects such as high dependency on the initial cluster centers, sensitivity to the noise samples and outliers, difficulties in obtaining the optimization of hyperparameters, a fairly poor performance on datasets with the nonuniform distribution. The main purpose of this paper is to tackle these issues. The novelty of this paper is three-fold: 1) a new FCM clustering algorithm (i.e., CWAFCM) has been proposed, which has a good capability of performing the clustering on datasets with nonuniform distribution and reducing the high dependency on the initial cluster centers; 2) considering the merits of AFCM-SP in removing noise samples and CWAFCM in performing clustering on datasets with nonuniform distribution, a combination of the objective functions of these two clustering algorithms is developed to construct the hybrid AFCM algorithm; and 3) during the parameter setting by means of the PSO algorithm with time-varying acceleration coefficients (PSO-TVAC), a new index, namely adaptive clustering validity index (ACVI), is presented to describe the intra-cluster compactness and the inter-cluster separation in a proper manner. Experiments on six data sets in UCI and one artificial data set have been carried out with a comparison of five well-known FCM algorithms. Experimental results have demonstrated that the proposed hybrid AFCM with adaptive weights can more effectively enhance the performance of FCM to increase the clustering effectiveness than the contrastive algorithms. The ranks for seven algorithms on seven datasets in terms of CVIXB, accuracy, and normalized mutual information(NMI), further verifying the superiority of the new algorithm. Therefore it can be concluded that the proposed hybrid AFCM algorithm performs well in reducing the reliance on the initial cluster centers and the sensitivity to the noise and outliers.
Keyword:
Fuzzy c-means algorithm
Particle swarm optimization
Clustering validity index
Adaptive weight
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
The living building: integrating the built environment with nature evaluating the Bibliotheca of Alexandria according to the challenge imperatives生命建筑:将建成环境与自然融合,根据挑战的必要性评估亚历山大图书馆(Bibliotheca of Alexandria)
Modified dynamic fuzzy c-means clustering algorithm - Application in dynamic customer segmentation
APPLIED INTELLIGENCE
IF3.5

