DICLENS : Divisive Clustering Ensemble with automatic cluster numberDICLENS : Divisive Clustering Ensemble with automatic cluster number
Faculty of Sciences. Mathematics and Computer Science
Advanced Database Research and Modeling (ADReM)
2012New York, N.Y., 2012
IEEE/ACM transactions on computational biology and bioinformatics / Institute of Electrical and Electronics Engineers [New York, N.Y.] - New York, N.Y.
9(2012):2, p. 408-420
Clustering has a long and rich history in a variety of scientific fields. Finding natural groupings of a data set is a hard task as attested by hundreds of clustering algorithms in the literature. Each clustering technique makes some assumptions about the underlying data set. If the assumptions hold, good clusterings can be expected. It is hard, in some cases impossible, to satisfy all the assumptions. Therefore, it is beneficial to apply different clustering methods on the same data set, or the same method with varying input parameters or both. We propose a novel method, DICLENS, which combines a set of clusterings into a final clustering having better overall quality. Our method produces the final clustering automatically and does not take any input parameters, a feature missing in many existing algorithms. Extensive experimental studies on real, artificial, and gene expression data sets demonstrate that DICLENS produces very good quality clusterings in a short amount of time. DICLENS implementation runs on standard personal computers by being scalable, and by consuming very little memory and CPU.