Validation approaches for FCM algorithm

E. Říhová, David Ríha
{"title":"Validation approaches for FCM algorithm","authors":"E. Říhová, David Ríha","doi":"10.18267/pr.2019.los.186.128","DOIUrl":null,"url":null,"abstract":"Clustering techniques can be used to organize into groups based on similarities among the individual data. In other words, clustering techniques are tools for discovering the previously hidden structure in a set, where the objects from one cluster are as similar as possible and objects from different clusters are dissimilar as possible. There are many different coefficients for estimating the optimal number of clusters. Each of these coefficients has its strengths and weaknesses. In this research, several coefficients for estimating the optimal number of clusters (for fuzzy clustering techniques) are examined. Also, their strengths and weaknesses are studied. And finally, the new coefficient for evaluating the fuzzy C-means clustering results is presented. The proposed coefficient is compared with a number of popular validation indices on nine datasets. The experimental results show that the effectiveness and reliability of the proposal is superior to other indices. The main advantage of this new coefficient is that, it works correct on data sets with large and small number of clusters. This characteristic of the new coefficient is very significant, as this algorithm require the number of clusters as an input, and the analysis result can vary greatly depending on the value chosen for this variable.","PeriodicalId":235267,"journal":{"name":"International Days of Statistics and Economics 2019","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Days of Statistics and Economics 2019","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18267/pr.2019.los.186.128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Clustering techniques can be used to organize into groups based on similarities among the individual data. In other words, clustering techniques are tools for discovering the previously hidden structure in a set, where the objects from one cluster are as similar as possible and objects from different clusters are dissimilar as possible. There are many different coefficients for estimating the optimal number of clusters. Each of these coefficients has its strengths and weaknesses. In this research, several coefficients for estimating the optimal number of clusters (for fuzzy clustering techniques) are examined. Also, their strengths and weaknesses are studied. And finally, the new coefficient for evaluating the fuzzy C-means clustering results is presented. The proposed coefficient is compared with a number of popular validation indices on nine datasets. The experimental results show that the effectiveness and reliability of the proposal is superior to other indices. The main advantage of this new coefficient is that, it works correct on data sets with large and small number of clusters. This characteristic of the new coefficient is very significant, as this algorithm require the number of clusters as an input, and the analysis result can vary greatly depending on the value chosen for this variable.
FCM算法的验证方法
聚类技术可用于根据单个数据之间的相似性将数据组织成组。换句话说,聚类技术是发现集合中先前隐藏的结构的工具,其中来自一个集群的对象尽可能相似,而来自不同集群的对象尽可能不相似。有许多不同的系数用于估计最优簇数。这些系数各有优缺点。在本研究中,研究了用于估计最优聚类数量(用于模糊聚类技术)的几个系数。同时,研究了它们的优缺点。最后,给出了评价模糊c均值聚类结果的新系数。将提出的系数与九个数据集上的一些常用验证指标进行了比较。实验结果表明,该方法的有效性和可靠性优于其他指标。这个新系数的主要优点是,它在具有大量和少量聚类的数据集上都能正确工作。新系数的这一特征非常重要,因为该算法需要簇的数量作为输入,并且分析结果可能会因选择该变量的值而有很大差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信