Algebraic approach to maximum likelihood factor analysis
From MaRDI portal
Cites work
- A penalized maximum likelihood approach to sparse factor analysis
- Algebraic factor analysis: tetrads, pentads and beyond
- Computer algebra in systems biology
- Conditions for factor (in)determinacy in factor analysis
- Dimensions of higher order factor analysis models
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- EM algorithms for ML factor analysis
- Factor analysis with EM algorithm never gives improper solutions when sample covariance and initial parameter matrices are proper
- Finiteness of small factor analysis models
- scientific article; zbMATH DE number 3117083 (Why is no real title available?)
- scientific article; zbMATH DE number 3497220 (Why is no real title available?)
- scientific article; zbMATH DE number 3396952 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- On various causes of improper solutions in maximum likelihood factor analysis
- Probabilistic Principal Component Analysis
- scMerge leverages factor analysis, stable expression, and pseudoreplication to merge multiple single-cell RNA-seq datasets
- Some contributions to maximum likelihood factor analysis
- Sparse estimation via nonconcave penalized likelihood in factor analysis model
- Structural equation modeling with near singular covariance matrices
- Variable selection via the weighted group Lasso for factor analysis models
This page was built for publication: Algebraic approach to maximum likelihood factor analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868272)
