Abstract

Recently, Recommender Systems (RSs) have attracted many researchers whose goal is to improve the performance of the prediction accuracy of recommendation systems by alleviating RSs drawbacks. The most common limitations are sparsity and the cold-start problem. This article proposes two models to mitigate the effects of these limitations. The proposed models exploit five sources of information: rating information, which involves two sources, namely explicit and implicit, which can be extracted via users’ ratings, and two types of social relations: explicit and implicit relations, the last source is confidence values that are included in the first model only. The whole sources are combined into the Singular Value Decomposition plus (SVD++) method. First, to extract implicit relations, each non-friend pair of users, the Multi-Steps Resource Allocation (MSRA) method is adopted to compute the probability of being friends. If the probability has accepted value which exceeds a threshold, an implicit relationship will be created. Second, the similarity of explicit and implicit social relationships for each pair of users is computed. Regarding the first model, a confidence value between each pair of users is computed by dividing the number of common items by the total number of items which have also rated by the first user of this pair. The confidence values are combined with the similarity values to produce the weight factor. Furthermore, the weight factor, explicit, and implicit feedback information are integrated into the SVD++ method to compute the missing prediction values. Additionally, three standard datasets are utilized in this study, namely Last.Fm, Ciao, and FilmTrust, to evaluate our models. The experimental results have revealed that the proposed models outperformed state-of-the-art approaches in terms of accuracy.

Highlights

  • Recommendation Systems (RSs) play a critical role in providing interested users’ items among the mass of information that is available in online applications

  • This paper proposed two models by integrating into the first model: rating information, which indicates explicit and implicit ratings, social relations that involve explicit and implicit social relations, confidence values that are computed by measuring the common rating items of each pair of users

  • The rating and social relations were exploited without confidence values

Read more

Summary

Introduction

Recommendation Systems (RSs) play a critical role in providing interested users’ items among the mass of information that is available in online applications. The model-based approach utilizes machine learning techniques to analyze users’ activity and behavior in a particular online application, the system predicts items for that user according to his behavior [1]. There is no history information on cold-starts of users/items; RSs cannot handle this problem [5] To curtail such shortcomings, many data mining methods have been adopted, including clustering CF and matrix factorization (MF) [6], MF can find the best latent factor in the user-item matrix. Despite the explicit relations contributing to alleviate the data sparsity problem, the problem still remains because most of the users have a limited number of relations Another factor can be adopted which has massive information called implicit relations [15]

Methods
Results
Conclusion
Full Text
Paper version not known

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 call

Disclaimer: 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.