K-means selective cluster ensembles based on multiple feature subsets
Lists
Only you see this
Abstract
Combining multiple clusterers is emerged as a powerful method for improving both the robustness and the stability of unsupervised classification solutions. In this paper, k-means selective cluster ensembles based on multiple feature subsets are proposed. In the ensemble, a random subset of features is used to train an individual k-means clusterer. In the final step, the selective weighted voting scheme is used for finding the best partition. The consensus function is constructed by relabeling all partitions of clusterers and finding the best partition. Experimental results on 4 UCI data sets show that our ensemble method can improve the clustering performance.
BibTeX
@inproceedings{zhang2009k,
author = {Li Zhang and Weida Zhou and Haishuang Zou and Jieting Huo and Caili Wu and Licheng Jiao},
title = {{K-means selective cluster ensembles based on multiple feature subsets}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2009},
doi = {10.1117/12.832625},
}Loading related content...