An initialization method for the latent vectors in probabilistic matrix factorization for sparse datasets

• Published in: Evolutionary intelligence Vol. 13; no. 2; pp. 269 - 281
• Main Author: Ar, Yilmaz
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020; Springer Nature B.V
• Subjects: Algorithms; Applications of Mathematics; Artificial Intelligence; Bioinformatics; Control; Datasets; Engineering; Factorization; Mathematical analysis; Mathematical and Computational Engineering; Matrix algebra; Matrix methods; Mechatronics; Recommender systems; Robotics; Special Issue; Statistical Physics and Dynamical Systems; Recommendation systems; Probabilistic matrix factorization; Latent vectors; Sparsity
• ISSN: 1864-5909; 1864-5917
• DOI: 10.1007/s12065-019-00299-2

Recommendation-based e-commerce applications have been utilized by many companies to increase their sales performance. Probabilistic matrix factorization (PMF) is a widely-used method for collaborative filtering in recommendation systems. Although the method’s performance has been demonstrated successfully in many challenging datasets including Netflix, they are not able to perform well in large sparse datasets where there is considerably low number of rating information. As a remedy, numerous advancements of PMF were proposed which incorporated side information into latent vectors as priors in order to ensure richer prior information in them. However, in cases where such side information is inaccessible, PMF-based algorithms do not perform well. In this study, we propose two new initialization methods for PMF which take into consideration the distribution statistics of user product ratings to enrich latent vectors. The experiments show that the proposed solutions give better results to those in the literature in very sparse datasets.