The Community for Technology Leaders
Green Image
Issue No. 12 - December (2011 vol. 33)
ISSN: 0162-8828
pp: 2396-2409
Natthakan Iam-On , Aberystwyth University, Aberystwyth
Tossapon Boongoen , Royal Thai Air Force Academy, Thailand
Simon Garrett , Aberystwyth University, Aberystwyth
Chris Price , Aberystwyth University, Aberystwyth
Cluster ensembles have recently emerged as a powerful alternative to standard cluster analysis, aggregating several input data clusterings to generate a single output clustering, with improved robustness and stability. From the early work, these techniques held great promise; however, most of them generate the final solution based on incomplete information of a cluster ensemble. The underlying ensemble-information matrix reflects only cluster-data point relations, while those among clusters are generally overlooked. This paper presents a new link-based approach to improve the conventional matrix. It achieves this using the similarity between clusters that are estimated from a link network model of the ensemble. In particular, three new link-based algorithms are proposed for the underlying similarity assessment. The final clustering result is generated from the refined matrix using two different consensus functions of feature-based and graph-based partitioning. This approach is the first to address and explicitly employ the relationship between input partitions, which has not been emphasized by recent studies of matrix refinement. The effectiveness of the link-based approach is empirically demonstrated over 10 data sets (synthetic and real) and three benchmark evaluation measures. The results suggest the new approach is able to efficiently extract information embedded in the input clusterings, and regularly illustrate higher clustering quality in comparison to several state-of-the-art techniques.
Clustering, cluster ensembles, cluster relations, link-based similarity, data mining.

S. Garrett, N. Iam-On, T. Boongoen and C. Price, "A Link-Based Approach to the Cluster Ensemble Problem," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 2396-2409, 2011.
86 ms
(Ver 3.3 (11022016))