An adaptive method to determine the number of clusters in clustering process

H. Doan, D. Nguyen
{"title":"An adaptive method to determine the number of clusters in clustering process","authors":"H. Doan, D. Nguyen","doi":"10.1109/ICCOINS.2014.6868373","DOIUrl":null,"url":null,"abstract":"A difficult problem of most clustering algorithms is how to specify the appropriate number of clusters. This paper proposes an adaptive method of selecting of number of clusters in clustering process by making coefficients indicated the appropriate number of clusters. The intra-cluster coefficient reflects intra distortion of cluster through maximum distance and a mean distance of cluster's extremely marginal objects. The inter-cluster coefficient reflects distance among clusters. It is ratio between closest distance from this cluster's centre to an extremely marginal object of other cluster and mean distance from this cluster's centre to all of extremely marginal object of other cluster respectively. A new coefficient that indicates the appropriate number of clusters is build from the intra-cluster coefficient and inter-cluster coefficient. The looking for extremely marginal objects and the new coefficient are integrated in a weighted FCM algorithm and it is calculated adaptively while the weighted FCM is processing. The weighted FCM algorithm integrated new coefficient is called FCM++. We experiment with FCM++ on some data sets of UCI: Iris, Wine, Soybean-small and show encouraging results.","PeriodicalId":368100,"journal":{"name":"2014 International Conference on Computer and Information Sciences (ICCOINS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Computer and Information Sciences (ICCOINS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCOINS.2014.6868373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A difficult problem of most clustering algorithms is how to specify the appropriate number of clusters. This paper proposes an adaptive method of selecting of number of clusters in clustering process by making coefficients indicated the appropriate number of clusters. The intra-cluster coefficient reflects intra distortion of cluster through maximum distance and a mean distance of cluster's extremely marginal objects. The inter-cluster coefficient reflects distance among clusters. It is ratio between closest distance from this cluster's centre to an extremely marginal object of other cluster and mean distance from this cluster's centre to all of extremely marginal object of other cluster respectively. A new coefficient that indicates the appropriate number of clusters is build from the intra-cluster coefficient and inter-cluster coefficient. The looking for extremely marginal objects and the new coefficient are integrated in a weighted FCM algorithm and it is calculated adaptively while the weighted FCM is processing. The weighted FCM algorithm integrated new coefficient is called FCM++. We experiment with FCM++ on some data sets of UCI: Iris, Wine, Soybean-small and show encouraging results.
一种确定聚类过程中簇数的自适应方法
大多数聚类算法的一个难题是如何指定适当的聚类数量。本文提出了一种自适应聚类过程中簇数选择的方法,通过系数表示合适的簇数。簇内系数通过簇内极端边缘物体的最大距离和平均距离反映了簇内畸变。簇间系数反映了簇间的距离。它是该星团中心到其他星团中一个极边缘物体的最近距离与该星团中心到其他星团中所有极边缘物体的平均距离之比。在簇内系数和簇间系数的基础上,建立了一个表示簇数的新系数。将极端边缘目标的寻找和新系数集成到加权FCM算法中,并在加权FCM处理过程中进行自适应计算。将新系数的加权FCM算法称为FCM++。我们在UCI的一些数据集上进行了FCM++的实验:Iris, Wine, Soybean-small,并显示了令人鼓舞的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书