The DOI matches its Crossref record; 37 of the 37 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 encode users' ratings of movies, movies' genres, and actors' roles in movies. A common prediction technique given one pairwise relation, for example a #users x #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.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
(2005) · Statistics for Biology and Health · doi:10.1007/0-387-27255-0_9 · Cited by 20,133
McCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,878
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
The Entity Relationship Model — Toward a Unified View of Data
Chen, P. P.-S. (2002) · Software Pioneers · doi:10.1007/978-3-642-59412-0_18 · Cited by 5,751
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
The entity-relationship model—toward a unified view of data
Chen, P. P.-S. (1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320440 · Cited by 4,708
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Matrix Differential Calculus with Applications in Statistics and Econometrics.
Magnus, J. R., & Neudecker, H. (1988) · Biometrics · doi:10.2307/2531754 · Cited by 2,699
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Adaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Clustering with Bregman Divergences
Banerjee, A., Merugu, S., Dhillon, I., & Ghosh, J. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.22 · Cited by 1,472
Exchangeability and related topics
Aldous, D. J. (1985) · Lecture Notes in Mathematics · doi:10.1007/bfb0099421 · Cited by 1,345
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
Matrix Computations, 3rd Edition
Golub, G. H. (2007) · Cited by 787
Weighted low-rank approximations
Srebro, N., & Jaakkola, T. (2003) · International Conference on Machine Learning · Cited by 715
Representations for partially exchangeable arrays of random variables
Aldous, D. J. (1981) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(81)90099-3 · Cited by 442
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
Cohn, D. A., & Hofmann, T. (2000) · Cited by 436
A Generalization of Principal Components Analysis to the Exponential Family
Collins, M., Dasgupta, S., & Schapire, R. E. (2001) · neural information processing systems · Cited by 423
Bottou, L., & Cun, Y. L. (2003) · Cited by 359
Overview of the Second Text Retrieval Conference (TREC-2)
Harman, D. (1995) · Information Processing & Management · doi:10.1016/0306-4573(94)00047-7 · Cited by 306
Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions
Azoury, K. S., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1010896012157 · Cited by 298
Combining content and link for classification using matrix factorization
Zhu, S., Yu, K., Chi, Y., & Gong, Y. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277825 · Cited by 262
Spectral clustering for multi-type relational data
Long, B., Zhang, Z. (., Wú, X., & Yu, P. S. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143918 · Cited by 251
Multi-label informed latent semantic indexing
Yu, K., Yu, S., & Tresp, V. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076080 · Cited by 235
Block-relaxation Algorithms in Statistics
de Leeuw, J. (1994) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/978-3-642-46808-7_28 · Cited by 216
Supervised probabilistic principal component analysis
Yu, S., Yu, K., Volker Tresp, C., Kriegel, H., & Wu, M. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150454 · Cited by 181
A Generalization of Principal Component Analysis to the Exponential Family
Collins, M., Dasgupta, S., & Schapire, R. E. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.003.0084 · Cited by 162
Multi-way Clustering on Relation Graphs
Banerjee, A., Basu, S., & Merugu, S. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.14 · Cited by 128
A probabilistic framework for relational clustering
Long, B., Zhang, Z. M., & Yu, P. S. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281244 · Cited by 121
Predictive discrete latent factor models for large scale dyadic data
Agarwal, D., & Merugu, S. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281199 · Cited by 65
The support vector decomposition machine
Pereira, F., & Gordon, G. J. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143931 · Cited by 46
Self-citation
Cited by
A Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
“The proposed approach is based on the collective matrix factorization technique [177], where a factor matrix is shared across domains.”
Method(2013) · Cited by 5,726
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
Collaborative Deep Learning for Recommender Systems
Wang, H., Wang, N., & Yeung, D.-Y. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783273 · Cited by 1,657
Multimodal Data Fusion: An Overview of Methods, Challenges, and Prospects
Lahat, D., Adali, T., & Jutten, C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2460697 · Cited by 1,296
“combinations of the basic building blocks, thus leading to new mathematical models, algorithms and concepts [8], [16], [163], [164].”
BackgroundInfluential
Metadata
- Authors
- Singh, A. P., & Gordon, G. J.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 650-658
- OpenAlex
- W2117420919
- Cited by
- 1,204
- References
- 37
- FWCI
- 18.10
- 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
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.