poismf
Factorization of Sparse Counts Matrices Through Poisson Likelihood
Creates a non-negative low-rank approximate factorization of a sparse counts matrix by maximizing Poisson likelihood with L1/L2 regularization (e.g. for implicit-feedback recommender systems or bag-of-words-based topic modeling) (Cortes, (2018) doi:10.48550/arXiv.1811.01908), which usually leads to very sparse user and item factors (over 90% zero-valued). Similar to hierarchical Poisson factorization (HPF), but follows an optimization-based approach with regularization instead of a hierarchical prior, and is fit through gradient-based methods instead of variational inference.
- Version0.4.0-4
- R versionunknown
- LicenseBSD_2_clause
- LicenseLICENSE
- Needs compilation?Yes
- Last release03/26/2023
Team
David Cortes
Jean-Sebastien Roy
Show author detailsRolesCopyright holderStephen Nash
Show author detailsRolesCopyright holder
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package