Clusterer ensemble

Zhi‐Hua Zhou

doi:10.1016/j.knosys.2005.11.003

Return

Clusterer ensemble

2006-03-01

204

PRE

Zhi‐Hua Zhou

Wei Tang

DOI：10.1016/j.knosys.2005.11.003

Original

Original request for help

Save

Abstract

En 中文

Ensemble methods that train multiple learners and then combine their predictions have been shown to be very effective in supervised learning. This paper explores ensemble methods for unsupervised learning. Here, an ensemble comprises multiple clusterers. each of which is trained by k-means algorithm with different initial points. The clusters discovered by different clusterers are aligned, i.e. similar clusters are assigned with the same label, by counting their overlapped data items. Then, four methods are developed to combine the aligned clusterers. Experiments show that clustering performance could be significantly improved by ensemble methods, where utilizing mutual information to select a subset of clusterers for weighted voting is a nice choice. Since the proposed methods work by analyzing the clustering results instead of the internal mechanisms of the component clusterers, they are applicable to diverse kinds of clustering algorithms. (c) 2006 Elsevier B.V. All rights reserved.

Keywords:

machine learning

ensemble learning

clustering

unsupervised learning

selective ensemble

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.