A new algorithm for data clustering based on gravitational search algorithm and genetic operators

Hamed Nikbakht, H. Mirvaziri
{"title":"A new algorithm for data clustering based on gravitational search algorithm and genetic operators","authors":"Hamed Nikbakht, H. Mirvaziri","doi":"10.1109/AISP.2015.7123532","DOIUrl":null,"url":null,"abstract":"Data clustering is a crucial technique in data mining that is used in many applications. In this paper, a new clustering algorithm based on gravitational search algorithm (GSA) and genetic operators is proposed. The local search solution is utilized throw the global search to avoid getting stock in local optima. The GSA is a new approach to solve optimization problem that inspired by Newtonian law of gravity. We compared the performances of the proposed method with some well-known clustering algorithms on five benchmark dataset from UCI Machine Learning Repository. The experimental results show that our approach outperforms other algorithms and has better solution in all datasets.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2015.7123532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Data clustering is a crucial technique in data mining that is used in many applications. In this paper, a new clustering algorithm based on gravitational search algorithm (GSA) and genetic operators is proposed. The local search solution is utilized throw the global search to avoid getting stock in local optima. The GSA is a new approach to solve optimization problem that inspired by Newtonian law of gravity. We compared the performances of the proposed method with some well-known clustering algorithms on five benchmark dataset from UCI Machine Learning Repository. The experimental results show that our approach outperforms other algorithms and has better solution in all datasets.
基于引力搜索算法和遗传算子的数据聚类新算法
数据聚类是数据挖掘中的一项关键技术,在许多应用程序中都有使用。提出了一种基于引力搜索算法(GSA)和遗传算子的聚类算法。在全局搜索的基础上,利用局部搜索解决方案,避免陷入局部最优。GSA是受牛顿引力定律启发而提出的一种求解优化问题的新方法。在UCI机器学习库的5个基准数据集上,将该方法与一些知名聚类算法的性能进行了比较。实验结果表明,该方法优于其他算法,在所有数据集上都有更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信