Sparse topical analysis of dyadic data using matrix tri-factorization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
- Learning the parts of objects by non-negative matrix factorization
- Non-negative matrix factorization with sparseness constraints
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- On search directions for minimization algorithms
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Online learning for matrix factorization and sparse coding
- Projected Gradient Methods for Nonnegative Matrix Factorization
This page was built for publication: Sparse topical analysis of dyadic data using matrix tri-factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331699)