2021
DOI: 10.1007/s10660-021-09488-7
|View full text |Cite|
|
Sign up to set email alerts
|

Employing singular value decomposition and similarity criteria for alleviating cold start and sparse data in context-aware recommender systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 57 publications
0
4
0
Order By: Relevance
“…TCFACO is a method presented to reduce sparsity and cold user concerns using an explicit trust (Parvin, Moradi, & Esmaeili, 2019a). The authors introduced a context-aware recommendation algorithm called CSSVD to increase recommendation performance and mitigate the cold start and sparse data challenges (Rodpysh, Mirabedini, & Banirostam, 2021). They propose T-MRGF, a trust-ware recommendation method based on the fusion of heterogeneous multi-relational graphs.…”
Section: Trust-based Recommender Systemmentioning
confidence: 99%
“…TCFACO is a method presented to reduce sparsity and cold user concerns using an explicit trust (Parvin, Moradi, & Esmaeili, 2019a). The authors introduced a context-aware recommendation algorithm called CSSVD to increase recommendation performance and mitigate the cold start and sparse data challenges (Rodpysh, Mirabedini, & Banirostam, 2021). They propose T-MRGF, a trust-ware recommendation method based on the fusion of heterogeneous multi-relational graphs.…”
Section: Trust-based Recommender Systemmentioning
confidence: 99%
“…By adding multimodal embedding into latent components to develop better feature representations, our proposed model outperformed the baseline techniques. Direct comparison experiments were conducted to judge the performance of the suggested DTLME model when compared against CSSVD [ 58 ], TF [ 59 ], and BPR [ 60 ] algorithms. Precision, Recall, F1-score, and MAE measures were used to evaluate the performance of the specified methods.…”
Section: Results and Analysismentioning
confidence: 99%
“…Prediction accuracy and recommendation coverage are essential in testing whether a recommendation system can meet users' expectations [17] . Dynamic recommendations are vital in real-time recommendations for modern recommendation systems [18] . As can be seen from the table, the item-based multi-criteria CF and knowledge state model recommendations (KSMR) have the most comprehensive prediction accuracy and recommendation coverage at high sparsity but take slightly longer.…”
Section: Comparison and Analysis Of Recommendation Algorithmsmentioning
confidence: 99%