Automatically determining the number of Affinity Propagation Clustering using Particle Swarm

Xianhui Wang, Xuanping Zhang, Chun-xiao Zhuang, Zu-ning Chen, Zheng Qin
{"title":"Automatically determining the number of Affinity Propagation Clustering using Particle Swarm","authors":"Xianhui Wang, Xuanping Zhang, Chun-xiao Zhuang, Zu-ning Chen, Zheng Qin","doi":"10.1109/ICIEA.2010.5514680","DOIUrl":null,"url":null,"abstract":"Affinity propagation (AP) is a new powerful clustering algorithm based message passing between data points. One of the major problems in clustering is the determination of the optimal number of clusters. In this paper, we propose a new approach called Affinity Propagation Clustering based Particle Swarm Optimization (PSO-AP), which using Particle Swarm Optimization (PSO) algorithm to determination of the optimal clustering number of AP. Our PSO-AP method is absolutely “automatic”. PSO-AP represents the issue of finding the optimal clustering number of AP as an optimization problem of searching optimal solution of the input “preferences” space. It evaluates the particles' fitness using clustering validation indexes. Bounded constraint strategy of PSO used supervisor-student model. Several experiments data sets are presented to illustrate the simplicity and effectiveness of PSO-AP.","PeriodicalId":234296,"journal":{"name":"2010 5th IEEE Conference on Industrial Electronics and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th IEEE Conference on Industrial Electronics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA.2010.5514680","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Affinity propagation (AP) is a new powerful clustering algorithm based message passing between data points. One of the major problems in clustering is the determination of the optimal number of clusters. In this paper, we propose a new approach called Affinity Propagation Clustering based Particle Swarm Optimization (PSO-AP), which using Particle Swarm Optimization (PSO) algorithm to determination of the optimal clustering number of AP. Our PSO-AP method is absolutely “automatic”. PSO-AP represents the issue of finding the optimal clustering number of AP as an optimization problem of searching optimal solution of the input “preferences” space. It evaluates the particles' fitness using clustering validation indexes. Bounded constraint strategy of PSO used supervisor-student model. Several experiments data sets are presented to illustrate the simplicity and effectiveness of PSO-AP.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用粒子群算法自动确定亲和性传播聚类的数量
关联传播(Affinity propagation, AP)是一种基于数据点间消息传递的新型强大聚类算法。聚类的主要问题之一是确定最优聚类数量。本文提出了一种基于粒子群优化(PSO)算法的基于亲和性传播聚类的粒子群优化方法(Affinity Propagation Clustering based Particle Swarm Optimization, PSO-AP),该方法利用粒子群优化(Particle Swarm Optimization, PSO)算法来确定AP的最优聚类数。PSO-AP将寻找AP的最优聚类数问题表示为搜索输入“偏好”空间最优解的优化问题。它使用聚类验证指标来评估粒子的适应度。粒子群的有界约束策略采用导师-学生模型。几个实验数据集说明了PSO-AP的简单性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Forecasting next-day electricity prices with Hidden Markov Models Design of HTS Linear Induction Motor using GA and the Finite Element Method Hybrid recurrent fuzzy neural network control for permanent magnet synchronous motor applied in electric scooter Integrating human factors into nanotech sustainability assessment and communication An ID-based content extraction signatures without trusted party
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1