Understanding large text corpora via sparse machine learning
From MaRDI portal
(Redirected from Publication:4969899)
Cites work
- scientific article; zbMATH DE number 5957506 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/153244303322753643
- 10.1162/jmlr.2003.3.4-5.993
- Compressed sensing
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Generalized power method for sparse principal component analysis
- Just relax: convex programming methods for identifying sparse signals in noise
- Lasso-type recovery of sparse representations for high-dimensional data
- Learning Multiscale Sparse Representations for Image and Video Restoration
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Multi-label large margin hierarchical perceptron
- Near-ideal model selection by \(\ell _{1}\) minimization
- Optimal solutions for sparse principal component analysis
- Pathwise coordinate optimization
- Safe Feature Elimination in Sparse Supervised Learning
- Sparse PCA: convex relaxations, algorithms and applications
- Sparse boosting
- Sparse graphical models for exploring gene expression data
- Sparse inverse covariance estimation with the graphical lasso
- Sparse principal component analysis via regularized low rank matrix approximation
- Topology selection in graphical models of autoregressive processes
Cited in
(2)
This page was built for publication: Understanding large text corpora via sparse machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969899)
