The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Fast Matrix Factorization for Online Recommendation with Implicit Feedback
Open accessAbstract
This paper contributes improvements on both the effectiveness and efficiency of Matrix Factorization (MF) methods for implicit feedback. We highlight two critical issues of existing works. First, due to the large space of unobserved feedback, most existing works resort to assign a uniform weight to the missing data to reduce computational complexity. However, such a uniform assumption is invalid in real-world settings. Second, most methods are also designed in an offline setting and fail to keep up with the dynamic nature of online data. We address the above two issues in learning MF models from implicit feedback. We first propose to weight the missing data based on item popularity, which is more effective and flexible than the uniform-weight assumption. However, such a non-uniform weighting poses efficiency challenge in learning the model. To address this, we specifically design a new learning algorithm based on the element-wise Alternating Least Squares (eALS) technique, for efficiently optimizing a MF model with variably-weighted missing data. We exploit this efficiency to then seamlessly devise an incremental update strategy that instantly refreshes a MF model given new feedback. Through comprehensive experiments on two public datasets in both offline and online protocols, we show that our implemented, open-source (https://github.com/hexiangnan/sigir16-eals) eALS consistently outperforms state-of-the-art implicit MF methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
(2010) · Cited by 8,261
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
Collaborative Filtering for Implicit Feedback Datasets
Hu, Y., Koren, Y., & Volinsky, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.22 · Cited by 3,170
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Neural Word Embedding as Implicit Matrix Factorization
Levy, O., & Goldberg, Y. (2014) · neural information processing systems · Cited by 1,582
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., & Turrin, R. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864721 · Cited by 1,410
Collaborative filtering with temporal dynamics
Koren, Y. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557072 · Cited by 1,203
One-Class Collaborative Filtering
Pan, R., Zhou, Y., Cao, B., Liu, N. N., Lukose, R., Scholz, M., & Yang, Q. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.16 · Cited by 1,015
Advances in Collaborative Filtering
Koren, Y., & Bell, R. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_5 · Cited by 745
Richtárik, P., & Takáč, M. (2014) · Mathematical Programming · doi:10.1007/s10107-012-0614-z · Cited by 654
Large-scale matrix factorization with distributed stochastic gradient descent
Gemulla, R., Nijkamp, E., Haas, P. J., & Sismanis, Y. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020426 · Cited by 589
Fast context-aware recommendations with factorization machines
Rendle, S., Gantner, Z., Freudenthaler, C., & Schmidt-Thieme, L. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2010002 · Cited by 574
TriRank: Review-aware Explainable Recommendation by Modeling Aspects
He, X., Chen, T., Kan, M.-Y., & Chen, X. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806504 · Cited by 456
Self-citationTraining and testing of recommender systems on data missing not at random
Steck, H. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835895 · Cited by 365
Improving pairwise learning for item recommendation from implicit feedback
Rendle, S., & Freudenthaler, C. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556248 · Cited by 360
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2021068 · Cited by 346
Discrete Collaborative Filtering
Zhang, H., Shen, F., Liu, W., He, X., Luan, H., & Chua, T.-S. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911502 · Cited by 289
Self-citationOnline-updating regularized kernel matrix factorization models for large-scale recommender systems
Rendle, S., & Schmidt-Thieme, L. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454047 · Cited by 233
Learning Image and User Features for Recommendation in Social Networks
Geng, X., Zhang, H., Bian, J., & Chua, T.-S. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.486 · Cited by 218
Self-citationMachine Learning: The High Interest Credit Card of Technical Debt
Sculley, D., Holt, G. D., Golovin, D., Davydov, E. V., Phillips, T., Ebner, D., Chaudhary, V., & Young, M. (2014) · Cited by 218
Collaborative Filtering and the Missing at Random Assumption
Marlin, B. M., Zemel, R. S., Roweis, S. T., & Slaney, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5267 · Cited by 178
Fast als-based matrix factorization for explicit and implicit feedback datasets
Pilászy, I., Zibriczky, D., & Tikk, D. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864726 · Cited by 166
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
Pan, R., & Scholz, M. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557094 · Cited by 162
Dynamic Matrix Factorization with Priors on Unknown Values
Devooght, R., Kourtellis, N., & Mantrach, A. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783346 · Cited by 113
Predicting the popularity of web 2.0 items based on user comments
He, X., Gao, M. Z., Kan, M., Liu, Y., & Sugiyama, K. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609558 · Cited by 109
Self-citationComment-based multi-view clustering of web 2.0 items
He, X., Kan, M., Xie, P., & Chen, X. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2566486.2567975 · Cited by 100
Self-citationTencentRec: Real-time Stream Recommendation in Practice
Huang, Y., Cui, B., Zhang, W., Jiang, J., & Xu, Y. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2742785 · Cited by 93
Effective Latent Models for Binary Feedback in Recommender Systems
Volkovs, M., & Yu, G. W. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767716 · Cited by 60
Online learning for collaborative filtering
Ling, G., Yang, H., King, I., & Lyu, M. R.-T. (2012) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2012.6252670 · Cited by 49
Cited by
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Self-citationNeural Attentive Session-based Recommendation
Li, J., Ren, P., Chen, Z., Ren, Z., Lian, T., & Ma, J. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132926 · Cited by 1,501
Neural Factorization Machines for Sparse Predictive Analytics
He, X., & Chua, T.-S. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080777 · Cited by 1,340
Self-citationSTAMP: Short-Term Attention/Memory Priority Model for Session-based Recommendation
Liu, Q., Zeng, Y., Mokhosi, R., & Zhang, H. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219950 · Cited by 960
Self-citationDeep Matrix Factorization Models for Recommender Systems
Xue, H.-J., Dai, X., Zhang, J., Huang, S., & Chen, J. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/447 · Cited by 926
Metadata
- Authors
- He, X., Zhang, H., Kan, M.-Y., & Chua, T.-S.
- Venue
- Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2016-07-07
- Pages
- 549-558
- OpenAlex
- W2340502990
- Cited by
- 988
- References
- 32
- FWCI
- 94.59
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.