Sparse topical analysis of dyadic data using matrix tri-factorization
DOI10.1007/S10994-015-5537-5zbMATH Open1386.68140OpenAlexW2219291350MaRDI QIDQ331699FDOQ331699
Authors: Ranganath Biligere Narayana Swamy
Publication date: 27 October 2016
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-015-5537-5
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Ridge regression; shrinkage estimators (Lasso) (62J07) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- 10.1162/jmlr.2003.3.4-5.993
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Non-negative matrix factorization with sparseness constraints
- Learning the parts of objects by non-negative matrix factorization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Title not available (Why is that?)
- Online learning for matrix factorization and sparse coding
- On search directions for minimization algorithms
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
Uses Software
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)