Automatic clustering approach based on particle swarm optimization for data with arbitrary shaped clusters

Genghang Chen, An Song, Chun-Ju Zhang, Xiao-Fang Liu, Wei-neng Chen, Zhi-hui Zhan, J. Zhong, Jun Zhang, Xiao-Min Hu
{"title":"Automatic clustering approach based on particle swarm optimization for data with arbitrary shaped clusters","authors":"Genghang Chen, An Song, Chun-Ju Zhang, Xiao-Fang Liu, Wei-neng Chen, Zhi-hui Zhan, J. Zhong, Jun Zhang, Xiao-Min Hu","doi":"10.1109/ICICIP.2016.7885913","DOIUrl":null,"url":null,"abstract":"Recently, partitional clustering approaches based on Evolutionary Algorithms (EAs) have shown promising in solving the data clustering problems. However, with the nearest prototype (NP) rule as the method for decoding, most of them are only suitable for clustering datasets with convex (e.g. hyperspherical) clusters. In this paper, we propose an automatic clustering approach using particle swarm optimization (PSO). A new encoding scheme with a novel decoding method, named the nearest multiple prototypes (NMP) rule, is applied to the PSO-based clustering algorithm to automatically determine an appropriate number of clusters in the procedure of clustering and partition datasets with arbitrary shaped clusters. The algorithm is experimentally validated on both synthetic and real datasets. The results show that the proposed PSO-based approach is very competitive when comparing with two popular clustering algorithms.","PeriodicalId":226381,"journal":{"name":"2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIP.2016.7885913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Recently, partitional clustering approaches based on Evolutionary Algorithms (EAs) have shown promising in solving the data clustering problems. However, with the nearest prototype (NP) rule as the method for decoding, most of them are only suitable for clustering datasets with convex (e.g. hyperspherical) clusters. In this paper, we propose an automatic clustering approach using particle swarm optimization (PSO). A new encoding scheme with a novel decoding method, named the nearest multiple prototypes (NMP) rule, is applied to the PSO-based clustering algorithm to automatically determine an appropriate number of clusters in the procedure of clustering and partition datasets with arbitrary shaped clusters. The algorithm is experimentally validated on both synthetic and real datasets. The results show that the proposed PSO-based approach is very competitive when comparing with two popular clustering algorithms.
基于粒子群优化的任意形状聚类数据自动聚类方法
近年来,基于进化算法的分区聚类方法在解决数据聚类问题方面表现出了良好的前景。然而,以最接近原型(NP)规则作为解码方法,它们大多只适用于具有凸(如超球面)聚类的数据集。本文提出了一种基于粒子群算法的自动聚类方法。在基于粒子群算法的聚类算法中,提出了一种新的编码方案和一种新的解码方法——最近多原型规则(NMP),在聚类过程中自动确定合适的聚类数量,并用任意形状的聚类对数据集进行划分。该算法在合成数据集和实际数据集上进行了实验验证。结果表明,与两种常用的聚类算法相比,本文提出的基于pso的聚类方法具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信