Unsupervised hierarchical clustering via a genetic algorithm

W. A. Greene
{"title":"Unsupervised hierarchical clustering via a genetic algorithm","authors":"W. A. Greene","doi":"10.1109/CEC.2003.1299776","DOIUrl":null,"url":null,"abstract":"We present a clustering algorithm which is unsupervised, incremental, and hierarchical. The algorithm is distance-based and creates centroids. Then we combine the power of evolutionary forces with the clustering algorithm, counting on good clusterings to evolve to yet better ones. We apply our approach to standard data sets, and get very good results. Finally, we use bagging to pool the results of different clustering trials, and again get very good results.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

We present a clustering algorithm which is unsupervised, incremental, and hierarchical. The algorithm is distance-based and creates centroids. Then we combine the power of evolutionary forces with the clustering algorithm, counting on good clusterings to evolve to yet better ones. We apply our approach to standard data sets, and get very good results. Finally, we use bagging to pool the results of different clustering trials, and again get very good results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的无监督分层聚类
提出了一种无监督、增量、分层的聚类算法。该算法基于距离并创建质心。然后我们将进化力的力量与聚类算法结合起来,依靠好的聚类来进化出更好的聚类。我们将我们的方法应用于标准数据集,并得到了非常好的结果。最后,我们使用bagging方法对不同聚类试验的结果进行汇总,同样得到了非常好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Searching oligo sets of human chromosome 12 using evolutionary strategies A nonlinear control system design based on HJB/HJI/FBI equations via differential genetic programming approach Particle swarm optimizers for Pareto optimization with enhanced archiving techniques Epigenetic programming: an approach of embedding epigenetic learning via modification of histones in genetic programming A new particle swarm optimiser for linearly constrained optimisation
×
引用
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