Name
Abstract | ||
|---|---|---|
BSTRACT Matrix factorization learned by implicit alternating least squares (iALS) is a popular baseline in recommender system research publications. iALS is known to be one of the most computationally efficient and scalable collaborative filtering methods. However, recent studies suggest that its prediction quality is not competitive with the current state of the art, in particular autoencoders and other item-based collaborative filtering methods. In this work, we revisit four well-studied benchmarks where iALS was reported to perform poorly and show that with proper tuning, iALS is highly competitive and outperforms any method on at least half of the comparisons. We hope that these high quality results together with iALS’s known scalability spark new interest in applying and further improving this decade old technique. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1145/3523227.3548486 | ACM Conference On Recommender Systems |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steffen Rendle | 1 | 1963 | 70.68 |
| Walid Krichene | 2 | 108 | 14.02 |
| Li Zhang | 3 | 0 | 0.34 |
| Yehuda Koren | 4 | 9090 | 484.08 |