Clustering and feature selection using sparse principal component analysis
From MaRDI portal
Publication:374668
DOI10.1007/s11081-008-9057-zzbMath1273.92038arXiv0707.0701OpenAlexW2063564733MaRDI QIDQ374668
Alexandre d'Aspremont, Ronny Luss
Publication date: 24 October 2013
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.0701
Factor analysis and principal components; correspondence analysis (62H25) Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Genetics and epigenetics (92D10)
Related Items (6)
Searching for the core variables in principal components analysis ⋮ PCA Sparsified ⋮ Unnamed Item ⋮ Projected Gustafson-Kessel Clustering Algorithm and Its Convergence ⋮ Sparse clustering of functional data ⋮ Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- 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
- Decoding by Linear Programming
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations
- Regularization and Variable Selection Via the Elastic Net
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Gene selection for cancer classification using support vector machines
This page was built for publication: Clustering and feature selection using sparse principal component analysis
