.png){kind=icon}
返回
Ensemble clustering based on dense representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2019.04.078.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ensemble clustering has emerged as a powerful tool for improving the stability and accuracy of the clustering task. Although various approaches have been proposed for improving the performance of algorithms, most of them ignored two crucial messages provided by base clusterings. First, some samples of input data may be outliers that locate the boundary of the clusters and can be easily partitioned into different clusters. Second, must-link information exists amongst some instances. In this paper, we develop a novel ensemble method that utilizes a dense representation model to construct a pairwise similarity matrix, and further obtain the final ensemble clusterings result via Ncut. In particular, a robust loss function is used in the proposed model, which can weaken the effect caused by outliers. As the model is convex but non-smooth, we propose a customized re-weighted optimization method and theoretically prove that the final solution provided by it is the global optimal solution for the original problem. Furthermore, by analysing the particular structure of input clusterings, we introduce a slimming strategy, which can utilize the must-link information amongst instances to reduce the size of input data and further reduce the time cost for constructing similarity matrix. Numerous experimental results on real datasets demonstrate the advantages of proposed method over the state-of-the-art algorithms. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Ensemble Clustering
Similarity matrix
Subspace clustering
Outliers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
PREAI
分享收藏Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization通过迭代加权最小二乘最小化实现平滑低秩和稀疏矩阵恢复
OAAI
OAAI分享收藏Spatio-temporal union of subspaces for multi-body non-rigid structure-from-motion.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容