DocumentCode :
3076554
Title :
A Cluster Ensemble Framework for Large Data sets
Author :
Hore, Prodip ; Hall, Lawrence ; Goldgof, Dmitry
Author_Institution :
South Florida Univ., Tampa
Volume :
4
fYear :
2006
fDate :
8-11 Oct. 2006
Firstpage :
3342
Lastpage :
3347
Abstract :
Combining multiple clustering solutions is important for obtaining a robust clustering solution, merging distributed clustering solutions, and scaling to large data sets. The combination of multiple clustering solutions within a scalable and robust framework for large data sets is discussed. A scalable framework requires both cluster ensemble creation and merging to be efficient in terms of time and memory complexity. We also introduce the concept of filtering malformed clusters from the ensemble. They result from unfortunate initialization or unbalanced data distribution or noise. Experimental results on real data sets show that this approach will scale and provide cluster partitions which are functionally better or equivalent when compared to clustering all the data at once and clustering solutions contained in the ensemble. We have also compared our algorithm with other ensemble merging and scalable algorithms to point out its strengths and limitations.
Keywords :
distributed processing; pattern clustering; very large databases; cluster ensemble; distributed clustering; large data sets; malformed cluster filtering; memory complexity; multiple clustering; time complexity; Clustering algorithms; Cybernetics; Data privacy; Filtering; Iterative algorithms; Merging; Noise robustness; Partitioning algorithms; Robust stability; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 2006. SMC '06. IEEE International Conference on
Conference_Location :
Taipei
Print_ISBN :
1-4244-0099-6
Electronic_ISBN :
1-4244-0100-3
Type :
conf
DOI :
10.1109/ICSMC.2006.384634
Filename :
4274398
Link To Document :
بازگشت