基于OpenCL架构的基于OBL的PSO K-means算法并行化

Qingyu Zhai, D. Yuan, Haixia Zhang, K. Gao
{"title":"基于OpenCL架构的基于OBL的PSO K-means算法并行化","authors":"Qingyu Zhai, D. Yuan, Haixia Zhang, K. Gao","doi":"10.1109/ICNC.2014.6975924","DOIUrl":null,"url":null,"abstract":"To improve the searching performance to find better initial cluster centers and the calculating performance to process massive data in high dimensions, for PSO K-means, a brand new hybrid data clustering algorithm named Parallelization of OBL based PSO K-means Algorithm with the OpenCL Architecture (POPK) is introduced in this paper. In POPK, Opposition-based Learning (OBL) is applied to improve the global searching ability of Particle Swarm Optimization (PSO) in search of better initial centers of clusters for K-means while Open Computing Language (OpenCL) is introduced to parallelize the OBL-based PSO K-means and to enhance the calculating ability such that an obvious speed-up is obtained. Experimental results indicate that both effectiveness and efficiency of POPK is acceptably improved compared with standard PSO K-means.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Parallelization of OBL based PSO K-means algorithm using OpenCL architecture\",\"authors\":\"Qingyu Zhai, D. Yuan, Haixia Zhang, K. Gao\",\"doi\":\"10.1109/ICNC.2014.6975924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve the searching performance to find better initial cluster centers and the calculating performance to process massive data in high dimensions, for PSO K-means, a brand new hybrid data clustering algorithm named Parallelization of OBL based PSO K-means Algorithm with the OpenCL Architecture (POPK) is introduced in this paper. In POPK, Opposition-based Learning (OBL) is applied to improve the global searching ability of Particle Swarm Optimization (PSO) in search of better initial centers of clusters for K-means while Open Computing Language (OpenCL) is introduced to parallelize the OBL-based PSO K-means and to enhance the calculating ability such that an obvious speed-up is obtained. Experimental results indicate that both effectiveness and efficiency of POPK is acceptably improved compared with standard PSO K-means.\",\"PeriodicalId\":208779,\"journal\":{\"name\":\"2014 10th International Conference on Natural Computation (ICNC)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 10th International Conference on Natural Computation (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2014.6975924\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 10th International Conference on Natural Computation (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2014.6975924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

为了提高寻优初始聚类中心的搜索性能和处理高维海量数据的计算性能,本文针对PSO K-means算法,提出了一种全新的基于OpenCL架构的并行化基于OBL的PSO K-means算法(POPK)。在POPK中,利用基于对立的学习(OBL)提高粒子群优化(PSO)的全局搜索能力,为K-means寻找更好的簇初始中心,同时引入开放计算语言(OpenCL)对基于对立的PSO的K-means进行并行化处理,提高计算能力,从而获得明显的加速效果。实验结果表明,与标准PSO K-means相比,POPK的有效性和效率都有了较大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Parallelization of OBL based PSO K-means algorithm using OpenCL architecture
To improve the searching performance to find better initial cluster centers and the calculating performance to process massive data in high dimensions, for PSO K-means, a brand new hybrid data clustering algorithm named Parallelization of OBL based PSO K-means Algorithm with the OpenCL Architecture (POPK) is introduced in this paper. In POPK, Opposition-based Learning (OBL) is applied to improve the global searching ability of Particle Swarm Optimization (PSO) in search of better initial centers of clusters for K-means while Open Computing Language (OpenCL) is introduced to parallelize the OBL-based PSO K-means and to enhance the calculating ability such that an obvious speed-up is obtained. Experimental results indicate that both effectiveness and efficiency of POPK is acceptably improved compared with standard PSO K-means.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Graph based K-nearest neighbor minutiae clustering for fingerprint recognition Applications of artificial intelligence technologies in credit scoring: A survey of literature Construction of linear dynamic gene regulatory network based on feedforward neural network A new dynamic clustering method based on nuclear field A multi-objective ant colony optimization algorithm based on the Physarum-inspired mathematical model
×
引用
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