Accelerating Infinite Ensemble of Clustering by Pivot Features

Jin, X.-B.; Xie, G.-S.; Huang, K.; Hussain, A.

Abstract

The infinite ensemble clustering (IEC) incorporates both ensemble clustering and representation learning by fusing infinite basic partitions and shows appealing performance in the unsupervised context. However, it needs to solve the linear equation system with the high time complexity in proportion to O(d3) where d is the concatenated dimension of many clustering results. Inspired by the cognitive characteristic of human memory that can pay attention to the pivot features in a more compressed data space, we propose an acceleration version of IEC (AIEC) by extracting the pivot features and learning the multiple mappings to reconstruct them, where the linear equation system can be solved with the time complexity O(dr2) (r ≪ d). Experimental results on the standard datasets including image and text ones show that our algorithm AIEC improves the running time of IEC greatly but achieves the comparable clustering performance.

Citation

Jin, X.-B., Xie, G.-S., Huang, K., & Hussain, A. (2018). Accelerating Infinite Ensemble of Clustering by Pivot Features. Cognitive Computation, 10(6), 1042-1050. https://doi.org/10.1007/s12559-018-9583-8

• Journal Article Type: Article
• Acceptance Date: Jul 17, 2018
• Online Publication Date: Jul 27, 2018
• Publication Date: 2018-12
• Deposit Date: Sep 5, 2019
• Journal: Cognitive Computation
• Print ISSN: 1866-9956
• Electronic ISSN: 1866-9964
• Publisher: BMC
• Peer Reviewed: Peer Reviewed
• Volume: 10
• Issue: 6
• Pages: 1042-1050
• DOI: https://doi.org/10.1007/s12559-018-9583-8
• Keywords: Ensemble clustering, Infinite ensemble clustering, Pivot features, Reconstruction of features
• Public URL: http://researchrepository.napier.ac.uk/Output/1792189