Name
Abstract | ||
|---|---|---|
In order to improve the performance of a clustering on a data set, a number of primary partitions are generated and stored in an ensemble and their aggregated consensus partition is used as their clustering. It is widely accepted that the consensus partition outperforms the primary partitions. In this paper, an ensemble clustering method called multi-level consensus clustering (MLCC) is proposed. To construct the MLCC, a cluster-cluster similarity matrix which is achieved by an innovative similarity metric is first generated. The mentioned cluster-cluster similarity matrix is based on a multi-level similarity metric. In fact, it can be computed in a new defined multi-level space. Then, a point-point similarity matrix which is boosted using the mentioned cluster-cluster similarity matrix is generated. The new consensus function applies an average linkage hierarchical clusterer algorithm on the mentioned point-point similarity matrix to make consensus partition. MLCC is better than traditional clustering ensembles and simple versions of clustering ensembles on traditional cluster-cluster similarity matrix. Its computational cost is not very bad too. Accuracy and robustness of the proposed method are compared with those of the modern clustering algorithms through the experimental tests. Also, time analysis is presented in the experimental results. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00500-021-06092-7 | SOFT COMPUTING |
Keywords | DocType | Volume |
Consensus partition, Multi-level similarity metric, Ensemble learning | Journal | 25 |
Issue | ISSN | Citations |
21 | 1432-7643 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kim-Hung Pho | 1 | 0 | 1.01 |
| Hamidreza Akbarzadeh | 2 | 0 | 0.34 |
| Hamid Parvin | 3 | 263 | 41.94 |
| Samad Nejatian | 4 | 22 | 6.14 |
| Hamid Alinejad-Rokny | 5 | 0 | 0.34 |