In the pursuit of sparseness: a new rank-preserving penalty for a finite mixture of factor analyzers
From MaRDI portal
Recommendations
- Regularized parameter estimation in high-dimensional Gaussian mixture models
- On parsimonious models for modeling matrix data
- A penalized maximum likelihood approach to sparse factor analysis
- Single- and multiple-group penalized factor analysis: a trust-region algorithm approach with integrated automatic multiple tuning parameter selection
- Penalized model-based clustering with unconstrained covariance matrices
Cites work
- \(\ell_{1}\)-penalization for mixture regression models
- A mixture of generalized hyperbolic distributions
- A mixture of generalized hyperbolic factor analyzers
- A mixture of variance-gamma factor analyzers
- Capturing patterns via parsimonious t mixture models
- Estimating common principal components in high dimensions
- Estimating the dimension of a model
- Estimation of an oblique structure via penalized likelihood factor analysis
- Extending mixtures of multivariate t-factor analyzers
- Finite mixture models
- High-dimensional data clustering
- scientific article; zbMATH DE number 1086057 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Matrix Analysis
- Mixtures of factor analysers. Bayesian estimation and inference by stochastic simulation
- Mixtures of multivariate restricted skew-normal factor analyzer models in a Bayesian framework
- Mixtures of skew-\(t\) factor analyzers
- Model Selection and Estimation in Regression with Grouped Variables
- Multivariate response and parsimony for Gaussian cluster-weighted models
- Orthogonal Stiefel manifold optimization for eigen-decomposed covariance parameter estimation in mixture models
- Penalized model-based clustering
- Penalized model-based clustering with application to variable selection
- Penalty-free sparse PCA
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems
- Sharp quadratic majorization in one dimension
- Sparse estimation via nonconcave penalized likelihood in factor analysis model
- Sparse exploratory factor analysis
- Sparse versus simple structure loadings
- Sparsest factor analysis for clustering variables: a matrix decomposition approach
- Subspace clustering for the finite mixture of generalized hyperbolic distributions
This page was built for publication: In the pursuit of sparseness: a new rank-preserving penalty for a finite mixture of factor analyzers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242013)
