2022
DOI: 10.1007/s10115-021-01629-6
|View full text |Cite
|
Sign up to set email alerts
|

A review on matrix completion for recommender systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 85 publications
0
11
0
Order By: Relevance
“…Collaborative filtering is mainly studied in recommender systems and refers to the ability to exploit the relationships between users to recommend items to the active user according to the ratings of his/her neighbors (cf. [17]). In this paper, we consider the more general sense of collaborative filtering defined as the process of searching for information using strategies that involve several agents.…”
Section: Algorithmic Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Collaborative filtering is mainly studied in recommender systems and refers to the ability to exploit the relationships between users to recommend items to the active user according to the ratings of his/her neighbors (cf. [17]). In this paper, we consider the more general sense of collaborative filtering defined as the process of searching for information using strategies that involve several agents.…”
Section: Algorithmic Methodsmentioning
confidence: 99%
“…For any k, l ∈ [K] and i, j ∈ [n] with i < j, χ(i,j) k,l is the estimate of χ (i,j) k,l computed using Eq. (17).…”
Section: Appendix D Spectral Gaps and Mixing Times For Markov Chainsmentioning
confidence: 99%
“…Matrix completion comprises filling the missing entries of a partially observed matrix. While its staple application is in recommender systems [285] it is also used in bioinformatics [286], signal processing [287], and chemistry [288], to name a few. Graphs have been used to capture the structural side information among the rows and columns of this matrix and the entries are treated as signals over these graphs.…”
Section: Matrix Completion and Collaborative Filteringmentioning
confidence: 99%
“…Marques, B. and others said that in the research of transfer path search algorithm, the k-short circuit algorithm is mainly studied [4]. Chen, Z. believes that in physical networks, the shortest path algorithm is the research hotspot of operations research, automation, computer science and other disciplines, and the core content of resource allocation and traffic network analysis [5]. However, Coles, N. A. said that in the practical application of railway passenger transfer path search, sometimes the shortest path is not the optimal choice of passengers due to its transfer times or arrival time.…”
Section: Literature Reviewmentioning
confidence: 99%