.png){kind=icon}
.png){kind=icon}
Return
Ensemble clustering based on dense representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2019.04.078.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Ensemble Clustering
Similarity matrix
Subspace clustering
Outliers
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W