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

Enriching Non-negative Matrix Factorization with Contextual Embeddings for Recommender Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(22 citation statements)
references
References 16 publications
0
22
0
Order By: Relevance
“…Matrix factorization (MF) is a well-known mathematical scheme that has recently been applied to a range of complex problems in the numerical linear algebra, machine learning and computational biology. Some notable examples include Eigendecomposition of a matrix [36], Data Compression [37], Recommender Systems [38], Spectral Clustering [24], and gene expression analysis [39]. Some of the MF-based techniques that have been used widely are Singular Value Decomposition (SVD) [40], Principle Component Analysis (PCA) [41], and Probabilistic Matrix Factorization (PMF) [42].…”
Section: Matrix Factorizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Matrix factorization (MF) is a well-known mathematical scheme that has recently been applied to a range of complex problems in the numerical linear algebra, machine learning and computational biology. Some notable examples include Eigendecomposition of a matrix [36], Data Compression [37], Recommender Systems [38], Spectral Clustering [24], and gene expression analysis [39]. Some of the MF-based techniques that have been used widely are Singular Value Decomposition (SVD) [40], Principle Component Analysis (PCA) [41], and Probabilistic Matrix Factorization (PMF) [42].…”
Section: Matrix Factorizationmentioning
confidence: 99%
“…in which n and d denote the number of samples and that of features, respectively. The To decompose a given (non-negative) matrix into the product of two low-rank (non-negative) matrices [24,27,36,37,38,39,40,41,42,43,44,45,46,47,48] Subspace Learning…”
Section: Notationsmentioning
confidence: 99%
“…Social relationship and reviews information are used as auxiliary information to improve recommendation performance. Zafran Khan et al [25] propose a context-based recommendation model to improve item feature extraction, which extracts context features through convolutional neural network (CNN), it not only resolve the sparsity problem, but also addresses the information loss due to the negative values in latent factors. Although both of them introduce auxiliary information to improve recommendation performance, they ignore the interaction between different features.…”
Section: Related Workmentioning
confidence: 99%
“…, ). By combining the objective function of three models (5), (13) and (15), the final model of the MCoC-based collaborative recommendation system is obtained which is as follows:…”
Section: Grouping Two Items Togethermentioning
confidence: 99%
“…Multi-class Co-Clustering (MCoC) is a co-clustering method which allows each user or item becomes the members of several groups [14]. To estimate unrated items of each group in MCoC, for each group, an independent collaborative filtering approach such as slope-one approach or matrix factorization approach [15] is implemented [16]. Coclustering can also alleviate cold start problem of recommendation systems [13].…”
Section: Introductionmentioning
confidence: 99%