2020
DOI: 10.1016/j.knosys.2020.105798
|View full text |Cite
|
Sign up to set email alerts
|

Pair-wise Preference Relation based Probabilistic Matrix Factorization for Collaborative Filtering in Recommender System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 56 publications
(16 citation statements)
references
References 26 publications
0
16
0
Order By: Relevance
“…This method is the standard item-based CF that is based on neighborhood models in recommender systems [10,14,68]. We followed the setting of the existing literature to adapt it to an explicit dataset [2,72]. The most common item-based CF is a similarity measure between items, where sim(i, j) denotes the similarity of item i and item j.…”
Section: Build Several Types Of Recommender Systemmentioning
confidence: 99%
“…This method is the standard item-based CF that is based on neighborhood models in recommender systems [10,14,68]. We followed the setting of the existing literature to adapt it to an explicit dataset [2,72]. The most common item-based CF is a similarity measure between items, where sim(i, j) denotes the similarity of item i and item j.…”
Section: Build Several Types Of Recommender Systemmentioning
confidence: 99%
“…The latent features are defined using the singular value decomposition algorithm [22]. Many factorization methods integrate latent and baseline features of users and items utilizing several formulae [7]. For example, the baseline formula can be used to predict the missing rating scores in the rating matrix as shown in Equation (1).…”
Section: A Matrix Factorizationmentioning
confidence: 99%
“…For example, CF utilizes the rating scores of neighbours to predict a list of items to the active user. However, CF suffers from three main issues: data sparsity [3], [4], cold start [5], [6], and scalability [7] [8]. This paper briefly discusses the approaches utilized to solve the sparsity issue.…”
Section: Introductionmentioning
confidence: 99%
“…The most popular models are Matrix Factorization (MF) and Neural Networks (NN). MF [14]- [18] models transform the rating matrix in two new matrices that contain a low-dimensional representation of users and items and can be used to recreate the original matrix as closely as possible. NNs [19] models use deep networks to extract and join latent information from users and items in a non-linear fashion, modeling users' preferences.…”
Section: Introductionmentioning
confidence: 99%