Abstract
Matrix factorization is an efficient method to predict users' preference in recommender systems. Probabilistic matrix factorization (PMF) is an improved version of matrix factorization, and its assumption is more realistic. However PMF is prone to over-fitting. The algorithm local low-rank matrix approximation (LLORMA) performs well as it assumes the observed ratings matrix is local low-rank. Inspired by this, local probabilistic matrix factorization (LPMF) is proposed by introducing LLORMA to PMF. LPMF can find a certain number of local optimal points to estimate the parameters, and it will effectively alleviate over-fitting in every local model. By testing two benchmark datasets, MovieLens and Netflix, the experimental results demonstrate that the proposed algorithm could help PMF to find better parameters to a material extent.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
