Fuzzy C-means clustering algorithm for automatically determining the number of clusters

Zhihe Wang, Shuyan Wang, Hui Du, Hao Guo
{"title":"Fuzzy C-means clustering algorithm for automatically determining the number of clusters","authors":"Zhihe Wang, Shuyan Wang, Hui Du, Hao Guo","doi":"10.1109/CIS52066.2020.00055","DOIUrl":null,"url":null,"abstract":"Traditional fuzzy C-means (FCM) clustering algorithm is sensitive to initial clustering center, and the number of clusters need to be set artificially in advance. For these reasons, we propose an improved FCM algorithm (AMMF) that can determine the number of clusters automatically. Firstly, the proposed algorithm uses the affinity propagation clustering algorithm to obtain coarse number of clusters, which are taken as the upper limit of searching the best number of clusters. Secondly, by the improved maximum and minimum distance algorithm obtains some representative sample points as the initial clustering centers of the FCM algorithm. Lastly, we use Silhouette Coefficient to analyze the quality of clustering to determine the optimal number of clusters automatically. Experimental results show that the AMMF algorithm has significantly better clustering performance than other improved FCM based algorithms, and improves the stability of the clustering results.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 16th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS52066.2020.00055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Traditional fuzzy C-means (FCM) clustering algorithm is sensitive to initial clustering center, and the number of clusters need to be set artificially in advance. For these reasons, we propose an improved FCM algorithm (AMMF) that can determine the number of clusters automatically. Firstly, the proposed algorithm uses the affinity propagation clustering algorithm to obtain coarse number of clusters, which are taken as the upper limit of searching the best number of clusters. Secondly, by the improved maximum and minimum distance algorithm obtains some representative sample points as the initial clustering centers of the FCM algorithm. Lastly, we use Silhouette Coefficient to analyze the quality of clustering to determine the optimal number of clusters automatically. Experimental results show that the AMMF algorithm has significantly better clustering performance than other improved FCM based algorithms, and improves the stability of the clustering results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
采用模糊c均值聚类算法自动确定聚类的数量
传统的模糊c均值(FCM)聚类算法对初始聚类中心比较敏感,需要提前人为设置聚类个数。基于这些原因,我们提出了一种改进的FCM算法(AMMF),可以自动确定聚类的数量。该算法首先采用亲和传播聚类算法获得粗聚类数,并以此作为搜索最佳聚类数的上限;其次,通过改进的最大和最小距离算法获得一些具有代表性的样本点作为FCM算法的初始聚类中心;最后利用剪影系数对聚类质量进行分析,自动确定最优聚类数量。实验结果表明,AMMF算法的聚类性能明显优于其他基于改进FCM的算法,提高了聚类结果的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Predicting Algorithms and Complexity in RNA Structure Based on BHG Efficient attribute reduction based on rough sets and differential evolution algorithm Numerical Analysis of Influence of Medicine Cover Structure on Cutting Depth [Copyright notice] Linear Elements Separation via Vision System Feature and Seed Spreading from Topographic Maps
×
引用
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