Research on a new clustering algorithm in data mining

Tan Zhongbing
{"title":"Research on a new clustering algorithm in data mining","authors":"Tan Zhongbing","doi":"10.1109/ANTHOLOGY.2013.6784990","DOIUrl":null,"url":null,"abstract":"Data mining is one of the leading fields in the combination area of database and decision supporting, and clustering is a significant task for data mining, in which clustering algorithm is the core technology. The new clustering method based on genetic algorithm and gradient descent method (G-G clustering algorithm) is proposed in this paper. Genetic algorithm has the advantages of global searching and strong robustness, and will not getting stuck at local optimal values. Unfortunately, it can only reach the near-optimal value after many generations of selection, crossover and mutation. Therefore, gradient descent method is utilized at the end of genetic algorithm based clustering method to get global optimal values. Clustering results of two groups of experimental data show that the new clustering method is one with global optimal, and the results is evidently better than k-means clustering method.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference Anthology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTHOLOGY.2013.6784990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Data mining is one of the leading fields in the combination area of database and decision supporting, and clustering is a significant task for data mining, in which clustering algorithm is the core technology. The new clustering method based on genetic algorithm and gradient descent method (G-G clustering algorithm) is proposed in this paper. Genetic algorithm has the advantages of global searching and strong robustness, and will not getting stuck at local optimal values. Unfortunately, it can only reach the near-optimal value after many generations of selection, crossover and mutation. Therefore, gradient descent method is utilized at the end of genetic algorithm based clustering method to get global optimal values. Clustering results of two groups of experimental data show that the new clustering method is one with global optimal, and the results is evidently better than k-means clustering method.
数据挖掘中一种新的聚类算法研究
数据挖掘是数据库与决策支持结合领域的前沿领域之一,聚类是数据挖掘的重要任务,其中聚类算法是核心技术。本文提出了一种基于遗传算法和梯度下降法的聚类方法(G-G聚类算法)。遗传算法具有全局搜索和鲁棒性强的优点,不会陷入局部最优。不幸的是,它要经过许多代的选择、交叉和突变才能达到接近最优的值。因此,在基于遗传算法的聚类方法的最后使用梯度下降法来获得全局最优值。两组实验数据的聚类结果表明,该聚类方法是一种全局最优的聚类方法,其聚类结果明显优于k-means聚类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信