Name
Abstract | ||
|---|---|---|
AbstractAbstractAfter observing the ensemble success in supervised learning (such as classification), it was extended into unsupervised learning. Therefore, cluster ensemble, which merges multiple basic data partitions or clusters (called as ensemble pool) into an ordinarily better clustering solution usually named as consensus partition, emerged. Any cluster ensemble method tries to optimize a particular criterion during extracting the consensus partition out of the ensemble pool. But traditional cluster ensembles consider all the pool members with the equal importance in making the consensus partition; that is to say that each basic partition or cluster participates in the cluster ensemble algorithm equivalently. Indeed, they ignore to consider any ensemble member according to its importance. But it is obvious that some clusters with more quality deserve more emphasis and some clusters with less quality deserve less emphasis during generating consensus partition. This paper proposes (a) a metric to evaluate quality of any arbitrary cluster, (b) a mechanism to project the computed quality of a cluster into a meaningful weight value, and (c) an approach to apply the weight values of the basic clusters in the cluster ensemble process. Experimental results conducted on a number of real‐world standard datasets indicate that the proposed method outperforms the state of the art methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/sam.11451 | Periodicals |
Keywords | DocType | Volume |
cluster dependability,clustering ensemble,consensus partition,entropy | Journal | 13 |
Issue | ISSN | Citations |
2 | 1932-1864 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fatemeh Najafi | 1 | 0 | 0.34 |
| Hamid Parvin | 2 | 263 | 41.94 |
| Kamal Mirzaie | 3 | 0 | 0.34 |
| Samad Nejatian | 4 | 0 | 0.34 |
| V. Rezaie | 5 | 36 | 5.34 |