A whitening approach to probabilistic canonical correlation analysis for omics data integration


Canonical correlation analysis (CCA) is a classic and highly versatile statistical approach to investigate the linear relationship between two sets of variables [1, 2]. CCA helps to decode complex dependency structures in multivariate data and to identify groups of interacting variables. Consequently, it has numerous practical applications in molecular biology, for example omics data integration [3] and network analysis [4], but also in many other areas such as econometrics or social science.

In its original formulation CCA is viewed as an algorithmic procedure optimizing a set of objective functions, rather than as a probablistic model for the data. Only relatively recently this perspective has changed. Bach and Jordan [5] proposed a latent variable model for CCA building on earlier work on probabilistic principal component analysis (PCA) by [6]. The probabilistic approach to CCA not only allows to derive the classic CCA algorithm but also provide an avenue for Bayesian variants [7, 8].

In parallel to establishing probabilistic CCA the classic CCA approach has also been further developed in the last decade by introducing variants of the CCA algorithm that are more pertinent for high-dimensional data sets now routinely collected in the life and physical sciences. In particular, the problem of singularity in the original CCA algorithm is resolved by introducing sparsity and regularization [913] and, similarly, large-scale computation is addressed by new algorithms [14, 15].

In this note, we revisit both classic and probabilistic CCA from the perspective of whitening of random variables [16]. As a result, we propose a simple yet flexible probabilistic model for CCA linking together multivariate regression, latent variable models, and high-dimensional estimation. Crucially, this model for CCA not only facilitates comprehensive understanding of both classic and probabilistic CCA via the process of whitening but also extends CCA by allowing for negative canonical correlations and providing the flexibility to include non-normal latent variables.

The remainder of this paper is as follows. First, we present our main results. After reviewing classical CCA we demonstrate that the classic CCA algorithm is special form of whitening. Next, we show that the link of CCA with multivariate regression leads to a probabilistic two-level latent variable model for CCA that directly reproduces classic CCA without any rotational ambiguity. Subsequently, we discuss our approach by applying it to both synthetic data as well as to multiple integrated omics data sets. Finally, we describe our implementation in R and highlight computational and algorithmic aspects.

Much of our discussion is framed in terms of random vectors and their properties rather than in terms of data matrices. This allows us to study the probabilistic model underlying CCA separate from associated statistical procedures for estimation.

Multivariate notation

We consider two random vectors X=(X1,…,Xp)T and Y=(Y1,…,Yq)T of dimension p and q. Their respective multivariate distributions FX and FY have expectation E(X)=μX and E(Y)=μY and covariance var(X)=ΣX and var(Y)=ΣY. The cross-covariance between X and Y is given by cov(X,Y)=ΣXY. The corresponding correlation matrices are denoted by PX, PY, and PXY. By VX=diag(ΣX) and VY=diag(ΣY) we refer to the diagonal matrices containing the variances only, allowing to decompose covariances as Σ=V1/2PV1/2. The composite vector (XT,YT)T has therefore mean (left (boldsymbol {mu }_{boldsymbol {X}}^{T}, boldsymbol {mu }_{boldsymbol {Y}}^{T}right)^{T}) and covariance (left (begin {array}{cc} boldsymbol {Sigma }_{boldsymbol {X}} & boldsymbol {Sigma }_{boldsymbol {X} boldsymbol {Y}}\ boldsymbol {Sigma }_{boldsymbol {X} boldsymbol {Y}}^{T} & boldsymbol {Sigma }_{boldsymbol {Y}} end {array}right)).

Vector-valued samples of the random vectors X and Y are denoted by xi and yi so that (x1,…,xi,…,xn)T is the n×p data matrix for X containing n observed samples (one in each row). Correspondingly, the empirical mean for X is given by (hat {boldsymbol {mu }}_{boldsymbol {X}} = bar {boldsymbol {x}} =frac {1}{n} {sum nolimits }_{i=1}^{n} boldsymbol {x}_{i}), the unbiased covariance estimate is (widehat {boldsymbol {Sigma }}_{boldsymbol {X}} = boldsymbol {S}_{boldsymbol {X}} = frac {1}{n-1} {sum nolimits }^{n}_{i=1} (boldsymbol {x}_{i} -bar {boldsymbol {x}})left (boldsymbol {x}_{i} -bar {boldsymbol {x}}right)^{T}), and the corresponding correlation estimate is denoted by (widehat {boldsymbol {P}}_{boldsymbol {X}} = boldsymbol {R}_{boldsymbol {X}}).

Articles You May Like

Barcode identification for single cell genomics
AI wins Protein folding competition. Find out how! Deepmind, creators of alphaGo beat out all competitors by a wide margin and have zero background in biology, pharmaceuticals, etc. this guy, Siraj, explains and attempts to recreate the code for AlphaFold, their submission.
Kinetic analysis of multistep USP7 mechanism shows critical role for target protein in activity
Oceans had their hottest year on record in 2018 as global warming accelerates
How To See Tonight’s ‘Perfect’ Super Blood Wolf Moon Total Lunar Eclipse, Tomorrow’s Kissing Planets

Leave a Reply

Your email address will not be published. Required fields are marked *