Clustering and feature selection using sparse principal component analysis
From MaRDI portal
Abstract: In this paper, we study the application of sparse principal component analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks sparse factors, or linear combinations of the data variables, explaining a maximum amount of variance in the data while having only a limited number of nonzero coefficients. PCA is often used as a simple clustering technique and sparse factors allow us here to interpret the clusters in terms of a reduced set of variables. We begin with a brief introduction and motivation on sparse PCA and detail our implementation of the algorithm in d'Aspremont et al. (2005). We then apply these results to some classic clustering and feature selection problems arising in biology.
Recommendations
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Decoding by Linear Programming
- Gene selection for cancer classification using support vector machines
- Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations
- Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Regularization and Variable Selection Via the Elastic Net
- Smooth minimization of non-smooth functions
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(22)- Sparse clustering of functional data
- An empirical comparison of two approaches for CDPCA in high-dimensional data
- The use of sparse statistical modeling in gene expression analysis using principal component analysis as an example.
- Sparsest factor analysis for clustering variables: a matrix decomposition approach
- Clustering and disjoint principal component analysis
- Sparse PCA: convex relaxations, algorithms and applications
- A framework for feature selection in clustering
- A clustering approach to interpretable principal components
- Influential features PCA for high dimensional clustering
- Sparse principal components by semi-partition clustering
- Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
- Searching for the core variables in principal components analysis
- Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes
- PCA Sparsified
- A simple approach to sparse clustering
- SubXPCA and a generalized feature partitioning approach to principal component analysis
- Distributed clustering using collective principal component analysis
- Phase transitions for high dimensional clustering and related problems
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Bayesian variable selection for globally sparse probabilistic PCA
- Biobjective sparse principal component analysis
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
This page was built for publication: Clustering and feature selection using sparse principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374668)
