GWMF: Gradient weighted matrix factorisation for recommender systems

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we developed a new algorithm, Gradient Weighted Matrix Factorisation (GWMF), for matrix factorisation. GWMF uses weights to focus the approximation in the matrix factorisation to the higher approxmation residual. Therefore, it improves the matrix factorisation accuracy and increases the speed of convergence. We also introduce a regularisation parameter to control overfitting. We applied our algorithm to a movie recommendation problem and GWMF performs better than ordinal gradient descent-based matrix factorisation (GMF) on Movielens dataset. GWMF converges faster than GMF and it guarantees lower root mean square error (RMSE) at earlier iterations on both training and testing. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Chowdhury, N., & Cai, X. (2013). GWMF: Gradient weighted matrix factorisation for recommender systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7808 LNCS, pp. 758–769). https://doi.org/10.1007/978-3-642-37401-2_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free