.png){kind=icon}
返回
PSO-ECM: particle swarm optimization-based evidential C-means algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-024-02139-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As an extension of Fuzzy C-Means (FCM), Evidence C-Means (ECM) is proposed in the framework of Dempster-Shafer theory (DST) and has been applied to many fields. However, the objective function of ECM involves only the distortion between the object and the prototype, which relies heavily on the initial prototype. Therefore, ECM may encounter the problem of local optimization. To solve this problem, this paper introduces ECM with Particle Swarm Optimization (PSO) initialization to determine the initial clustering centroids, and proposes Particle Swarm Optimization-based Evidential C-Means (PSO-ECM), which reduces the influence of bad initial prototypes and improves the local optimality problem of ECM. PSO-ECM is compared with three other clustering algorithms in four experiments and with ECM on a noise-containing dataset. According to the experimental results, PSO-ECM performs well in terms of different clustering validity metrics compared with existing clustering algorithms, has high stability of clustering, and can effectively and stably cluster noise-containing datasets and accurately identify outlier points.
Keyword:
Particle swarm optimization
Evidential C-means
Clustering
Dempster-Shafer theory
Stability
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
暂无机构信息
引用论文
.png){kind=icon}
Hypercalcaemia and diffuse osteolytic lesions in the acute phase of myeloid splenomegaly高钙血症和多发性溶骨性病变在髓性脾肿大急性期
OAAI
OAAI分享收藏
查看更多内容