结合簇间距离的模糊c均值聚类算法

Sijie Shen, Qianqian Qiu, Sujie Guan, Min Li, Shaobo Deng
{"title":"结合簇间距离的模糊c均值聚类算法","authors":"Sijie Shen, Qianqian Qiu, Sujie Guan, Min Li, Shaobo Deng","doi":"10.1109/ACAIT56212.2022.10137917","DOIUrl":null,"url":null,"abstract":"With the rapid and vigorous development of fuzzy clustering theory and methods, more fuzzy clustering algorithms have been proposed to establish the uncertainty description of the samples. However, when clustering is performed, existing fuzzy clustering algorithms mostly iterate feature weights or deal with noise.The objective function is mostly based on minimizing the Euclidean distance within the clusters. However, increasing the Euclidean distance between cluster centroids may also lead to an improvement in clustering performance.In this paper, a new fuzzy c-mean clustering algorithm (JCFCM) combining inter-cluster distances is proposed. Not only is an affiliation assigned within the original cluster, but it is also reflected in the form of affiliation between clusters.In this paper, clustering is performed by increasing the process of iterative selection of cluster centers between clusters. With this formalization an objective function is designed and the iterative formulas for the parameters in the function are obtained by solving the objective function optimally. Finally, experiments are conducted on five real data sets and compared with other fuzzy clustering algorithms. Overall, the JCFCM algorithm has better clustering results than the fuzzy C-mean algorithm and has some advantages over the existing improved fuzzy C-mean algorithm for different data sets.","PeriodicalId":398228,"journal":{"name":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fuzzy C-Mean Clustering Algorithm Combining Inter-Cluster Distance\",\"authors\":\"Sijie Shen, Qianqian Qiu, Sujie Guan, Min Li, Shaobo Deng\",\"doi\":\"10.1109/ACAIT56212.2022.10137917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid and vigorous development of fuzzy clustering theory and methods, more fuzzy clustering algorithms have been proposed to establish the uncertainty description of the samples. However, when clustering is performed, existing fuzzy clustering algorithms mostly iterate feature weights or deal with noise.The objective function is mostly based on minimizing the Euclidean distance within the clusters. However, increasing the Euclidean distance between cluster centroids may also lead to an improvement in clustering performance.In this paper, a new fuzzy c-mean clustering algorithm (JCFCM) combining inter-cluster distances is proposed. Not only is an affiliation assigned within the original cluster, but it is also reflected in the form of affiliation between clusters.In this paper, clustering is performed by increasing the process of iterative selection of cluster centers between clusters. With this formalization an objective function is designed and the iterative formulas for the parameters in the function are obtained by solving the objective function optimally. Finally, experiments are conducted on five real data sets and compared with other fuzzy clustering algorithms. Overall, the JCFCM algorithm has better clustering results than the fuzzy C-mean algorithm and has some advantages over the existing improved fuzzy C-mean algorithm for different data sets.\",\"PeriodicalId\":398228,\"journal\":{\"name\":\"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACAIT56212.2022.10137917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACAIT56212.2022.10137917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着模糊聚类理论和方法的迅猛发展,人们提出了更多的模糊聚类算法来建立样本的不确定性描述。然而,在进行聚类时,现有的模糊聚类算法大多是迭代特征权值或处理噪声。目标函数主要是基于最小化聚类之间的欧氏距离。然而,增加聚类质心之间的欧氏距离也可能导致聚类性能的提高。本文提出了一种结合簇间距离的模糊c均值聚类算法。不仅在原集群内分配从属关系,而且还以集群之间的从属关系的形式反映出来。本文通过增加聚类之间迭代选择聚类中心的过程来实现聚类。在此基础上,设计了目标函数,并通过对目标函数的最优求解得到了函数中各参数的迭代表达式。最后,在5个真实数据集上进行了实验,并对其他模糊聚类算法进行了比较。总体而言,对于不同的数据集,JCFCM算法的聚类效果优于模糊c -均值算法,并且比现有的改进模糊c -均值算法具有一定的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fuzzy C-Mean Clustering Algorithm Combining Inter-Cluster Distance
With the rapid and vigorous development of fuzzy clustering theory and methods, more fuzzy clustering algorithms have been proposed to establish the uncertainty description of the samples. However, when clustering is performed, existing fuzzy clustering algorithms mostly iterate feature weights or deal with noise.The objective function is mostly based on minimizing the Euclidean distance within the clusters. However, increasing the Euclidean distance between cluster centroids may also lead to an improvement in clustering performance.In this paper, a new fuzzy c-mean clustering algorithm (JCFCM) combining inter-cluster distances is proposed. Not only is an affiliation assigned within the original cluster, but it is also reflected in the form of affiliation between clusters.In this paper, clustering is performed by increasing the process of iterative selection of cluster centers between clusters. With this formalization an objective function is designed and the iterative formulas for the parameters in the function are obtained by solving the objective function optimally. Finally, experiments are conducted on five real data sets and compared with other fuzzy clustering algorithms. Overall, the JCFCM algorithm has better clustering results than the fuzzy C-mean algorithm and has some advantages over the existing improved fuzzy C-mean algorithm for different data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transformer with Global and Local Interaction for Pedestrian Trajectory Prediction The Use of Explainable Artificial Intelligence in Music—Take Professor Nick Bryan-Kinns’ “XAI+Music” Research as a Perspective Playing Fight the Landlord with Tree Search and Hidden Information Evaluation Evaluation Method of Innovative Economic Benefits of Enterprise Human Capital Based on Deep Learning An Attribute Contribution-Based K-Nearest Neighbor Classifier
×
引用
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