利用频率和多样性为基础的集成选择共识聚类

Arko Banerjee
{"title":"利用频率和多样性为基础的集成选择共识聚类","authors":"Arko Banerjee","doi":"10.1109/IC3.2014.6897160","DOIUrl":null,"url":null,"abstract":"Consensus clustering, also called aggregation of clustering (or partitions) is a method that desires to improve the robustness and quality in clustering of a dataset by optimally reconciling the results of different clusterings of the same dataset generated in different ways. This paper proposes a novel way of arriving at a consensus clustering by an ensemble selection strategy. The method avoids considering the entire ensemble and judiciously select few clusterings in the ensemble without compromising on the quality of the consensus. It begins with sorting the ensemble by prioritizing clusterings based on diversity and frequency. It is observed that considering jointly the diversity and frequency helps in identifying few representative partitions that have high potentiality to form qualitatively better consensus than that of the entire ensemble. Finally a greedy strategy is used to select the clusterings in an iterative consensus generation technique that ensures the internal quality of clustering to be monotonically non-decreasing. Empirical results show that the consensus clustering obtained by the proposed algorithm gives better clustering accuracy for many datasets.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Leveraging frequency and diversity based ensemble selection to consensus clustering\",\"authors\":\"Arko Banerjee\",\"doi\":\"10.1109/IC3.2014.6897160\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consensus clustering, also called aggregation of clustering (or partitions) is a method that desires to improve the robustness and quality in clustering of a dataset by optimally reconciling the results of different clusterings of the same dataset generated in different ways. This paper proposes a novel way of arriving at a consensus clustering by an ensemble selection strategy. The method avoids considering the entire ensemble and judiciously select few clusterings in the ensemble without compromising on the quality of the consensus. It begins with sorting the ensemble by prioritizing clusterings based on diversity and frequency. It is observed that considering jointly the diversity and frequency helps in identifying few representative partitions that have high potentiality to form qualitatively better consensus than that of the entire ensemble. Finally a greedy strategy is used to select the clusterings in an iterative consensus generation technique that ensures the internal quality of clustering to be monotonically non-decreasing. Empirical results show that the consensus clustering obtained by the proposed algorithm gives better clustering accuracy for many datasets.\",\"PeriodicalId\":444918,\"journal\":{\"name\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2014.6897160\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2014.6897160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

共识聚类,也称为聚类的聚合(或分区),是一种希望通过以不同方式生成的同一数据集的不同聚类结果的最佳协调来提高数据集聚类的鲁棒性和质量的方法。本文提出了一种利用集合选择策略实现一致聚类的新方法。该方法避免考虑整个集合,在不影响一致性质量的情况下,在集合中明智地选择少数聚类。它首先通过根据多样性和频率对聚类进行优先排序来对集合进行排序。观察到,联合考虑多样性和频率有助于识别少数具有代表性的分区,这些分区具有高潜力形成比整个集合更好的一致性。最后,在迭代共识生成技术中采用贪婪策略选择聚类,保证了聚类的内部质量是单调不递减的。实验结果表明,该算法获得的一致聚类对许多数据集具有较好的聚类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Leveraging frequency and diversity based ensemble selection to consensus clustering
Consensus clustering, also called aggregation of clustering (or partitions) is a method that desires to improve the robustness and quality in clustering of a dataset by optimally reconciling the results of different clusterings of the same dataset generated in different ways. This paper proposes a novel way of arriving at a consensus clustering by an ensemble selection strategy. The method avoids considering the entire ensemble and judiciously select few clusterings in the ensemble without compromising on the quality of the consensus. It begins with sorting the ensemble by prioritizing clusterings based on diversity and frequency. It is observed that considering jointly the diversity and frequency helps in identifying few representative partitions that have high potentiality to form qualitatively better consensus than that of the entire ensemble. Finally a greedy strategy is used to select the clusterings in an iterative consensus generation technique that ensures the internal quality of clustering to be monotonically non-decreasing. Empirical results show that the consensus clustering obtained by the proposed algorithm gives better clustering accuracy for many datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信