Cited by 67Bioinformatics and Genomic NetworksStatistical Methods and InferenceGene expression and cancer classification

Integrating multi-omics data through sparse canonical correlation analysis for the prediction of complex traits: a comparison study

Open access
Rodosthenous, Theodoulos, Shahrezaei, Vahid, Evangelou, Marina·2020·Bioinformatics

Abstract

Motivation: Recent developments in technology have enabled researchers to collect multiple OMICS datasets for the same individuals. The conventional approach for understanding the relationships between the collected datasets and the complex trait of interest would be through the analysis of each OMIC dataset separately from the rest, or to test for associations between the OMICS datasets. In this work we show that integrating multiple OMICS datasets together, instead of analysing them separately, improves our understanding of their in-between relationships as well as the predictive accuracy for the tested trait. Several approaches have been proposed for the integration of heterogeneous and high-dimensional (p≫n) data, such as OMICS. The sparse variant of canonical correlation analysis (CCA) approach is a promising one that seeks to penalize the canonical variables for producing sparse latent variables while achieving maximal correlation between the datasets. Over the last years, a number of approaches for implementing sparse CCA (sCCA) have been proposed, where they differ on their objective functions, iterative algorithm for obtaining the sparse latent variables and make different assumptions about the original datasets. Results: Through a comparative study we have explored the performance of the conventional CCA proposed by Parkhomenko et al., penalized matrix decomposition CCA proposed by Witten and Tibshirani and its extension proposed by Suo et al. The aforementioned methods were modified to allow for different penalty functions. Although sCCA is an unsupervised learning approach for understanding of the in-between relationships, we have twisted the problem as a supervised learning one and investigated how the computed latent variables can be used for predicting complex traits. The approaches were extended to allow for multiple (more than two) datasets where the trait was included as one of the input datasets. Both ways have shown improvement over conventional predictive models that include one or multiple datasets. Availability and implementation: https://github.com/theorod93/sCCA. Supplementary information: Supplementary data are available at Bioinformatics online.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btaa530

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Shallow learning methods including jNMF, PLS, CCA, and MKL have been developed for multimodal representation learning.

    “In the early stages of multimodal representation learning, numerous shallow learning methods were developed and utilized. Notable approaches include joint non-negative matrix factorization (jNMF) methods [42], partial least square (PLS) [43], canonical correlation analysis (CCA) [44], and multiple kernel learning (MKL) [45].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Rodosthenous, T., Shahrezaei, V., & Evangelou, M.
Affiliations
Imperial College London (GB)
Corresponding author
  • Rodosthenous, Theodoulos
  • Evangelou, Marina
Venue
Bioinformatics
Published
2020-05-21
Volume
36
Issue
17
Pages
4616-4625
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W3027052013
Cited by
67
References
43
Citations by year
2026: 10 · 2025: 15 · 2024: 14 · 2023: 13 · 2022: 10 · 2021: 4 · 2020: 1
FWCI
2.27
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
  • Spiral (Imperial College London) (submittedVersion, cc-by-nc)
Funders
Engineering and Physical Sciences Research Council (EP/K503381/1)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene expression and cancer classification
Keywords
sparse canonical correlation analysis, multi-omics integration, high-dimensional data, penalty method
MeSH terms
Algorithms, Humans, Phenotype, Multivariate Analysis, Multifactorial Inheritance

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