Clustering and feature selection using sparse principal component analysis

DOI10.1007/S11081-008-9057-ZzbMATH Open1273.92038arXiv0707.0701OpenAlexW2063564733MaRDI QIDQ374668FDOQ374668

Authors: Ronny Luss, Alexandre d'Aspremont 

Publication date: 24 October 2013

Published in: Optimization and Engineering (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0707.0701

Recommendations

• Sparse principal components by semi-partition clustering
• Sparse PCA: convex relaxations, algorithms and applications
• An exact approach to sparse principal component analysis
• A framework for feature selection in clustering
• A guide for sparse PCA: model comparison and applications

zbMATH Keywords

clusteringfeature selectionsemidefinite programmingsparse principal component analysis

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Numerical optimization and variational techniques (65K10) Genetics and epigenetics (92D10) Semidefinite programming (90C22)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Title not available (Why is that?)
• Gene selection for cancer classification using support vector machines
• Title not available (Why is that?)
• Regularization and Variable Selection Via the Elastic Net
• Smooth minimization of non-smooth functions
• Title not available (Why is that?)
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Decoding by Linear Programming
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
• Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations

Cited In (22)

• Sparse PCA: convex relaxations, algorithms and applications
• Sparse principal components by semi-partition clustering
• Sparsest factor analysis for clustering variables: a matrix decomposition approach
• Searching for the core variables in principal components analysis
• A simple approach to sparse clustering
• Phase transitions for high dimensional clustering and related problems
• Title not available (Why is that?)
• Distributed clustering using collective principal component analysis
• The use of sparse statistical modeling in gene expression analysis using principal component analysis as an example.
• Biobjective sparse principal component analysis
• PCA Sparsified
• A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
• Sparse clustering of functional data
• A clustering approach to interpretable principal components
• An empirical comparison of two approaches for CDPCA in high-dimensional data
• SubXPCA and a generalized feature partitioning approach to principal component analysis
• Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
• Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes
• A framework for feature selection in clustering
• Influential features PCA for high dimensional clustering
• Bayesian variable selection for globally sparse probabilistic PCA
• Clustering and disjoint principal component analysis

Uses Software

• SeDuMi
• RankGene

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)