聚类集成的进化方法

M. Mohammadi, Amin Nikanjam, A. Rahmani
{"title":"聚类集成的进化方法","authors":"M. Mohammadi, Amin Nikanjam, A. Rahmani","doi":"10.1109/ICNC.2008.493","DOIUrl":null,"url":null,"abstract":"In this paper we propose a clustering ensemble algorithm based on genetic algorithm. The most important feature of our method is ability to extract the number of clusters. Genetic algorithms have been known as methods with high ability to find the solution of optimization problems. One of these problems is clustering, a process that receives a dataset as input and divides its members into several subsets called cluster (partition or group). The members of each cluster would be alike while members of two different clusters would be as different as possible. One of the common ways to do this is combinational clustering. Combinational clustering will combine the results of different clustering methods or some executions of a clustering method to calculate final clusters. In this paper, an evolutionary combinational clustering method is proposed to find the number of clusters. The evaluation of this method on several common datasets shows the proper performance of proposed method to find final clusters as well as the exact number of clusters.","PeriodicalId":6404,"journal":{"name":"2008 Fourth International Conference on Natural Computation","volume":"789 1","pages":"77-82"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"An Evolutionary Approach to Clustering Ensemble\",\"authors\":\"M. Mohammadi, Amin Nikanjam, A. Rahmani\",\"doi\":\"10.1109/ICNC.2008.493\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a clustering ensemble algorithm based on genetic algorithm. The most important feature of our method is ability to extract the number of clusters. Genetic algorithms have been known as methods with high ability to find the solution of optimization problems. One of these problems is clustering, a process that receives a dataset as input and divides its members into several subsets called cluster (partition or group). The members of each cluster would be alike while members of two different clusters would be as different as possible. One of the common ways to do this is combinational clustering. Combinational clustering will combine the results of different clustering methods or some executions of a clustering method to calculate final clusters. In this paper, an evolutionary combinational clustering method is proposed to find the number of clusters. The evaluation of this method on several common datasets shows the proper performance of proposed method to find final clusters as well as the exact number of clusters.\",\"PeriodicalId\":6404,\"journal\":{\"name\":\"2008 Fourth International Conference on Natural Computation\",\"volume\":\"789 1\",\"pages\":\"77-82\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2008.493\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2008.493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

本文提出了一种基于遗传算法的聚类集成算法。我们的方法最重要的特点是能够提取聚类的数量。遗传算法是一种求解优化问题的高能力方法。其中一个问题是聚类,这是一个接收数据集作为输入并将其成员划分为几个子集的过程,称为集群(分区或组)。每个集群的成员将是相似的,而两个不同集群的成员将尽可能不同。其中一种常见的方法是组合聚类。组合聚类将不同聚类方法的结果或某一聚类方法的若干次执行结合起来计算最终的聚类。本文提出了一种进化组合聚类方法来确定聚类的数量。在几个常见的数据集上对该方法进行了评估,结果表明该方法在寻找最终聚类和准确聚类数量方面具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Evolutionary Approach to Clustering Ensemble
In this paper we propose a clustering ensemble algorithm based on genetic algorithm. The most important feature of our method is ability to extract the number of clusters. Genetic algorithms have been known as methods with high ability to find the solution of optimization problems. One of these problems is clustering, a process that receives a dataset as input and divides its members into several subsets called cluster (partition or group). The members of each cluster would be alike while members of two different clusters would be as different as possible. One of the common ways to do this is combinational clustering. Combinational clustering will combine the results of different clustering methods or some executions of a clustering method to calculate final clusters. In this paper, an evolutionary combinational clustering method is proposed to find the number of clusters. The evaluation of this method on several common datasets shows the proper performance of proposed method to find final clusters as well as the exact number of clusters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信