一种具有空簇重分配的混合遗传xk -means++聚类算法

Chun Hua
{"title":"一种具有空簇重分配的混合遗传xk -means++聚类算法","authors":"Chun Hua","doi":"10.1109/ICACI52617.2021.9435879","DOIUrl":null,"url":null,"abstract":"K-means is a classical clustering algorithm in many research areas, such as, document clustering, bioinformatics, image segmentation and pattern recognition. But, K-means is sensitive to the initial choice of cluster centers. A successful modification of K-means has been introduced in the literature by improving arbitrary cluster centers in the initialization stage-called K-means++. eXploratory K-means(XK-means)is another modification of K-means, which added an exploratory disturbance onto the vector of cluster centers, so as to improve the condition of sensitivity to the initial centers and jump out of the local optimum. However, the empty clusters may appear in the process of XK-means. The efficiency of the clustering result will be damaged by these empty clusters. In this paper, we try adding exploratory disturbance in K-means++ referred to as XK-means++. The same as XK-means, empty clusters also appear in the iteration process of XK-means++. Therefore, in this paper, an empty-cluster-reassignment technique is introduced and used in XK-means++(called EXK-means++). Furthermore, we combined the EXK-means++ with genetic mechanism, obtain a GEXK-means++ clustering algorithm. The data simulation results show that GEXK-means++is promising and effective.","PeriodicalId":382483,"journal":{"name":"2021 13th International Conference on Advanced Computational Intelligence (ICACI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Hybrid Genetic XK-means++ Clustering Algorithm with Empty Cluster Reassignment\",\"authors\":\"Chun Hua\",\"doi\":\"10.1109/ICACI52617.2021.9435879\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"K-means is a classical clustering algorithm in many research areas, such as, document clustering, bioinformatics, image segmentation and pattern recognition. But, K-means is sensitive to the initial choice of cluster centers. A successful modification of K-means has been introduced in the literature by improving arbitrary cluster centers in the initialization stage-called K-means++. eXploratory K-means(XK-means)is another modification of K-means, which added an exploratory disturbance onto the vector of cluster centers, so as to improve the condition of sensitivity to the initial centers and jump out of the local optimum. However, the empty clusters may appear in the process of XK-means. The efficiency of the clustering result will be damaged by these empty clusters. In this paper, we try adding exploratory disturbance in K-means++ referred to as XK-means++. The same as XK-means, empty clusters also appear in the iteration process of XK-means++. Therefore, in this paper, an empty-cluster-reassignment technique is introduced and used in XK-means++(called EXK-means++). Furthermore, we combined the EXK-means++ with genetic mechanism, obtain a GEXK-means++ clustering algorithm. The data simulation results show that GEXK-means++is promising and effective.\",\"PeriodicalId\":382483,\"journal\":{\"name\":\"2021 13th International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 13th International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI52617.2021.9435879\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 13th International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI52617.2021.9435879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

K-means是文献聚类、生物信息学、图像分割和模式识别等众多研究领域的经典聚类算法。但是,K-means对簇中心的初始选择很敏感。在文献中,通过改进初始化阶段的任意簇中心,介绍了K-means的成功修改-称为k -means++。探索性K-means(eXploratory K-means, XK-means)是对K-means的另一种改进,在聚类中心向量上加入探索性扰动,以改善对初始中心的灵敏度条件,跳出局部最优。但是在XK-means的过程中可能会出现空簇。这些空簇会影响聚类结果的效率。在本文中,我们尝试在k -means++中加入探索性扰动,简称xk -means++。与XK-means一样,在xk -means++的迭代过程中也会出现空簇。因此,本文引入了一种空簇重新分配技术,并将其应用于xk -means++(称为exk -means++)。在此基础上,将遗传机制与exk -means++结合,得到了一种gexk -means++聚类算法。数据仿真结果表明,gexk -means++具有良好的应用前景和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Hybrid Genetic XK-means++ Clustering Algorithm with Empty Cluster Reassignment
K-means is a classical clustering algorithm in many research areas, such as, document clustering, bioinformatics, image segmentation and pattern recognition. But, K-means is sensitive to the initial choice of cluster centers. A successful modification of K-means has been introduced in the literature by improving arbitrary cluster centers in the initialization stage-called K-means++. eXploratory K-means(XK-means)is another modification of K-means, which added an exploratory disturbance onto the vector of cluster centers, so as to improve the condition of sensitivity to the initial centers and jump out of the local optimum. However, the empty clusters may appear in the process of XK-means. The efficiency of the clustering result will be damaged by these empty clusters. In this paper, we try adding exploratory disturbance in K-means++ referred to as XK-means++. The same as XK-means, empty clusters also appear in the iteration process of XK-means++. Therefore, in this paper, an empty-cluster-reassignment technique is introduced and used in XK-means++(called EXK-means++). Furthermore, we combined the EXK-means++ with genetic mechanism, obtain a GEXK-means++ clustering algorithm. The data simulation results show that GEXK-means++is promising and effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visual saliency detection based on visual center shift MMTrans-MT: A Framework for Multimodal Emotion Recognition Using Multitask Learning K-means Clustering Based on Improved Quantum Particle Swarm Optimization Algorithm Performance of different Electric vehicle Battery packs at low temperature and Analysis of Intelligent SOC experiment Service Quality Loss-aware Privacy Protection Mechanism in Edge-Cloud IoTs
×
引用
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