针对数据聚类问题,提出了一种改进的带突变粒子群优化算法

Chiabwoot Ratanavilisagul
{"title":"针对数据聚类问题,提出了一种改进的带突变粒子群优化算法","authors":"Chiabwoot Ratanavilisagul","doi":"10.1109/ICCIA49625.2020.00018","DOIUrl":null,"url":null,"abstract":"Particle Swarm Optimization (PSO) and K-Means (KM) are widely used for solving data clustering. KM encounters the problem of initializing the cluster centers and the problem of trapping in local optimum. When PSO is applied with KM, it can decrease two problems from KM. Hence, the hybrid clustering technique based on PSO and KM that can enhance performance of clustering is more than using KM alone. However, the hybrid clustering technique encounters the trapping in local optimum problem. To solve this problem, this paper proposed improving hybrid technique by the mutation operation is applied with particles of PSO when swarm traps in local optimum. The proposed technique is tested on eight datasets from the UCI Machine Learning Repository and gives more satisfied search results in comparison with PSOs for the data clustering problems.","PeriodicalId":237536,"journal":{"name":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A novel modified particle swarm optimization algorithm with mutation for data clustering problem\",\"authors\":\"Chiabwoot Ratanavilisagul\",\"doi\":\"10.1109/ICCIA49625.2020.00018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle Swarm Optimization (PSO) and K-Means (KM) are widely used for solving data clustering. KM encounters the problem of initializing the cluster centers and the problem of trapping in local optimum. When PSO is applied with KM, it can decrease two problems from KM. Hence, the hybrid clustering technique based on PSO and KM that can enhance performance of clustering is more than using KM alone. However, the hybrid clustering technique encounters the trapping in local optimum problem. To solve this problem, this paper proposed improving hybrid technique by the mutation operation is applied with particles of PSO when swarm traps in local optimum. The proposed technique is tested on eight datasets from the UCI Machine Learning Repository and gives more satisfied search results in comparison with PSOs for the data clustering problems.\",\"PeriodicalId\":237536,\"journal\":{\"name\":\"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIA49625.2020.00018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA49625.2020.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

粒子群算法(PSO)和k均值算法(KM)被广泛应用于数据聚类问题的求解。KM遇到了初始化聚类中心和陷入局部最优的问题。将粒子群算法应用于KM时,可以减少KM中的两个问题。因此,基于粒子群和KM的混合聚类技术比单独使用KM更能提高聚类性能。然而,混合聚类技术遇到了局部最优捕获问题。为了解决这一问题,本文提出了改进的混合技术,在群体陷入局部最优时,将粒子群优化算法应用于粒子群的突变操作。在UCI机器学习库的8个数据集上对该技术进行了测试,与pso相比,在数据聚类问题上给出了更满意的搜索结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel modified particle swarm optimization algorithm with mutation for data clustering problem
Particle Swarm Optimization (PSO) and K-Means (KM) are widely used for solving data clustering. KM encounters the problem of initializing the cluster centers and the problem of trapping in local optimum. When PSO is applied with KM, it can decrease two problems from KM. Hence, the hybrid clustering technique based on PSO and KM that can enhance performance of clustering is more than using KM alone. However, the hybrid clustering technique encounters the trapping in local optimum problem. To solve this problem, this paper proposed improving hybrid technique by the mutation operation is applied with particles of PSO when swarm traps in local optimum. The proposed technique is tested on eight datasets from the UCI Machine Learning Repository and gives more satisfied search results in comparison with PSOs for the data clustering problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信