Projection subspace clustering. Issue 3 (September 2017)

• Record Type: Journal Article
• Authors: Chen, Xiaoyun; Liao, Mengzhen; Ye, Xianbao
• Is Part Of: Journal of algorithms & computational technology. Volume 11:Issue 3(2017)
• Page Start: 224
• Page End: 233
• Publication Date: 2017-09
• Subjects: Gene expression data -- subspace clustering -- sparse -- low-rank representation -- least-square regression -- projection; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1177/1748301817707321
• Languages: English
• ISSNs: 1748-3018

Abstract

Gene expression data is a kind of high dimension and small sample size data. The clustering accuracy of conventional clustering techniques is lower on gene expression data due to its high dimension. Because some subspace segmentation approaches can be better applied in the high-dimensional space, three new subspace clustering models for gene expression data sets are proposed in this work. The proposed projection subspace clustering models have projection sparse subspace clustering, projection low-rank representation subspace clustering and projection least-squares regression subspace clustering which combine projection technique with sparse subspace clustering, low-rank representation and least-square regression, respectively. In order to compute the inner product in the high-dimensional space, the kernel function is used to the projection subspace clustering models. The experimental results on six gene expression data sets show these models are effective.