Proceedings of the International Conference on Web Intelligence 2017
DOI: 10.1145/3106426.3106522
|View full text |Cite
|
Sign up to set email alerts
|

Recommender systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…But they don't work well in sparse data and cold start scenarios. The Matrix Factorization-based Recommendation Algorithms (MFRAs) are another classic recommendation algorithm (Han et al, 2019;Mehta & Rana, 2017;Sommer et al, 2017). Matrix factorization (MF) can map the information of users and items into F-dimensional joint latent space to overcome the problems of sparse data and cold start (Qiu et al, 2018).…”
Section: Introductionmentioning
confidence: 99%
“…But they don't work well in sparse data and cold start scenarios. The Matrix Factorization-based Recommendation Algorithms (MFRAs) are another classic recommendation algorithm (Han et al, 2019;Mehta & Rana, 2017;Sommer et al, 2017). Matrix factorization (MF) can map the information of users and items into F-dimensional joint latent space to overcome the problems of sparse data and cold start (Qiu et al, 2018).…”
Section: Introductionmentioning
confidence: 99%