Fuzzy C-Means Clustering via Slime Mold and the Fisher Score

IF 3.6 3区 计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS International Journal of Fuzzy Systems Pub Date : 2024-09-15 DOI:10.1007/s40815-024-01788-y
Yiman Zhang, Lin Sun, Baofang Chang, Qianqian Zhang, Jiucheng Xu
{"title":"Fuzzy C-Means Clustering via Slime Mold and the Fisher Score","authors":"Yiman Zhang, Lin Sun, Baofang Chang, Qianqian Zhang, Jiucheng Xu","doi":"10.1007/s40815-024-01788-y","DOIUrl":null,"url":null,"abstract":"<p>Fuzzy C-means (FCM) clustering has the virtue of simple structure and easy implementation; however, it relies on the initial cluster centers and is sensitive to noise. To overcome these problems, this paper presents a novel FCM clustering method with slime mold and a Fisher score. First, logistics chaotic mapping is introduced to initialize the slime mold population and increase the population diversity. Modifying the convergence factor of the slime mold enhances the convergence speed and accuracy of the slime mold algorithm (SMA). Second, an adaptive weight is introduced into the SMA to promote the transition between exploration and development. Then, this optimal solution for SMA initializes the cluster center of FCM to avoid initialization sensitivity. Third, when considering the influence of feature differentiation degrees on the samples, the feature evaluation criteria of the Fisher score is constructed and then the importance of the feature is ranked to identify noise. The square root error criterion selects the most effective features to improve the clustering effect. Finally, by constructing uncertainty relations and introducing information entropy, the objective function of FCM is constructed to effectively solve the issue of FCM being sensitive to noise. The experimental results on 13 benchmark test functions for optimization, and 25 datasets for clustering show that the proposed algorithm outperforms other compared algorithms in terms of several evaluation metrics.</p>","PeriodicalId":14056,"journal":{"name":"International Journal of Fuzzy Systems","volume":"6 1","pages":""},"PeriodicalIF":3.6000,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Fuzzy Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40815-024-01788-y","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Fuzzy C-means (FCM) clustering has the virtue of simple structure and easy implementation; however, it relies on the initial cluster centers and is sensitive to noise. To overcome these problems, this paper presents a novel FCM clustering method with slime mold and a Fisher score. First, logistics chaotic mapping is introduced to initialize the slime mold population and increase the population diversity. Modifying the convergence factor of the slime mold enhances the convergence speed and accuracy of the slime mold algorithm (SMA). Second, an adaptive weight is introduced into the SMA to promote the transition between exploration and development. Then, this optimal solution for SMA initializes the cluster center of FCM to avoid initialization sensitivity. Third, when considering the influence of feature differentiation degrees on the samples, the feature evaluation criteria of the Fisher score is constructed and then the importance of the feature is ranked to identify noise. The square root error criterion selects the most effective features to improve the clustering effect. Finally, by constructing uncertainty relations and introducing information entropy, the objective function of FCM is constructed to effectively solve the issue of FCM being sensitive to noise. The experimental results on 13 benchmark test functions for optimization, and 25 datasets for clustering show that the proposed algorithm outperforms other compared algorithms in terms of several evaluation metrics.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过粘菌和费雪得分进行模糊 C-Means 聚类
模糊 C-均值(FCM)聚类具有结构简单、易于实现的优点,但它依赖于初始聚类中心,对噪声敏感。为了克服这些问题,本文提出了一种新型的 FCM 聚类方法,该方法具有粘菌和 Fisher 分数。首先,引入物流混沌映射来初始化粘菌种群,增加种群多样性。修改粘菌的收敛因子可提高粘菌算法(SMA)的收敛速度和精度。其次,在 SMA 中引入自适应权重,以促进探索与发展之间的过渡。然后,SMA 的最优解初始化了 FCM 的聚类中心,避免了初始化敏感性。第三,在考虑特征分化程度对样本的影响时,构建 Fisher 分数的特征评价标准,然后对特征的重要性进行排序,以识别噪声。平方根误差准则选择最有效的特征,以提高聚类效果。最后,通过构建不确定性关系和引入信息熵,构建了 FCM 的目标函数,有效解决了 FCM 对噪声敏感的问题。在 13 个优化基准测试函数和 25 个聚类数据集上的实验结果表明,所提出的算法在多个评价指标上都优于其他同类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Fuzzy Systems
International Journal of Fuzzy Systems 工程技术-计算机:人工智能
CiteScore
7.80
自引率
9.30%
发文量
188
审稿时长
16 months
期刊介绍: The International Journal of Fuzzy Systems (IJFS) is an official journal of Taiwan Fuzzy Systems Association (TFSA) and is published semi-quarterly. IJFS will consider high quality papers that deal with the theory, design, and application of fuzzy systems, soft computing systems, grey systems, and extension theory systems ranging from hardware to software. Survey and expository submissions are also welcome.
期刊最新文献
Event-Based Finite-Time $$H_\infty $$ Security Control for Networked Control Systems with Deception Attacks A Distance-Based Approach to Fuzzy Cognitive Maps Using Pythagorean Fuzzy Sets Relaxed Stability and Non-weighted $$L_2$$ -Gain Analysis for Asynchronously Switched Polynomial Fuzzy Systems Nonsingular Fast Terminal Sliding Mode Control of Uncertain Robotic Manipulator System Based on Adaptive Fuzzy Wavelet Neural Network Efficient and Effective Anomaly Detection in Autonomous Vehicles: A Combination of Gradient Boosting and ANFIS Algorithms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1