基于自适应粒子群优化的模糊c均值聚类算法

Shouwen Chen, Zhuoming Xu, Yan Tang
{"title":"基于自适应粒子群优化的模糊c均值聚类算法","authors":"Shouwen Chen, Zhuoming Xu, Yan Tang","doi":"10.1109/WISA.2015.67","DOIUrl":null,"url":null,"abstract":"Fuzzy C-Means (FCM) algorithm is one of the most popular fuzzy clustering techniques. However, it is easily trapped in local optima. Particle swarm optimization (PSO) is a stochastic global optimization model, which is used in many optimization problems. In this paper, a hybrid clustering algorithm, called HAPF, based on adaptive PSO (APSO) and FCM is proposed, in order to take advantage of the merits of both APSO and FCM. In HAPF the state of swarm aggregation is divided into three situations: strong, loose, and medium, respectively representing swarm's exploitation phrase, exploration phrase, and a balance between the two phrases. In addition, the interval of population diversity measured by the variance of population fitness is partitioned into three sections. After mapping the relationship between the swarm aggregation situations and the value of population diversity, three inertia weight groups are dynamically adjusted accordingly to the real-time state of population diversity. Experimental results show that the proposed HAPF is able to escape local optima and find better optima than other seven well-known clustering algorithms.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Improvement of Fuzzy C-Means Clustering Using Adaptive Particle Swarm Optimization\",\"authors\":\"Shouwen Chen, Zhuoming Xu, Yan Tang\",\"doi\":\"10.1109/WISA.2015.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fuzzy C-Means (FCM) algorithm is one of the most popular fuzzy clustering techniques. However, it is easily trapped in local optima. Particle swarm optimization (PSO) is a stochastic global optimization model, which is used in many optimization problems. In this paper, a hybrid clustering algorithm, called HAPF, based on adaptive PSO (APSO) and FCM is proposed, in order to take advantage of the merits of both APSO and FCM. In HAPF the state of swarm aggregation is divided into three situations: strong, loose, and medium, respectively representing swarm's exploitation phrase, exploration phrase, and a balance between the two phrases. In addition, the interval of population diversity measured by the variance of population fitness is partitioned into three sections. After mapping the relationship between the swarm aggregation situations and the value of population diversity, three inertia weight groups are dynamically adjusted accordingly to the real-time state of population diversity. Experimental results show that the proposed HAPF is able to escape local optima and find better optima than other seven well-known clustering algorithms.\",\"PeriodicalId\":198938,\"journal\":{\"name\":\"2015 12th Web Information System and Application Conference (WISA)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 12th Web Information System and Application Conference (WISA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WISA.2015.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 12th Web Information System and Application Conference (WISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2015.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

模糊c均值(FCM)算法是目前最流行的模糊聚类技术之一。然而,它很容易陷入局部最优。粒子群优化(PSO)是一种随机全局优化模型,可用于许多优化问题。为了充分利用自适应粒子群算法和FCM算法的优点,提出了一种基于自适应粒子群算法(APSO)和FCM算法的混合聚类算法HAPF。在HAPF中,将群体聚集状态分为强、松、中三种状态,分别代表群体的开发阶段、探索阶段以及两者之间的平衡。此外,还将种群适应度方差度量的种群多样性区间划分为3个区间。在映射出群体聚集情况与种群多样性值之间的关系后,根据种群多样性的实时状态动态调整三个惯性权重组。实验结果表明,该聚类算法能够摆脱局部最优,找到比其他7种已知聚类算法更好的最优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improvement of Fuzzy C-Means Clustering Using Adaptive Particle Swarm Optimization
Fuzzy C-Means (FCM) algorithm is one of the most popular fuzzy clustering techniques. However, it is easily trapped in local optima. Particle swarm optimization (PSO) is a stochastic global optimization model, which is used in many optimization problems. In this paper, a hybrid clustering algorithm, called HAPF, based on adaptive PSO (APSO) and FCM is proposed, in order to take advantage of the merits of both APSO and FCM. In HAPF the state of swarm aggregation is divided into three situations: strong, loose, and medium, respectively representing swarm's exploitation phrase, exploration phrase, and a balance between the two phrases. In addition, the interval of population diversity measured by the variance of population fitness is partitioned into three sections. After mapping the relationship between the swarm aggregation situations and the value of population diversity, three inertia weight groups are dynamically adjusted accordingly to the real-time state of population diversity. Experimental results show that the proposed HAPF is able to escape local optima and find better optima than other seven well-known clustering algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信