基于自然的高维数据聚类元启发式方法

S. Bejinariu, F. Rotaru, R. Luca, H. Costin
{"title":"基于自然的高维数据聚类元启发式方法","authors":"S. Bejinariu, F. Rotaru, R. Luca, H. Costin","doi":"10.1109/EPE50722.2020.9305585","DOIUrl":null,"url":null,"abstract":"The Nature-Inspired (NI) algorithms are able to find the solution of optimization problems (OP) faster than classical algorithms. Often, they are applied for OP with a reasonable number of parameters. The purpose of this research is to evaluate the capability of NI algorithms to solve high-dimensional OP. For this evaluation, a clustering problem was chosen. The Particle Swarm Optimization (PSO), Cuckoo Search (CSA) and Black Hole (BHA) algorithms were adapted by modifying the new individual’s initialization sequence. The three algorithms were chosen based on the fact that PSO and CSA are among the most performing, and BHA is considered to be a simplified version of PSO. The results obtained by applying the usual and the modified versions of the three NI algorithms are compared and the performances are significantly better in the second case.","PeriodicalId":250783,"journal":{"name":"2020 International Conference and Exposition on Electrical And Power Engineering (EPE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nature-Inspired Metaheuristics for High-Dimensional Data Clustering\",\"authors\":\"S. Bejinariu, F. Rotaru, R. Luca, H. Costin\",\"doi\":\"10.1109/EPE50722.2020.9305585\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Nature-Inspired (NI) algorithms are able to find the solution of optimization problems (OP) faster than classical algorithms. Often, they are applied for OP with a reasonable number of parameters. The purpose of this research is to evaluate the capability of NI algorithms to solve high-dimensional OP. For this evaluation, a clustering problem was chosen. The Particle Swarm Optimization (PSO), Cuckoo Search (CSA) and Black Hole (BHA) algorithms were adapted by modifying the new individual’s initialization sequence. The three algorithms were chosen based on the fact that PSO and CSA are among the most performing, and BHA is considered to be a simplified version of PSO. The results obtained by applying the usual and the modified versions of the three NI algorithms are compared and the performances are significantly better in the second case.\",\"PeriodicalId\":250783,\"journal\":{\"name\":\"2020 International Conference and Exposition on Electrical And Power Engineering (EPE)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference and Exposition on Electrical And Power Engineering (EPE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EPE50722.2020.9305585\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference and Exposition on Electrical And Power Engineering (EPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EPE50722.2020.9305585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

自然启发算法(NI)能够比经典算法更快地找到优化问题(OP)的解。通常,它们用于具有合理数量参数的OP。本研究的目的是评估NI算法解决高维op的能力。为了进行评估,我们选择了一个聚类问题。通过修改新个体的初始化顺序,采用粒子群算法(PSO)、杜鹃搜索算法(CSA)和黑洞算法(BHA)。这三种算法的选择是基于PSO和CSA是性能最好的,而BHA被认为是PSO的简化版本。比较了三种NI算法的通常版本和改进版本的结果,发现第二种情况下的性能明显更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nature-Inspired Metaheuristics for High-Dimensional Data Clustering
The Nature-Inspired (NI) algorithms are able to find the solution of optimization problems (OP) faster than classical algorithms. Often, they are applied for OP with a reasonable number of parameters. The purpose of this research is to evaluate the capability of NI algorithms to solve high-dimensional OP. For this evaluation, a clustering problem was chosen. The Particle Swarm Optimization (PSO), Cuckoo Search (CSA) and Black Hole (BHA) algorithms were adapted by modifying the new individual’s initialization sequence. The three algorithms were chosen based on the fact that PSO and CSA are among the most performing, and BHA is considered to be a simplified version of PSO. The results obtained by applying the usual and the modified versions of the three NI algorithms are compared and the performances are significantly better in the second case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信