Ordinal Non-negative Matrix Factorization for Recommendation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Ordinal Non-negative Matrix Factorization for Recommendation

Résumé

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.
Fichier principal
Vignette du fichier
ICML-2020-ordinal-non-negative-matrix-factorization-for-recommendation-Paper.pdf (579.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03049397 , version 1 (09-12-2020)

Identifiants

  • HAL Id : hal-03049397 , version 1

Citer

Olivier Gouvert, Thomas Oberlin, Cédric Févotte. Ordinal Non-negative Matrix Factorization for Recommendation. International Conference on Machine Learning (ICML), 2020, Vienna (virtual), Austria. ⟨hal-03049397⟩
49 Consultations
94 Téléchargements

Partager

Gmail Facebook X LinkedIn More