The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Relational Learning via Collective Matrix Factorization
Abstract
Relational learning is concerned with predicting unknown values of a relation, given a database of entities and observed relations among entities.An example of relational learning is movie rating prediction, where entities could include users, movies, genres, and actors.Relations would then encode users' ratings of movies, movies' genres, and actors' roles in movies.A common prediction technique given one pairwise relation, for example a #users × #movies ratings matrix, is low-rank matrix factorization.In domains with multiple relations, represented as multiple matrices, we may improve predictive accuracy by exploiting information from one relation while predicting another.To this end, we propose a collective matrix factorization model: we simultaneously factor several matrices, sharing parameters among factors when an entity participates in multiple relations.Each relation can have a different value type and error distribution; so, we allow nonlinear relationships between the parameters and outputs, using Bregman divergences to measure error.We extend standard alternating projection algorithms to our model, and derive an efficient Newton update for the projection.Furthermore, we propose stochastic optimization methods to deal with large, sparse matrices.Our model generalizes several existing matrix factorization methods, and therefore yields new large-scale optimization algorithms for these problems.Our model can handle any pairwise relational schema and a wide variety of error models.We demonstrate its efficiency, as well as the benefit of sharing parameters among relations.
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
McCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
Cited by
Embedding Entities and Relations for Learning and Inference in Knowledge Bases
Yang, B., Yih, W.-T., He, X., Gao, J., & Deng, L. (2014) · arXiv · doi:10.48550/arxiv.1412.6575 · Cited by 2,252
Learning Structured Embeddings of Knowledge Bases
Bordes, A., Weston, J., Collobert, R., & Bengio, Y. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7917 · Cited by 829
Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation
Ai, Q., Azizi, V., Chen, X., & Zhang, Y. (2018) · Algorithms · doi:10.3390/a11090137 · Cited by 468
A Hybrid Collaborative Filtering Model with Deep Structure for Recommender Systems
Dong, X., Yu, L., Wu, Z., Sun, Y., Yuan, L., & Zhang, F. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10747 · Cited by 282
Leveraging Uncertainty in Machine Learning Accelerates Biological Discovery and Design
Hie, B., Bryson, B. D., & Berger, B. (2020) · Cell Systems · doi:10.1016/j.cels.2020.09.007 · Cited by 154
Metadata
- Authors
- Singh, A. P., & Gordon, G. J.
- Publisher
- Defense Technical Information Center
- Published
- 2008-06-01
- OpenAlex
- W4231990774
- Cited by
- 240
- References
- 1
- Type
- report
- 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: Relational Learning via Collective Matrix Factorization. https://app.cochat.ai/papers/10.21236/ada486804
- The paper
- Singh, A. P., & Gordon, G. J. (2008). Relational Learning via Collective Matrix Factorization. https://doi.org/10.21236/ada486804
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.