Wu, O. and Hu, W. and Maybank, Stephen J. and Zhu, M. and Li, B. (2012) Efficient clustering aggregation based on data fragments. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 42 (3), pp. 913-926. ISSN 1083-4419.Full text not available from this repository.
Clustering aggregation, known as clustering ensembles, has emerged as a powerful technique for combining different clustering results to obtain a single better clustering. Existing clustering aggregation algorithms are applied directly to data points, in what is referred to as the point-based approach. The algorithms are inefficient if the number of data points is large. We define an efficient approach for clustering aggregation based on data fragments. In this fragment-based approach, a data fragment is any subset of the data that is not split by any of the clustering results. To establish the theoretical bases of the proposed approach, we prove that clustering aggregation can be performed directly on data fragments under two widely used goodness measures for clustering aggregation taken from the literature. Three new clustering aggregation algorithms are described. The experimental results obtained using several public data sets show that the new algorithms have lower computational complexity than three well-known existing point-based clustering aggregation algorithms (Agglomerative, Furthest, and LocalSearch); nevertheless, the new algorithms do not sacrifice the accuracy.
|Keyword(s) / Subject(s):||Clustering algorithms, Computational complexity, Correlation, Dispersion, Mutual information, Partitioning algorithms|
|School or Research Centre:||Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Computer Science and Informatics|
|Date Deposited:||06 Nov 2012 11:43|
|Last Modified:||17 Apr 2013 12:26|
Archive Staff Only (login required)