Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
From MaRDI portal
Publication:2011084
DOI10.1016/J.AMC.2019.01.047zbMATH Open1429.65095arXiv1607.07607OpenAlexW2951329576MaRDI QIDQ2011084FDOQ2011084
Authors: Gianna M. Del Corso, Francesco Romani 
Publication date: 28 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Abstract: The Nonnegative Matrix Factorization (NMF) of the rating matrix has shown to be an effective method to tackle the recommendation problem. In this paper we propose new methods based on the NMF of the rating matrix and we compare them with some classical algorithms such as the SVD and the regularized and unregularized non-negative matrix factorization approach. In particular a new algorithm is obtained changing adaptively the function to be minimized at each step, realizing a sort of dynamic prior strategy. Another algorithm is obtained modifying the function to be minimized in the NMF formulation by enforcing the reconstruction of the unknown ratings toward a prior term. We then combine different methods obtaining two mixed strategies which turn out to be very effective in the reconstruction of missing observations. We perform a thoughtful comparison of different methods on the basis of several evaluation measures. We consider in particular rating, classification and ranking measures showing that the algorithm obtaining the best score for a given measure is in general the best also when different measures are considered, lowering the interest in designing specific evaluation measures. The algorithms have been tested on different datasets, in particular the 1M, and 10M MovieLens datasets containing ratings on movies, the Jester dataset with ranting on jokes and Amazon Fine Foods dataset with ratings on foods. The comparison of the different algorithms, shows the good performance of methods employing both an explicit and an implicit regularization scheme. Moreover we can get a boost by mixed strategies combining a fast method with a more accurate one.
Full work available at URL: https://arxiv.org/abs/1607.07607
Recommendations
- A matrix factorization algorithm with hybrid implicit and explicit attributes for recommender systems
- Improving top-\(N\) recommendation performance using missing data
- A survey of accuracy evaluation metrics of recommendation tasks
- Statistical significance of the Netflix challenge
- An initialization method to improve the training time of matrix factorization algorithm for fast recommendation
Cites Work
- Network analysis via partial spectral factorization and Gauss quadrature
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Learning the parts of objects by non-negative matrix factorization
- Eigentaste: A constant time collaborative filtering algorithm
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- An Arnoldi-type algorithm for computing Page Rank
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- PageRank beyond the web
- A combined approach for evaluating papers, authors and scientific journals
- An efficient elimination strategy for solving PageRank problems
- Out-of-core SVD performance for document indexing
Cited In (6)
- The recommender problem with convex hulls
- An initialization method to improve the training time of matrix factorization algorithm for fast recommendation
- Maximizing e-tailers' sales volume through the shipping-fee discount and product recommendation system
- Matrix and tensor factorization techniques for recommender systems
- Improving top-\(N\) recommendation performance using missing data
- A matrix factorization algorithm with hybrid implicit and explicit attributes for recommender systems
Uses Software
This page was built for publication: Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011084)
