Olivier Gouvert, Thomas Oberlin, Cédric Févotte
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce a new non-negative matrix factorization (NMF) method for ordinal data, called OrdNMF. Ordinal data are categorical data which exhibit a natural ordering between the categories. In particular, they can be found in recommender systems, either with explicit data (such as ratings) or implicit data (such as quantized play counts). OrdNMF is a probabilistic latent factor model that generalizes Bernoulli-Poisson factorization (Be-PoF) and Poisson factorization (PF) applied to binarized data. Contrary to these methods, Ord-NMF circumvents binarization and can exploit a more informative representation of the data. We design an efficient variational algorithm based on a suitable model augmentation and related to variational PF. In particular, our algorithm preserves the scalability of PF and can be applied to huge sparse datasets. We report recommendation experiments on explicit and implicit datasets, and show that OrdNMF outperforms BePoF and PF applied to binarized data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.01034")
get_code_for_paper("2006.01034")
have("2006.01034")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.01034.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.01034)
Connect an agent — have() is free.