An empirical comparison of two approaches for CDPCA in high-dimensional data

DOI10.1007/s10260-020-00546-2zbMath1480.62116OpenAlexW3050563952MaRDI QIDQ2062344

Maurizio Vichi, Eloísa Macedo, A. Freitas

Publication date: 27 December 2021

Published in: Statistical Methods and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11573/1470903

zbMATH Keywords

semidefinite programmingprincipal component analysisclustering of objectspartitioning of attributes

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Uses Software

• R
• fpc
• plsgenomics
• spls
• NbClust
• sparsepca
• biplotbootGUI

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse Principal Component Analysis via Variable Projection
• Sparse principal component analysis subject to prespecified cardinality of loadings
• Sparse principal component analysis and iterative thresholding
• Clustering and disjoint principal component analysis
• Two-mode multi-partitioning
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• Principal component analysis.
• The ultrametric correlation matrix for modelling hierarchical latent concepts
• Disjoint factor analysis with cross-loadings
• Simple Principal Components
• A clustering approach to interpretable principal components
• Approximating K‐means‐type Clustering via Semidefinite Programming
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Constrained principal component analysis: A comprehensive theory