Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4969805 | Pattern Recognition | 2017 | 10 Pages |
Abstract
We consider an approach to ensemble clustering based on weighted co-association matrices, where the weights are determined with some evaluation functions. Using a latent variable model of clustering ensemble, it is proved that, under certain assumptions, the clustering quality is improved with an increase in the ensemble size and the expectation of evaluation function. Analytical dependencies between the ensemble size and quality estimates are derived. Theoretical results are supported with numerical examples using Monte-Carlo modeling and segmentation of a real hyperspectral image under presence of noise channels.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Vladimir Berikov, Igor Pestunov,