DMCA
Robust Data Clustering (2003)
Cached
Download Links
- [www.cse.msu.edu]
- [www.lx.it.pt]
- [www.cse.msu.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 272 - 8 self |
BibTeX
@MISC{Fred03robustdata,
author = {Ana L. N. Fred and Anil K. Jain},
title = {Robust Data Clustering},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an information-theoretical framework; mutual information is the underlying concept used in the definition of quantitative measures of agreement or consistency between data partitions. Robustness is assessed by variance of the cluster membership, based on bootstrapping. We propose and analyze a voting mechanism on pairwise associations of patterns for combining data partitions. We show that the proposed technique attempts to optimize the mutual information based criteria, although the optimality is not ensured in all situations. This evidence accumulation method is demonstrated by combining the well-known Kmeans algorithm to produce clustering ensembles. Experimental results show the ability of the technique to identify clusters with arbitrary shapes and sizes.
Keyphrases
data partition robust data clustering mutual information robust clustering cluster membership information-theoretical framework evidence accumulation method quantitative measure technique attempt experimental result multiple clustering well-known kmeans algorithm voting mechanism pairwise association arbitrary shape
