Weighted clustering ensemble: Towards learning the weights of the base clusterings

Clustering ensemble refers to the problem of obtaining a final clustering of a dataset by combining multiple partitions computed by different clustering algorithms. The clustering ensemble has emerged as a prominent method for improving robustness of unsupervised classification solutions. This probl...

Full description

Saved in:
Bibliographic Details
Published in:Multiagent and grid systems 2017-01, Vol.13 (4), p.421-431
Main Authors: Rouba, Baroudi, Nait Bahloul, Safia
Format: Article
Language:English
Subjects:
Clustering
Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Clustering ensemble refers to the problem of obtaining a final clustering of a dataset by combining multiple partitions computed by different clustering algorithms. The clustering ensemble has emerged as a prominent method for improving robustness of unsupervised classification solutions. This problem has been received an increasing attention in recent years but a little attention has been paid to weight the combined clusterings without access the original data. We address in this paper the problem of weighted clustering ensemble problem by defining an unsupervised method to compute the weight of each combined clustering without access the original data. The weight of each base clustering is computed using its quality and the quality of its neighbouring clusterings. The proposed method permits to estimate the right number of clusters of the final clustering before the combining step by exploiting the generated weights.
ISSN:1574-1702
1875-9076
DOI:10.3233/MGS-170278