Semi-supervised Affinity Propagation Clustering Algorithm Based on Fireworks Explosion Optimization

W. Limin, Han Xu-ming, Ji Qiang
{"title":"Semi-supervised Affinity Propagation Clustering Algorithm Based on Fireworks Explosion Optimization","authors":"W. Limin, Han Xu-ming, Ji Qiang","doi":"10.1109/ICMECG.2014.63","DOIUrl":null,"url":null,"abstract":"In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, a semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization (FEO-SAP) was proposed in this study. The algorithm adjusts the similarity matrix by utilizing the known pair wise constraints, and performs affinity propagation on this basis. The idea of fireworks explosion was introduced into the iteration process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm's global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the simulation experiments validated that the proposed algorithm has better clustering performance comparing with conventional AP and semi-supervised AP (SAP).","PeriodicalId":413431,"journal":{"name":"2014 International Conference on Management of e-Commerce and e-Government","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Management of e-Commerce and e-Government","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMECG.2014.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, a semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization (FEO-SAP) was proposed in this study. The algorithm adjusts the similarity matrix by utilizing the known pair wise constraints, and performs affinity propagation on this basis. The idea of fireworks explosion was introduced into the iteration process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm's global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the simulation experiments validated that the proposed algorithm has better clustering performance comparing with conventional AP and semi-supervised AP (SAP).
基于烟花爆炸优化的半监督亲和传播聚类算法
针对亲和传播(affinity propagation, AP)聚类算法在处理复杂结构数据集时聚类效果不理想的问题,提出了一种基于烟花爆炸优化的半监督亲和传播聚类算法(FEO-SAP)。该算法利用已知的对约束来调整相似矩阵,并在此基础上进行亲和传播。在算法的迭代过程中引入烟花爆炸的思想。通过对偏好空间进行双向自适应搜索,平衡了算法的全局搜索能力和局部搜索能力,从而找到最优聚类结构。仿真实验结果表明,与传统AP和半监督AP (SAP)相比,该算法具有更好的聚类性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信