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

A scalable and robust trust-based nonnegative matrix factorization recommender using the alternating direction method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 55 publications
(15 citation statements)
references
References 38 publications
0
14
0
1
Order By: Relevance
“…For ex-ample, a user relationship graph-based information between users called "trust" can be used together. Previously, there have been many studies that have used trust together make more personalized and accurate recommendations [24]- [27]. However, these studies did not consider temporal properties such as sequential information and temporal interval.…”
Section: Discussionmentioning
confidence: 99%
“…For ex-ample, a user relationship graph-based information between users called "trust" can be used together. Previously, there have been many studies that have used trust together make more personalized and accurate recommendations [24]- [27]. However, these studies did not consider temporal properties such as sequential information and temporal interval.…”
Section: Discussionmentioning
confidence: 99%
“…To tackle the data sparsity problem and the cold-start problem, in [24], the authors propose a probabilistic matrix factorization framework for an online recommendation. The authors in [25], present a non-negative variant of matrix factorization that integrates social trust information in a model that addresses data sparsity and cold start issues. With a similar trend, the authors in [26] integrate social information into their recommender system based on a matrix factorization method.…”
Section: B Model-based Methodsmentioning
confidence: 99%
“…While CF employs algorithms and models based on users' previous behavior and the behavior of their neighbors who share similar preferences, the core of CB is to identify users' preferences and determine a cluster of objects with similar properties (Alyari and Navimipour, 2018). However, this research has evident limitations, such as the scalability problem, cold-start problem and selection problem (Gondaliya and Amin, 2019;Konstan and Riedl, 2012;Park et al, 2012;Parvin et al, 2019;Shani and Gunawardana, 2013). For example, the cold-start problem means that the systems cannot provide sufficient information for new users, which is a common issue in almost all recommendation systems (Liu et al, 2014).…”
Section: Literature Reviewmentioning
confidence: 99%