Linked Matrix Factorization
Michael J. O'Connell, Eric F. Lock

TL;DR
Linked Matrix Factorization (LMF) is a novel method for jointly decomposing multiple linked data matrices with shared rows and columns, enabling integrated analysis, visualization, and missing data imputation in complex multi-source datasets.
Contribution
This paper introduces LMF, a unified low-rank factorization approach for simultaneous horizontal and vertical data integration, addressing more general sharing structures among matrices.
Findings
LMF effectively decomposes shared and specific variation across matrices.
Theoretical results establish LMF's uniqueness and identifiability.
Simulation studies demonstrate LMF's accuracy and robustness.
Abstract
In recent years, a number of methods have been developed for the dimension reduction and decomposition of multiple linked high-content data matrices. Typically these methods assume that just one dimension, rows or columns, is shared among the data sources. This shared dimension may represent common features that are measured for different sample sets (i.e., horizontal integration) or a common set of samples with measurements for different feature sets (i.e., vertical integration). In this article we introduce an approach for simultaneous horizontal and vertical integration, termed Linked Matrix Factorization (LMF), for the more general situation where some matrices share rows (e.g., features) and some share columns (e.g., samples). Our motivating application is a cytotoxicity study with accompanying genomic and molecular chemical attribute data. In this data set, the toxicity matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
