基于新加权策略的集成聚类

Yao Sun, Hong Jia, Jiwu Huang
{"title":"基于新加权策略的集成聚类","authors":"Yao Sun, Hong Jia, Jiwu Huang","doi":"10.1109/CIS2018.2018.00041","DOIUrl":null,"url":null,"abstract":"The target of ensemble clustering is to improve the accuracy of clustering by integrating multiple clustering results and solve the problem of scalability existed in traditional and single clustering algorithms. In recent years, ensemble clustering has attracted increasing attention due to its remarkable achievements. However, the limitation of most existing ensemble clustering approaches is that all base clusterings are treated equally without considering the validity of them. Some ensemble clustering algorithms are aware of using weighting strategy but also ignoring the negative impact of base clusterings with poor performance. In this paper, we propose an ensemble clustering method based on a novel weighting strategy. Specifically, the validity of each base clustering is measured by the optimal matching score between the base clustering and the whole to obtain the corresponding weight. Then, the weights of base clusterings which have negative contribution are further adjusted to get the final weight vector. Subsequently, a weighted co-association matrix is constructed to serve as the ensemble matrix and a hierarchical clustering algorithm is applied to it to generate the final result. Experimental results on different types of real-world datasets show the superiority of proposed methods.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ensemble Clustering with Novel Weighting Strategy\",\"authors\":\"Yao Sun, Hong Jia, Jiwu Huang\",\"doi\":\"10.1109/CIS2018.2018.00041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The target of ensemble clustering is to improve the accuracy of clustering by integrating multiple clustering results and solve the problem of scalability existed in traditional and single clustering algorithms. In recent years, ensemble clustering has attracted increasing attention due to its remarkable achievements. However, the limitation of most existing ensemble clustering approaches is that all base clusterings are treated equally without considering the validity of them. Some ensemble clustering algorithms are aware of using weighting strategy but also ignoring the negative impact of base clusterings with poor performance. In this paper, we propose an ensemble clustering method based on a novel weighting strategy. Specifically, the validity of each base clustering is measured by the optimal matching score between the base clustering and the whole to obtain the corresponding weight. Then, the weights of base clusterings which have negative contribution are further adjusted to get the final weight vector. Subsequently, a weighted co-association matrix is constructed to serve as the ensemble matrix and a hierarchical clustering algorithm is applied to it to generate the final result. Experimental results on different types of real-world datasets show the superiority of proposed methods.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

集成聚类的目标是通过整合多个聚类结果来提高聚类的精度,解决传统聚类算法和单一聚类算法存在的可扩展性问题。近年来,集合聚类由于其显著的研究成果而受到越来越多的关注。然而,大多数现有的集成聚类方法的局限性在于,所有的基聚类都是平等对待的,而不考虑它们的有效性。一些集成聚类算法意识到权重策略的使用,但忽略了性能较差的基聚类的负面影响。本文提出了一种基于加权策略的集成聚类方法。具体来说,每个基聚类的有效性是通过基聚类与整体的最优匹配得分来衡量的,从而得到相应的权重。然后,进一步调整具有负贡献的基聚类的权重,得到最终的权重向量。然后,构造加权协关联矩阵作为集成矩阵,并对其应用分层聚类算法生成最终结果。在不同类型的真实数据集上的实验结果表明了所提方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ensemble Clustering with Novel Weighting Strategy
The target of ensemble clustering is to improve the accuracy of clustering by integrating multiple clustering results and solve the problem of scalability existed in traditional and single clustering algorithms. In recent years, ensemble clustering has attracted increasing attention due to its remarkable achievements. However, the limitation of most existing ensemble clustering approaches is that all base clusterings are treated equally without considering the validity of them. Some ensemble clustering algorithms are aware of using weighting strategy but also ignoring the negative impact of base clusterings with poor performance. In this paper, we propose an ensemble clustering method based on a novel weighting strategy. Specifically, the validity of each base clustering is measured by the optimal matching score between the base clustering and the whole to obtain the corresponding weight. Then, the weights of base clusterings which have negative contribution are further adjusted to get the final weight vector. Subsequently, a weighted co-association matrix is constructed to serve as the ensemble matrix and a hierarchical clustering algorithm is applied to it to generate the final result. Experimental results on different types of real-world datasets show the superiority of proposed methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信