The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence
Abstract
Matrix factorization (MF) models and their extensions are standard in modern recommender systems. MF models decompose the observed user-item interaction matrix into user and item latent factors. In this paper, we propose a co-factorization model, CoFactor, which jointly decomposes the user-item interaction matrix and the item-item co-occurrence matrix with shared item latent factors. For each pair of items, the co-occurrence matrix encodes the number of users that have consumed both items. CoFactor is inspired by the recent success of word embedding models (e.g., word2vec) which can be interpreted as factorizing the word co-occurrence matrix. We show that this model significantly improves the performance over MF models on several datasets with little additional computational overhead. We provide qualitative results that explain how CoFactor improves the quality of the inferred factors and characterize the circumstances where it provides the most significant improvements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135
Restricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
Bertin-Mahieux, T., Ellis, D. P. W., Whitman, B., & Lamere, P. (2011) · Columbia University · doi:10.7916/d8nz8j07 · Cited by 944
Cited by
Variational Autoencoders for Collaborative Filtering
Liang, D., Krishnan, R. G., Hoffman, M. D., & Jebara, T. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186150 · Cited by 1,338
Self-citationHeterogeneous Information Network Embedding for Recommendation
Shi, C., Hu, B., Zhao, W. X., & Yu, P. S. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2833443 · Cited by 1,204
A Survey on Session-based Recommender Systems
Wang, S., Cao, L., Wang, Y., Sheng, Q. Z., Orgun, M. A., & Lian, D. (2022) · ACM Computing Surveys · doi:10.1145/3465401 · Cited by 570
Sequential Recommender System based on Hierarchical Attention Networks
Ying, H., Zhuang, F., Zhang, F., Liu, Y., Xu, G., Xie, X., Xiong, H., & Wu, J. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/546 · Cited by 367
Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback
Saito, Y., Yaginuma, S., Nishino, Y., Sakata, H., & Nakata, K. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371783 · Cited by 295
Metadata
- Authors
- Liang, D., Altosaar, J., Charlin, L., & Blei, D. M.
- Venue
- Proceedings of the 10th ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2016-09-07
- Pages
- 59-66
- OpenAlex
- W2508504774
- Cited by
- 241
- References
- 4
- FWCI
- 27.35
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence. https://app.cochat.ai/papers/10.1145/2959100.2959182
- The paper
- Liang, D., Altosaar, J., Charlin, L., & Blei, D. M. (2016). Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence. Proceedings of the 10th ACM Conference on Recommender Systems. https://doi.org/10.1145/2959100.2959182
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.