Subspace clustering of high-dimensional data: a predictive approach

by   Brian McWilliams, et al.
Imperial College London

In several application domains, high-dimensional observations are collected and then analysed in search for naturally occurring data clusters which might provide further insights about the nature of the problem. In this paper we describe a new approach for partitioning such high-dimensional data. Our assumption is that, within each cluster, the data can be approximated well by a linear subspace estimated by means of a principal component analysis (PCA). The proposed algorithm, Predictive Subspace Clustering (PSC) partitions the data into clusters while simultaneously estimating cluster-wise PCA parameters. The algorithm minimises an objective function that depends upon a new measure of influence for PCA models. A penalised version of the algorithm is also described for carrying our simultaneous subspace clustering and variable selection. The convergence of PSC is discussed in detail, and extensive simulation results and comparisons to competing methods are presented. The comparative performance of PSC has been assessed on six real gene expression data sets for which PSC often provides state-of-art results.


page 1

page 2

page 3

page 4


Simultaneous Estimation of Number of Clusters and Feature Sparsity in Clustering High-Dimensional Data

Estimating the number of clusters (K) is a critical and often difficult ...

Fast Computation of Robust Subspace Estimators

Dimension reduction is often an important step in the analysis of high-d...

Tandem clustering with invariant coordinate selection

For high-dimensional data or data with noise variables, tandem clusterin...

Automatic sparse PCA for high-dimensional data

Sparse principal component analysis (SPCA) methods have proven to effici...

Entropic Wasserstein Component Analysis

Dimension reduction (DR) methods provide systematic approaches for analy...

Subspace Clustering of Very Sparse High-Dimensional Data

In this paper we consider the problem of clustering collections of very ...

KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression Analysis

Subspace clustering has gained increasing popularity in the analysis of ...

Please sign up or login with your details

Forgot password? Click here to reset