Constraint projections for semi‐supervised spectral clustering ensemble. (29th May 2019)

• Record Type: Journal Article
• Authors: Yang, Jingya; Sun, Linfu; Wu, Qishi
• Is Part Of: Concurrency and computation. Volume 31:Number 20(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-05-29
• Subjects: constraint projection -- pairwise constraints -- semi‐supervised learning (SSL) -- similarity matrix -- spectral clustering; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5359
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Cluster ensemble combines multiple base clustering results in a suitable way to improve the accuracy of the clustering result. In the conventional cluster ensemble frameworks, pairwise constraints and constraint projections have not been used together, and spectral clustering algorithm is rarely adopted to serve as the consensus function. In this paper, we design a constraint projections for semi‐supervised spectral clustering ensemble (CPSSSCE) model. It takes advantages of spectral clustering algorithm and executes semi‐supervised learning twice. Compared to traditional cluster ensemble approaches, CPSSSCE is characterized by several properties. First, the original data are transformed to lower‐dimensional representations by constraint projection before base clustering. Second, a similarity matrix is constructed using the base clustering results and modified using pairwise constraints. Third, the spectral clustering algorithm is applied to process the similarity matrix to obtain a consensus cluster result. Extensive experiments on standard University of California Irvine Machine Learning Repository (UCI) and Microsoft datasets demonstrated that the CPSSSCE is superior to other cluster ensemble algorithms including a semi‐supervised spectral clustering ensemble.