2021
DOI: 10.3991/ijim.v15i01.17751
|View full text |Cite
|
Sign up to set email alerts
|

Two Models Based on Social Relations and SVD++ Method for Recommendation System

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’ rating… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…The SVD is good for with few datasets and it can improve performance on many algorithms. It majorly uses the Principal component analysis(PCA) [20] which is useful for dimensional reduction. [20] The Single Value Decomposition (SVD++) is extension of SVD algorithm, with considering implicit ratings This is equivalent to Probabilistic Matrix Factorization algorithm.It Constructs a matrix with the row of users and columns of items and the elements are given by the users' ratings.…”
Section: A = Usv ⊤mentioning
confidence: 99%
“…The SVD is good for with few datasets and it can improve performance on many algorithms. It majorly uses the Principal component analysis(PCA) [20] which is useful for dimensional reduction. [20] The Single Value Decomposition (SVD++) is extension of SVD algorithm, with considering implicit ratings This is equivalent to Probabilistic Matrix Factorization algorithm.It Constructs a matrix with the row of users and columns of items and the elements are given by the users' ratings.…”
Section: A = Usv ⊤mentioning
confidence: 99%
“…Ref. [48] considers for example a 2D user-item matrix, where p represents rows of users, and q denotes the columns of items. The user rating value for items is r u,i .…”
Section: • Svd++mentioning
confidence: 99%
“…• |R i | represents the "number of items" that have been evaluated by multiple users; • y j designates the left orthogonal of implicit matrix. • λ1, λ2 are additional parameters added to values |R u | and |R i | for regularization [48].…”
mentioning
confidence: 99%
“…It majorly uses the Principal component analysis(PCA) which is useful for dimensional reduction. [20] The Single Value Decomposition (SVD++) is extension of SVD algorithm, with considering implicit ratings This is equivalent to Probabilistic Matrix Factorization algorithm. It Constructs a matrix with the row of users and columns of items and the elements are given by the users' ratings.…”
Section: B Matrix Factorization Algorithmmentioning
confidence: 99%