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

A novel deep multi-criteria collaborative filtering model for recommendation system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
68
0
3

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 194 publications
(84 citation statements)
references
References 18 publications
0
68
0
3
Order By: Relevance
“…There are some other approaches that provide neural networks based on improved information coming from data, such as [29], where authors extract interaction behavior from bipartite graphs. Deep-learning architectures can be designed by extracting multi-criteria information from data [30]. Additionally, a classification-based deep learning collaborative filtering approach is stated in [31], where the learning process takes as information two different binary sources: (a) relevant/non-relevant votes, and (b) voted/non-voted items.…”
Section: Of 14mentioning
confidence: 99%
“…There are some other approaches that provide neural networks based on improved information coming from data, such as [29], where authors extract interaction behavior from bipartite graphs. Deep-learning architectures can be designed by extracting multi-criteria information from data [30]. Additionally, a classification-based deep learning collaborative filtering approach is stated in [31], where the learning process takes as information two different binary sources: (a) relevant/non-relevant votes, and (b) voted/non-voted items.…”
Section: Of 14mentioning
confidence: 99%
“…At present, many model-based CF algorithms have been put forward, where matrix decomposition has gradually become the mainstream method in modelbased CF algorithms by virtue of transformation of high-dimensional sparse user rating data and excellent extensibility [12]. The main idea is to decompose the original user-commodity rating matrix into low-rank potential matrix through technologies like singular value decomposition and then obtain the prediction result through an analysis [15]. Matrix decomposition method has relieved the sparsity problem of CF algorithm to a certain degree, but cold start problem remains to be solved, so it is impossible to predict the probability for user to purchase new commodities with difficult similarity calculation [16,17].…”
Section: Collaborative Filtering Algorithmmentioning
confidence: 99%
“…At present many model-based CF algorithms have been put forward, where matrix decomposition has gradually become the mainstream method in model-based CF algorithms by virtue of transformation of highdimensional sparse user rating data and excellent extensibility [12]. The main idea is to decompose the original user-commodity rating matrix into low-rank potential matrix through technologies like singular value decomposition and then obtain the prediction result through an analysis [15]. Matrix decomposition method has relieved the sparsity problem of CF algorithm to a certain degree, but cold start problem remains to be solved, so it is impossible to predict the probability for user to purchase new commodities with difficult similarity calculation [16,17].…”
Section: Related Work 21 Collaborative Filtering Algorithmmentioning
confidence: 99%