Double Regularization Matrix Factorization Recommendation Algorithm

With the development of social networks, the research of integrated social information recommendation models has received extensive attention. However, most existing social recommendation models are based on the matrix factorization technique which ignore the impact of the relationships between items on users' interests, resulting in a decline of recommendation accuracy. To solve this problem, this paper proposes a double regularization matrix factorization recommendation algorithm. The algorithm first uses attribute information and manifold learning to calculate similarity. Then, the matrix factorization model is constrained through the regularization of item association relations and user social relations. Experimental results on real datasets show that the proposed method can effectively alleviate problems such as cold start and data sparsity in the recommender system and improve the recommendation accuracy compared with those of existing methods.