Exploring dimension learning via a penalized probabilistic principal component analysis
From MaRDI portal
Cites work
- A high-dimensional test for the equality of the smallest eigenvalues of a covariance matrix
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Automatic PCA dimension selection for high dimensional data and small sample sizes
- Bayes Factors
- Determining the Number of Factors in Approximate Factor Models
- Estimation of the number of spikes, possibly equal, in the high-dimensional case
- Exact dimensionality selection for Bayesian PCA
- scientific article; zbMATH DE number 4086787 (Why is no real title available?)
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3092167 (Why is no real title available?)
- Inferring the eigenvalues of covariance matrices from limited, noisy data
- Likelihood ratio test for partial sphericity in high and ultra-high dimensions
- Model Averaging and Dimension Selection for the Singular Value Decomposition
- On estimation of the noise variance in high dimensional probabilistic principal component analysis
- On the distribution of the largest eigenvalue in principal components analysis
- Optimal detection of sparse principal components in high dimension
- Practical approaches to principal component analysis in the presence of missing values
- Principal component analysis.
- Probabilistic Principal Component Analysis
- Selecting the number of components in principal component analysis using cross-validation approximations
- Selecting the number of principal components: estimation of the true rank of a noisy matrix
- Shrinkage tuning parameter selection with a diverging number of parameters
- Some hypothesis tests for the covariance matrix when the dimension is large compared to the sample size
- Sparse estimation of a covariance matrix
- TESTS OF SIGNIFICANCE FOR THE LATENT ROOTS OF COVARIANCE AND CORRELATION MATRICES
- The Optimal Hard Threshold for Singular Values is <inline-formula> <tex-math notation="TeX">\(4/\sqrt {3}\) </tex-math></inline-formula>
Cited in
(3)
This page was built for publication: Exploring dimension learning via a penalized probabilistic principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887975)