- Methodology article
- Open Access
- Published:

# Structure-revealing data fusion

*BMC Bioinformatics***volume 15**, Article number: 239 (2014)

## Abstract

### Background

Analysis of data from multiple sources has the potential to enhance knowledge discovery by capturing underlying structures, which are, otherwise, difficult to extract. Fusing data from multiple sources has already proved useful in many applications in social network analysis, signal processing and bioinformatics. However, data fusion is challenging since data from multiple sources are often (i) heterogeneous (i.e., in the form of higher-order tensors and matrices), (ii) incomplete, and (iii) have both shared and unshared components. In order to address these challenges, in this paper, we introduce a novel unsupervised data fusion model based on joint factorization of matrices and higher-order tensors.

### Results

While the traditional formulation of coupled matrix and tensor factorizations modeling only shared factors fails to capture the underlying structures in the presence of both shared and unshared factors, the proposed data fusion model has the potential to automatically reveal shared and unshared components through modeling constraints. Using numerical experiments, we demonstrate the effectiveness of the proposed approach in terms of identifying shared and unshared components. Furthermore, we measure a set of mixtures with known chemical composition using both LC-MS (Liquid Chromatography - Mass Spectrometry) and NMR (Nuclear Magnetic Resonance) and demonstrate that the structure-revealing data fusion model can (i) successfully capture the chemicals in the mixtures and extract the relative concentrations of the chemicals accurately, (ii) provide promising results in terms of identifying shared and unshared chemicals, and (iii) reveal the relevant patterns in LC-MS by coupling with the diffusion NMR data.

### Conclusions

We have proposed a structure-revealing data fusion model that can jointly analyze heterogeneous, incomplete data sets with shared and unshared components and demonstrated its promising performance as well as potential limitations on both simulated and real data.

## Background

Data fusion, in other words, joint analysis of data from multiple sources, has proved useful in many disciplines. For instance, in bioinformatics, jointly analyzing multiple data sets representing different organisms [1, 2] or different tissue types [3, 4] improves the understanding of the underlying biological processes. Similarly, in metabolomics, biological fluids such as blood or urine, are investigated using different analytical techniques, e.g., LC-MS and NMR, and their fusion has the potential for more accurate biomarker identification [5–7].

An effective way of jointly analyzing data from multiple sources is to represent data from different sources as a collection of matrices, and then jointly analyze these matrices using collective matrix factorization [8]. Matrix factorization-based data fusion studies have been successfully applied in social network analysis [9, 10], signal processing [11, 12] and bioinformatics [1, 2, 4, 5, 13]. Recently, joint matrix factorization approaches have been extended to joint analysis of heterogeneous data sets, i.e., data in the form of matrices and higher-order tensors [14–17]. For instance, mixtures studied by NMR spectroscopy (a.k.a. DOSY - diffusion-ordered spectroscopy [18, 19]) can be represented as a third-order tensor with modes: mixtures, chemical shift and gradient levels [20, 21] while LC-MS measurements of the same mixtures can be represented using a mixtures by features matrix (see Figure 1). Joint factorization of such heterogeneous data has been studied to analyze multi-relational data, particularly, in social networks [15, 22–24].

While there are many successful applications of joint data analysis, the traditional formulation of joint factorization of multiple data sets is based on modeling only shared factors. However, data from multiple sources often have both shared and unshared components. If the goal of data fusion is accurate data reconstruction, e.g., missing data estimation or link prediction, then identification of shared/unshared factors is not a major concern. On the other hand, in many applications, the goal of data fusion is to extract and interpret the underlying factors. For instance, in metabolomics applications, underlying factors need to be captured uniquely so that they can be used further to understand the patterns corresponding to a problem of interest, e.g., a specific type of diet or a disease. Therefore, in this paper, we develop a novel unsupervised data fusion model for joint factorization of heterogeneous data sets, which is quite effective in terms of revealing shared and unshared components. Using numerical experiments, we demonstrate that while the traditional formulation, modeling only shared factors, fails to capture the underlying structures in the presence of both shared and unshared components, the proposed model achieves accurate identification of shared and unshared components. Furthermore, we study a set of mixtures of known chemical composition by two analytical techniques, i.e., LC-MS and diffusion NMR. While NMR can capture all chemicals, one of the chemicals is invisible to LC-MS. We demonstrate the effectiveness of our model on this prototypical example using real data, where coupled data sets have both shared and unshared components. This is an extended version of our work [25] where, we have introduced our model briefly and discussed preliminary findings in cancer metabolomics. Here, we study the performance of the model in depth using both simulated and real data sets, where the underlying ground truth is known. Several other studies have also previously discussed methods revealing shared and unshared components. However, these studies either focus on coupled matrix factorizations [1, 2, 13, 26–29] or assume that the number of shared/unshared factors is pre-determined by the user based on the performance of joint factorization in the training set (when considered in a supervised setting) [30]. Modeling shared and unshared components has also been considered within the context of Canonical Correlation Analysis [31–34] focusing only on joint analysis of matrices.

We survey the related work further in Section “Related work”. In Section “Methods”, we introduce our data fusion model and the algorithmic approach. Section “Results and discussion” demonstrates the performance of the proposed approach on simulated and real data sets. Section “Conclusions” concludes with future research directions.

## Related work

Data fusion has been studied for decades dating back to the models aiming to capture the common variation in two data sets, i.e., Canonical Correlation Analysis [35]. Earlier studies on data fusion have focused on joint factorization of multiple matrices [1, 4, 8–12, 36–38]. The coupled matrix factorization problem is typically formulated as

where $\mathbf{X}\in {\mathbb{R}}^{I\times J}$ and $\mathbf{Y}\in {\mathbb{R}}^{I\times K}$ are matrices coupled in the first mode/dimension and the factor matrix corresponding to the common mode, $\mathbf{U}\in {\mathbb{R}}^{I\times R}$, is shared by both factorizations. Here, *R* indicates the number of factors. This formulation extends to factorization of multiple matrices coupled in different modes. In some applications such as in metabolomics, sparsity-inducing penalty terms are added to coupled matrix factorizations in order to extract interpretable factors [5, 39]. Recently, a convex formulation of coupled matrix factorizations has also been proposed [40]. Tensor factorizations [41–43] can also be considered as one way of jointly analyzing multiple matrices forming the slices of a third-order tensor; however, neither coupled matrix factorization nor tensor factorization methods can handle joint analysis of heterogeneous data sets.

As an extension of Eq. (1), joint factorization of heterogeneous data, e.g., a third-order tensor $\mathit{X}\in {\mathbb{R}}^{I\times J\times K}$, coupled with a matrix $\mathbf{Y}\in {\mathbb{R}}^{I\times M}$, can be formulated as

where tensor $\mathit{X}$ and matrix **Y** are simultaneously factorized through the minimization of the objective function in Eq. (2), which fits a CANDECOMP/PARAFAC (CP) [44, 45] model to $\mathit{X}$ and factorizes **Y** in such a way that the factor matrix corresponding the common mode, i.e., $\mathbf{A}\in {\mathbb{R}}^{I\times R}$ is the same. $\mathbf{B}\in {\mathbb{R}}^{J\times R}$ and $\mathbf{C}\in {\mathbb{R}}^{K\times R}$ are factor matrices corresponding to the second and third modes of $\mathit{X}$, respectively. We use the notation $\mathit{X}=\left[\phantom{\rule{0.6em}{0ex}}\right[\phantom{\rule{0.3em}{0ex}}\mathbf{A},\mathbf{B},\mathbf{C}\left]\phantom{\rule{0.6em}{0ex}}\right]$ to denote the CP model. $\mathbf{V}\in {\mathbb{R}}^{M\times R}$ is the factor matrix that corresponds to the second mode of **Y**. This formulation of coupled matrix and tensor factorizations (CMTF), dating back to the studies of Harshman and Lundy [46] and Smilde et al. [16], has recently been a topic of interest in many studies [3, 14, 47–50]. The model has been extended to different loss functions [17, 22, 23], and tensor factorizations other than CP [17, 22, 50, 51]. It has also shown to be quite effective in addressing missing data estimation [24, 51, 52] and link prediction problems [22].

## Methods

### Model: structure-revealing coupled matrix and tensor factorizations

The coupled matrix and tensor factorization model given in Eq. (2) makes an implicit assumption that all columns of factor matrix **A**, i.e., **a**_{
r
} for *r* = 1,…,*R*, are shared by the matrix and the third-order tensor, where *R* indicates the number of factors. When all factors are shared across data sets, the model can accurately capture the underlying factors [14]. However, in general, there are both shared and unshared factors in coupled data sets. Therefore, we reformulate the problem in such a way that through modeling constraints, we let the model identify shared/unshared components. We modify the objective function in Eq. (2) and rewrite the optimization problem as follows:

where $\mathbf{\lambda}\in {\mathbb{R}}^{R\times 1}$ and $\mathbf{\sigma}\in {\mathbb{R}}^{R\times 1}$ correspond to the weights of rank-one components in the third-order tensor and the matrix, respectively (Figure 2). $\mathbf{\Sigma}\in {\mathbb{R}}^{R\times R}$ is a diagonal matrix with entries of *σ* on the diagonal. ‖. ‖ denotes the Frobenius norm for higher-order tensors/matrices and the 2-norm for vectors while ‖. ‖_{1} denotes the 1-norm of a vector, i.e., ${\Vert \phantom{\rule{0.3em}{0ex}}\mathbf{x}\phantom{\rule{0.3em}{0ex}}\Vert}_{1}=\sum _{r=1}^{R}\left|{x}_{r}\right|$. *β* ≥ 0 is a penalty parameter. **a**_{
r
} denotes the *r*th column of **A**. In this formulation, our goal is to sparsify the weights *λ* and *σ* using the 1-norm penalties so that unshared components will have weights equal or close to 0 in one of the data sets.

In order to solve this constrained optimization problem, we first convert it into a differentiable unconstrained optimization problem and then use a first-order optimization algorithm. Using the quadratic penalty method [53], we convert the constraints into penalty terms. In order to make the objective function differentiable, we also replace the 1-norm terms with differentiable approximations, e.g., for sufficiently small *ε* > 0, $\sqrt{{x}_{i}^{2}+\epsilon}=\left|{x}_{i}\right|$[54]. Our objective function can be formulated as follows, for *α*≥0:

#### Missing data

The model in Eq. (4) extends to joint analysis of incomplete data sets, i.e., data sets with missing entries. Missing data is encountered in many applications due to errors in the data collection process or costly experiments. In the presence of missing entries, we can still jointly analyze incomplete data sets by ignoring missing entries and modeling only the known data entries as follows:

where ∗ denotes the Hadamard product and ${\mathit{W}}_{\mathit{X}}\in {\mathbb{R}}^{I\times J\times K}$ indicates the missing entries of $\mathit{X}\in {\mathbb{R}}^{I\times J\times K}$ such that

Similarly, ${\mathbf{W}}_{\mathbf{Y}}\in {\mathbb{R}}^{I\times M}$ indicates the missing entries in $\mathbf{Y}\in {\mathbb{R}}^{I\times M}$. Modeling only the known data entries has shown to be useful when fitting CP models in terms of both missing data estimation performance [55, 56] and computational efficiency [56]. Recently, we have also studied the CMTF model in Eq. (2) in terms of missing data estimation using a similar formulation [52]. Here, we only show that the structure-revealing CMTF model can easily handle missing data but we do not focus on the missing data estimation problem in this paper.

### Algorithm

Previously, we have studied the minimization of the objective for the original CMTF model in Eq. (2) [14] using an all-at-once gradient-based optimization approach, which solves the optimization problem for all factor matrices simultaneously. Here, we extend that work to fit the structure-revealing CMTF model and focus on the minimization of the objective function in Eq. (4).

We first briefly discuss the computation of the gradient. The gradient can be computed by taking the partial derivates of *f* with respect to the factor matrices and the vectors *λ* and *σ*. The gradient ∇*f* of size *R* (*I* + *J* + *K* + *M* + 2) can be formed by vectorizing the partials with respect to the factor matrices and concatenating them with the partials with respect to the vectors *λ* and *σ* as follows:

Let $\mathit{T}=\left[\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\right[\phantom{\rule{0.3em}{0ex}}\mathbf{\lambda};\mathbf{A},\mathbf{B},\mathbf{C}\left]\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\right]$ and **Z** = **A** **Σ** **V**^{T}. Assuming that each term in *f* is multiplied by $\frac{1}{2}$ for ease of computation, the partial derivatives can be computed as

where ×_{
n
} denotes the tensor-vector product in the *n*th mode; ⊙ denotes the Khatri-Rao product, and **X**_{(n)} denotes the tensor $\mathit{X}$ unfolded in the *n*th mode. Unfolding (or matricization) in the *n*th mode rearranges a higher-order tensor as a matrix by using the mode-*n* fibers as the columns of the resulting matrix (See [42, 43] for details.) $\stackrel{\u0304}{\mathbf{A}}$ corresponds to **A** with columns divided by their 2-norms. Here, *ε* is set to 10^{-8}.

Once the gradient is computed, we use the Nonlinear Conjugate Gradient (NCG) method [53] with the Moré-Thuente line search as implemented in the Poblano Toolbox [57] (for the convergence properties of NCG, we refer interested readers to [53]). Any other first-order method such as the other algorithms implemented in the Poblano Toolbox can also be used to fit the model. Note that we are solving a non-convex optimization problem and cannot guarantee to reach the global minimum. Therefore, we use random initializations and pick the solution with the minimum function value in our experiments in the next section. The computational cost *per iteration* depends on the gradient computations, and in the case of a third-order tensor of size *N* × *N* × *N* coupled with a matrix of size *N* × *N*, the leading term in the gradient computation is *O* (*N*^{3}*R*) for an *R*-component model.

## Results and discussion

In this section, we first compare the performance of our model with the traditional CMTF model using simulated coupled data sets in terms of identifying shared/unshared components. We then use the proposed model to jointly analyze LC-MS and NMR measurements of a set of mixtures with known chemical composition and demonstrate that our model can successfully capture the chemicals used in the mixtures, extract the relative concentrations of the chemicals accurately and provide promising results in terms of identifying shared/unshared chemicals.

### Simulations

We generate simulated coupled data sets with different underlying structures and compare the original CMTF formulation in Eq. (2) with the model in Eq. (4).

#### Experimental set-up

We generate factor matrices $\mathbf{A}\in {\mathbb{R}}^{I\times R},\mathbf{B}\in {\mathbb{R}}^{J\times R},\mathbf{C}\in {\mathbb{R}}^{K\times R}$ and $\mathbf{V}\in {\mathbb{R}}^{M\times R}$ with entries randomly drawn from the standard normal distribution. The columns of factor matrices are normalized to unit norm. Here, we set *I*=50,*J* = 30,*K* = 40 and *M* = 20. The factor matrices are used to construct a third-order tensor $\mathit{X}=\left[\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\right[\phantom{\rule{0.3em}{0ex}}\mathbf{\lambda};\mathbf{A},\mathbf{B},\mathbf{C}\left]\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\right]$ coupled with matrix **Y** = **A** **Σ** **V**^{T}, where *λ* and diagonal entries of diagonal matrix **Σ**, i.e., *σ* of length *R*, correspond to the weights of rank-one third-order tensors and matrices, respectively. A small amount of Gaussian noise is added to data sets. Using four sets of weights, we generate cases where *R* components are shared differently among coupled data sets: (i) Case 1: One shared and one unshared component in each data set, i.e., **λ** = [ 1 0 1]^{T} and **σ** = [ 1 1 0]^{T}, where *R* =3. (ii) Case 2: One unshared component in the matrix, i.e., **λ** = [ 1 1 0]^{T} and **σ** = [ 1 1 1]^{T}, where *R* =3. (iii) Case 3: One unshared component in the third-order tensor, i.e., **λ** = [ 1 1 1]^{T} and **σ** = [ 1 1 0]^{T}, where *R* =3. (iv) Case 4: One shared and one unshared component in the third-order tensor as well as two unshared components in the matrix, i.e., **λ** = [ 1 1 0 0]^{T} and **σ** = [ 1 0 1 1]^{T}, where *R* = 4.

Once coupled data sets are generated, they are jointly factorized using the traditional CMTF model in Eq. (2) and our proposed structure-revealing CMTF model in Eq. (4) (referred to as Advanced CMTF (ACMTF)). As described in Section “Methods”, we use a gradient-based all-at-once optimization approach for fitting ACMTF, which we call ACMTF-OPT. Similarly, for fitting the model in Eq. (2), CMTF-OPT [14] is used and it is also based on a gradient-based all-at-once approach. Both CMTF-OPT and ACMTF-OPT are implemented in the MATLAB CMTF Toolbox (available from http://www.models.life.ku.dk). As stopping conditions, both methods use the relative change in function value (set to 10^{-10}) and the 2-norm of the gradient divided by the number of entries in the gradient (set to 10^{-10}).

#### Numerical results

Experiments demonstrate the potential problem with the CMTF model and how it fails to identify shared and unshared components due to uniqueness issues. On the other hand, our structure-revealing model can successfully identify shared/unshared components through the use of sparsity penalties on the component weights. Figures 3, 4, 5, and 6 demonstrate the weights, ** λ** and

**, estimated using both models for 100 runs returning the same function value**

*σ*^{a}, i.e., multiple random starts are used and the minimum function value is obtained 100 times. When we use CMTF,

**and**

*λ***are estimated by normalizing the columns of the extracted factor matrices. In Figure 3, we expect to recover**

*σ***= [ 1 0 1]**

*λ*^{T}and

**= [ 1 1 0]**

*σ*^{T}; however, we observe that weights captured by CMTF vary hiding the true underlying structure of the data sets. On the other hand, ACMTF reveals the true structure indicating that there is one shared and one unshared component in each data set. The order of original and extracted components is different due to the permutation ambiguity in the models. Also, due to the permutation ambiguity, all possible permutations of the components for different runs returning the minimum function value are compared and the results are reported based on the best matching permutation

^{b}. Bottom plots in Figure 3 show how well the extracted factors match with the true columns of factor matrix

*A*. Let ${\widehat{\mathbf{a}}}_{r}$ be the

*r*th column of the factor matrix $\widehat{\mathbf{A}}$ extracted from the common mode. The match score corresponds to $\frac{{\widehat{\mathbf{a}}}_{r}^{T}{\mathbf{a}}_{r}}{\Vert \phantom{\rule{0.3em}{0ex}}{\widehat{\mathbf{a}}}_{r}\phantom{\rule{0.3em}{0ex}}\Vert \Vert \phantom{\rule{0.3em}{0ex}}{\mathbf{a}}_{r}\phantom{\rule{0.3em}{0ex}}\Vert}$ after finding the best matching permutation of the columns. These plots show that not only the weights can indicate shared/unshared components but also factor vectors can be estimated well using ACMTF. Similarly, in Figure 4, we expect to see three non-zero weights for the matrix and two non-zero weights for the tensor. However, there is variation for the same function value particularly in

*σ*hiding the structure of the data sets and preventing recovery of the factor vectors accurately when data sets are modeled using CMTF. ACMTF, on the other hand, can identify shared and unshared components accurately. Unlike Case 1 and 2, CMTF performs well for Case 3, where the tensor has all three components and two of them are shared with the matrix (Figure 5).While ACMTF performs well for all three cases, we should note that uniqueness properties of the model need to be better understood. For instance, in Case 4, there are two unshared components in the matrix and, in Figure 6, match scores for ACMTF indicate that underlying factors can no longer be perfectly recovered. That is mainly because the model is no longer unique. Two unshared components in the matrix span the same subspace in different runs returning the same function value but components from different runs can no longer be compared using the match score.

We also show how effective the penalty method is in terms of satisfying the unit-norm constraints in Figure 7. Figure 7 illustrates the 2-norm of each column of the factor matrix in each mode as the algorithm runs. We observe that while norms of the columns fluctuate initially, when the algorithm stops, they are all close to 1. This indicates that even though we solve the constrained optimization problem in (3) using the quadratic penalty method, we can still satisfy the constraints. The parameter *α* is set to *α* = 1 for all modes since we want the quadratic penalty terms to have the same weight as the first two terms in the objective in Eq. (4). Note that before fitting the model, each data set, i.e., tensor $\mathit{X}$ and matrix **Y**, is divided by its Frobenius norm. Therefore, by selecting *α* = 1, we give equal importance to every term in the objective except the sparsity-inducing penalties. We use *β* = 10^{-3} as the sparsity penalty parameter in our experiments.

In order to assess the sensivity of ACMTF to the selection of the *β* value, we show the performance of the model for Case 1 using different *β* values, i.e, *β* ∈ {0,10^{-5},10^{-4},10^{-3},10^{-2},10^{-1}} in Figure 8. We observe that except for *β* = 0, shared and unshared factors can be correctly identified for all other *β* values. However, for higher values of *β*, i.e., *β* = 10^{-2} and *β* = 10^{-1}, it becomes difficult to get the true solution, i.e., out of 1000 random starts, only few runs return the true solution for high *β* values while the true solution is reached by approximately 50%–75% of the random starts for *β* = 10^{-4} or *β* = 10^{-5}^{c}.

Finally, we discuss how we interpret the extracted weights. For instance, for Case 1, while the true nonzero weights are set to 1 in *λ* and *σ* when generating the data sets, the estimated values of the nonzero weights by the ACMTF model are approximately 0.70 in Figure 3(b). That is due to the fact that models are fitted to data sets divided by their Frobenius norms, which are approximately 1.42. In order to find the actual weights in each data set, we would multiply the captured weights by the norm of each data set. However, in joint data analysis, we are looking for weights that can show the relative significance of a factor in one data set with respect to the other data sets, rather than absolute weights in each data set. For instance, if we generate coupled data sets using **λ**= [ 100 0 100]^{T} and **σ** = [ 1 1 0]^{T}, the ACMTF model still reveals the weights given in Figure 3(b). Furthermore, if a factor has different contributions to the data sets, that will also be revealed by the weights. For instance, in Case 2, data sets are generated using **λ** = [ 1 1 0]^{T} and **σ** = [ 1 1 1]^{T}, where the shared component contributes more to $\mathit{X}$ compared to **Y**. That is revealed by the weights extracted by the ACMTF model in Figure 4(b), where $\widehat{\mathbf{\lambda}}=\phantom{\rule{2.77626pt}{0ex}}{\left[\phantom{\rule{0.3em}{0ex}}0.70\phantom{\rule{5.0pt}{0ex}}0.70\phantom{\rule{5.0pt}{0ex}}0\right]}^{T}$ and $\widehat{\mathbf{\sigma}}=\phantom{\rule{2.77626pt}{0ex}}{\left[\phantom{\rule{0.3em}{0ex}}0.57\phantom{\rule{5.0pt}{0ex}}0.56\phantom{\rule{5.0pt}{0ex}}0.57\right]}^{T}$.

#### Extension to multiple data sets

Our experiments so far have focused on joint analysis of two data sets. Here, we also demonstrate that the proposed model has a promising performance in terms of identifying shared/unshared factors when more than two data sets are jointly analyzed. We use the coupled data sets given in Figure 9(a) as an illustrative example.

In order to construct the data sets in Figure 9(a), factor matrices $\mathbf{A}\in {\mathbb{R}}^{I\times R},\mathbf{B}\in {\mathbb{R}}^{J\times R},\mathbf{C}\in {\mathbb{R}}^{K\times R}$, $\mathbf{V}\in {\mathbb{R}}^{M\times R}$ and $\mathbf{S}\in {\mathbb{R}}^{L\times R}$ are generated as described in the Experimental set-up section. Here, we set *I* = 50,*J* = 30,*K* = 40, *M* = 20,*L* = 40, and *R* = 4. Factor matrices are then used to construct a third-order tensor $\mathit{X}=\phantom{\rule{2.77626pt}{0ex}}\left[\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\right[\phantom{\rule{0.3em}{0ex}}\mathbf{\lambda};\mathbf{A},\mathbf{B},\mathbf{C}\left]\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\right]$ coupled with **Y** = **A** **Σ** **V**^{T}and **Z** = **A** **Γ** **S**^{T}in the first mode, where *λ*, diagonal entries of the diagonal matrix **Σ**, i.e., *σ*, and diagonal entries of the diagonal matrix **Γ**, i.e., **γ**, correspond to the weights of the components. Figure 9(b) demonstrates the performance of the ACMTF model in terms of identifying shared/unshared components when each data set has one shared and one unshared component; in other words, data sets are generated using the weights **λ** = [ 1 1 0 0]^{T}, **σ** = [ 1 0 1 0]^{T}, and **γ** = [ 1 0 0 1]^{T}. We observe that the extracted weights reveal that there is one component shared by all three data sets and one unshared component in each data set.

### Real data

In this section, the structure-revealing CMTF model is used to jointly analyze diffusion NMR and LC-MS measurements of 29 mixtures prepared using five chemicals. We first describe the sample preparation and the measurements, and then demonstrate the performance of our model in terms of capturing the signatures/patterns related to chemicals used to prepare the mixtures.

#### Sample preparation and measurements

Five chemicals with different relative sizes, hence, different diffusion, were selected: two peptides, a single amino acid, a sugar and an alcohol, i.e., Valine-Tyrosine-Valine (Val-Tyr-Val), Tryptophan-Glycine (Trp-Gly), Phenylalanine (Phe), Maltoheptaose (Malto) and Propanol. 29 samples were prepared with varying concentrations according to a predetermined design (see Additional file 1) in a phosphate buffer (pH 7.4). The buffer was prepared with deuterated water according to a protocol for biological samples [58] but with a 10-fold increase in the concentration of TSP (sodium 3-(trimethylsilyl)-propionate-2,2,3,3-d _{4}) in order to ensure sufficient signal intensity for reference deconvolution [59]. The 10-fold increase in the concentration of TSP did not affect the pH of the buffer. All chemicals were purchased from Sigma Aldrich and used without further purification. Samples were stored at 5°C until they were measured.

NMR spectra of the samples were recorded on a Bruker DRX 500 spectrometer (Bruker Biospin Gmbh, Rheinstetten, Germany) operating at a proton frequency of 500.13 MHz. For each spectrum, 32768 complex points were acquired in 64 scans with a recycle delay of 2 seconds at a nominal temperature of 298 K. The spectrometer was equipped with a 5 mm BBI probe and spectra were recorded using the Oneshot45 sequence [60] with 8 gradient levels ranging from 3.4 to 26.9 G cm ^{-1} with equal steps in gradient squared in nominal gradient amplitude. The diffusion time was 100 ms and the gradient encoding time was 1 ms. All processing of the data, including phase correction, apodization, Fourier transformation, baseline correction, referencing to TSP signal, and reference deconvolution, was performed using the DOSY Toolbox [61]. In order to correct for instrument instabilities, reference deconvolution was performed using the TSP methyl signal as a reference, using a target lineshape of 4.5 Hz [59, 62]. The MATLAB code for the DOSY toolbox is freely available via http://dosytoolbox.chemistry.manchester.ac.uk/. NMR measurements for each mixture correspond to a set of spectra recorded at different gradient levels. Since we have several mixtures, NMR data can be arranged as a third-order tensor with modes: mixtures, chemical shift and gradient levels (Figure 1). The chemical shift (i.e., the conventional scale for a ^{1}H NMR spectrum) is related to the chemical environment of the protons, and the gradient levels encode the diffusion property of the various molecular species.

Prior to LC-MS measurements, 29 samples were diluted to 10 ppm in water and subsequently analyzed with ultra-performance liquid chromatography (UPLC) system coupled to quadruple time-of-flight (Premier QTOF) mass spectrometer (Waters Corporation, Manchester, UK). Each sample (10*μ* *L*) was injected into the UPLC equipped with a 1.7*μ* *m* C18 BEH column (Waters) operated with a 6-min linear gradient from 0.1*%* formic acid in water to 0.1*%* formic acid in 20*%* acetone: 80*%* acetonitrile. The data were acquired on the positive electrospray ionization (ESI) mode with the following settings: capillary probe voltage was set to 2.8 keV, desolvation gas temperature was at 400°C, cone voltage was 40 V, with the Ar collision gas energy of 10 V. The centroided raw data were converted to an intermediate netCDF format with the DataBridge ^{TM} utility provided with the MassLynx software. Automatic peak detection and integration were performed using the XCMS package [63]. Since individual chemical compounds give rise to more than one fragment ion upon ionization, these ion-features, generated by XCMS, were grouped together using the CAMERA package [64]. The final LC-MS data set is in form of a mixtures by features matrix (Figure 1).

#### Analysis

Before discussing joint analysis of the third-order tensor $\mathit{X}$ representing diffusion NMR measurements and the matrix **Y** representing LC-MS data (Figure 1), we briefly discuss the analysis of the NMR data individually. $\mathit{X}$ has an underlying CP structure [20, 21, 65–68] and can be modeled using a CP model, i.e., $\mathit{X}\approx \phantom{\rule{2.77626pt}{0ex}}\left[\phantom{\rule{0.6em}{0ex}}\right[\phantom{\rule{0.3em}{0ex}}\mathbf{A},\mathbf{B},\mathbf{C}\left]\phantom{\rule{0.6em}{0ex}}\right]$. Here, **A**,**B** and **C** correspond to the factor matrices in the mixtures, chemical shift and gradient levels modes, respectively. When we model $\mathit{X}$ using a 5-component CP model, we observe that each CP component corresponds to one of the chemicals used in the mixtures. The signatures in the chemical shift mode (the NMR spectra), i.e., the columns of matrix **B**, as well as the exponential decay signatures represented by the columns of matrix **C** can be used to identify these chemicals. Figure 10 shows the NMR signatures extracted by the CP model (Signatures in the chemical shift mode (spectra) of pure chemicals are given in Additional file 2 as a reference). Matrix **A** captures the relative concentrations of the extracted components in the mixtures and we observe that **A** matches well with the design used in sample preparation in Figure 11. Matrix **Y** representing LC-MS measurements can be analyzed individually using matrix factorizations. However, matrix factorizations without any constraints on the factors have a rotational freedom; therefore, capturing the patterns corresponding to each chemical using only LC-MS data is challenging. One potential approach may be to use sparse principal component analysis [69]; however, even with careful fine-tuning of the sparsity parameter, the underlying design cannot be captured as well as in Figure 11 due to unavoidable experimental noise in LC-MS (results not shown).

Analysis of the diffusion NMR data not only reveals the underlying structures in the chemical mixtures but can also be used to extract the relevant patterns corresponding to the same chemicals from data sets, which are much harder to analyze, e.g., LC-MS measurements. LC-MS data are often noisy and contain many irrelevant features due to the sensitivity of the analytical technique. Next, we jointly analyze NMR and LC-MS measurements using the structure-revealing CMTF model and demonstrate the benefits of joint analysis of these data sets. As a preprocessing step, LC-MS features are scaled by their standard deviations and both NMR and LC-MS data sets are scaled by their respective Frobenius norms. We jointly analyze the data sets using (i) Model 1: ACMTF model with no sparsity penalty, i.e., *β* = 0, and (ii) Model 2: ACMTF model with sparsity penalties on the weights of rank-one components, where *β* = 10^{-3}. For both models, the number of components is set to *R* = 6. Since there are five chemicals in the samples and we expect to have some experimental noise, we use *R*=6 components. We discuss the choice of the number of components further in the Discussion section.

Model 1 is equivalent to the traditional CMTF model in the sense that it does not impose sparsity on the weights of rank-one components. Similar to our observations on simulated data sets, we observe that weights captured by Model 1 (Figure 12(a)) for the runs returning the same function value suggest that the model fails to give a unique solution. Model 2, on the other hand, captures the weights given in Figure 12(b) for the runs returning the same function value, which suggests uniqueness, and extracts the components illustrated in Figure 13. The model is able to capture the underlying chemicals and, as shown in Figure 14, it is also effective in terms of capturing the underlying design used in sample preparation. In Figure 14, we plot the columns of the factor matrix **A** for all (98) runs returning the same function value in red and the true design is plotted in blue. This further illustrates the suggested uniqueness of the model. In order to understand how components are shared among data sets, we look at the weights of rank-one components in Figure 12(b). While the components corresponding to Val-Tyr-Val, Trp-Gly, Phe and Malto are shared by both data sets, the component corresponding to propanol has a very small weight (<0.1) in LC-MS. Since propanol is not retained in the liquid chromatography column and eluted with the solvent front, it does not show up in LC-MS measurements; therefore, having a small weight for propanol in LC-MS is promising. Similarly, one of the components in LC-MS is modeling noise (which could be both structured and random) and barely shows up in NMR. That is also expected since this LC-MS data set is very noisy compared to the NMR data.

By individually analyzing NMR data, we have been able to capture NMR signatures of the chemicals. The benefit of jointly analyzing NMR and LC-MS, on the other hand, is two-fold: (i) In addition to the NMR signatures, we also extract the factor vectors corresponding to the LC-MS feature mode for each chemical as shown in Figure 13. The features with high coefficients (in terms of absolute value) in each factor reveal the features relevant to the chemical modeled by that component (see Additional file 3 for LC-MS features captured by the model for each component). (ii) Weights of rank-one components in each data set give an indication of the chemicals visible to each analytical technique.

#### Discussion

Even though the main motivation for a structure-revealing coupled factorization model is to identify shared/unshared components automatically through modeling constraints, there are still several parameters to be determined: (i) number of components (*R*) and (ii) sparsity penalty parameter (*β*). In order to see the sensivity of joint factorization of NMR and LC-MS to these parameters, we have fit the model using different *β* values, i.e., *β* ∈ {10^{-4},10^{-3},10^{-2},10^{-1}}, for different number of components, i.e., *R* ∈ {5,6,7,8}. If we use *β* = 10^{-4} or *β* = 10^{-2}, there are small variations in the weights captured by the runs returning the same function value even though the weights are close to what we have obtained in Model 2 using *β* = 10^{-3}. Using a much higher *β* value, i.e., *β* = 10^{-1}, on the other hand, sparsifies the weights introducing many zeros and fails to capture the underlying chemicals. In terms of the number of components, while the three-way NMR data set has 5 components, fitting a 5-component coupled model cannot find the underlying components accurately due to the additional structured/random noise in LC-MS. The singular values of the centered-scaled LC-MS data suggest that there are 6 significant components. Model 2, we have discussed so far, is a 6-component model but since we have not centered LC-MS data, we have also tried 7 and 8-component models. Using a 7-component model, true chemicals can still be captured but the additional component does not look meaningful and slightly distorts the true components. Using an 8-component model, we have similar observations except that the 8th component has a very small weight (<0.1) in both data sets indicating that we may be overfactoring the data. We plan to study and improve the robustness of the model to overfactoring, which can make it easier to choose the number of components.

In our analysis, we have downsampled the NMR spectra by a factor of 10 because we use many random starts to find the “true” solution and it is more efficient to work with downsampled NMR data. However, for better interpretability of NMR spectra, high digitization is needed. When we jointly analyze LC-MS data with the original NMR data, which have not been downsampled, using the same model parameters used for Model 2, the model reveals almost exactly the same components and weights, showing that the model is not sensitive to minor changes in the data.

While the model is promising, we should note that it is not perfect even for simple mixtures like we have analyzed here. One of the issues is that columns of factor matrix **V** corresponding to the LC-MS features mode are dense and not easily-interpretable. The *r*th column of **V** contains features corresponding to the chemical which has its NMR signatures as the *r*th column of matrix **B** and **C**; however, in addition to the relevant features, it also contains irrelevant features regarded as false-positives (see Additional file 3). Another issue is that it would be more useful to get zero weights instead of small weights for unshared components (as in simulated data sets). As pointed out in Section “Background”, several methods have been proposed for the identification of shared/unshared components within the context of joint analysis of matrices, and the performance comparison of those methods with the structure-revealing CMTF model is a topic of future research. However, note that since these methods focus on joint analysis of matrices, there are identifiability issues and the identifiability of the models are achieved using constraints on the components, such as orthogonality in CCA-based approaches [34] and GSVD-based methods [1]. The structure-revealing CMTF model, on the other hand, does not impose any constraints on the components (other than the unit norm constraints). The structure-revealing CMTF model has such an advantange over joint matrix factorization methods because the CP model used to model the higher-order tensor is capable of uniquely capturing the underlying factors. The CP model is unique under mild conditions up to permutation and scaling (for a review of uniqueness studies, see [43]). Furthermore, while we have seen that the structure-revealing CMTF model extends to multiple data sets, some of these joint matrix factorization methods have only been proposed for two data sets [34].

#### Potential biological applications of interest

In this section, we have illustrated how the structure-revealing CMTF model can be used to capture chemicals in mixtures measured using different analytical methods. In order to study both the strengths and the limitations of the model, we have used prototypical experimental coupled data sets, where the underlying ground truth is known. In many biological applications, we come across with such heterogeneous coupled data sets. For instance, the potential of fluorescence spectroscopic measurements of human plasma samples in cancer diagnostics has recently been demonstrated, and based on the prior chemical knowledge, the fluorescence measurements are expected to follow a CP model [70]. In fluorescence spectroscopy, measurements for each sample are represented as an excitation-emission matrix, and multiple samples form a third-order tensor with modes: samples, excitation and emission wavelengths. Plasma samples can also be measured using LC-MS and NMR, which are commonly used in metabolomics studies [6]. Measurements from LC-MS and NMR are usually arranged as samples by features matrices. In a recent study [25], we have jointly analyzed fluorescence and NMR measurements of plasma samples of a group of verified colorectal cancer patients and a group of controls with nonmalignant findings using the structure-revealing CMTF model. The preliminary results demonstrate that there are shared/unshared components, and two of the shared components achieve around 71.4*%* accuracy (with 63.6*%* sensitivity and 78.1*%* specificity) in terms of separating the two groups. Even though the number of chemicals that can be detected by fluorescence spectropscopy is limited compared to the chemicals detectable by NMR, the components extracted from the fluorescence data are easily interpretable, and this can make the identification of biomarkers easier.

Such heterogeneous coupled data sets are also encountered in biomedical signal processing. In order to have a better understanding of brain activities, it is highly desirable to jointly analyze EEG (electroencephalogram) and fMRI (functional Magnetic Resonance Imaging) signals because EEG has a high temporal resolution while fMRI provides a better spatial resolution. Current data fusion approaches for EEG and fMRI rely on joint analysis of fMRI data with signals from a single EEG channel or concatenated signals from multiple channels [71, 72]. On the other hand, it may be possible to arrange multi-channel EEG signals as a third-order tensor and jointly factorize the tensor with the matrix representing the fMRI data using the structure-revealing CMTF model [72].

## Conclusions

Joint analysis of data sets from multiple sources has the potential to enhance knowledge discovery. However, we are still lacking the data mining tools for data fusion and need a better understanding of the available models in order to improve them to address the challenges in data fusion. In this paper, we have introduced an unsupervised data fusion model that can jointly analyze heterogeneous, incomplete data sets with shared/unshared components by formulating data fusion as a coupled matrix and tensor factorization problem with sparsity penalties on the weights of rank-one components. Using numerical experiments, we have demonstrated that the proposed model outperforms the traditional coupled factorization model commonly used in the literature in terms of identifying shared/unshared components. Furthermore, we have measured a set of mixtures with known chemical composition using two different analytical techniques (LC-MS and NMR) and assessed the performance of the proposed model in terms of capturing the underlying chemicals, true design and shared/unshared components. The model provides promising performance and reveals the ground truth in these mixtures. In addition to the strengths of the proposed model, we have also discussed the potential drawbacks using this illustrative example.

While the structure-revealing CMTF model inherits uniqueness properties from the CP model, the overall uniqueness properties of the structure-revealing CMTF model need to be understood better, as it has been done for coupled CP factorizations in a recent study [73].

We intend to extend our studies in several directions: (i) In order to extract easily-interpretable patterns with less false-positives from LC-MS features mode, we plan to impose sparsity constraints on the factors. Our preliminary studies show that we can decrease the number of false-positives; however, the model distorts the NMR signatures. (ii) Our algorithmic approach based on unconstrained optimization is accurate but not flexible enough to impose constraints. The feasibility of a more flexible modeling framework for data fusion making use of general purpose optimization solvers will be explored in future studies [74].

## Endnotes

^{a} Function values are considered the same if they have all digits the same up to the sixth decimal place.

^{b} When we fit the models and obtain the same function value multiple times, the *i*th coupled component (**a**_{
i
},**b**_{
i
},**c**_{
i
},**v**_{
i
}) in one run may be the *j*th coupled component (**a**_{
j
},**b**_{
j
},**c**_{
j
},**v**_{
j
}) in another run. Therefore, all possible permutations of the coupled components for different runs are compared to find the best matching components across different runs.

^{c} This is valid when function values are considered to be the same when the difference between them is less than 10^{-6}.

## References

- 1.
Alter O, Brown PO, Botstein D: Generalized singular value decomposition for comparative analysis of genome-scale expression data sets of two different organisms. PNAS. 2003, 100: 3351-3356.

- 2.
Ponnapalli SP, Saunders MA, Loan CFV, Alter O: A higher-order generalized singular value decomposition for comparison of global mRNA expression from multiple organisms. PLoS One. 2011, 6 (12): e28072-

- 3.
Acar E, Plopper GE, Yener B: Coupled analysis of in vitro and histology tissue samples to quantify structure-function relationship. PLoS One. 2012, 7 (3): e32227-

- 4.
Badea L: Extracting gene expression profiles common to colon and pancreatic adenocarcinoma using simultaneous nonnegative matrix factorization. Pacific Symposium on Biocomputing, Volume. 2008, 279-290.

- 5.
Acar E, Gurdeniz G, Rasmussen MA, Rago D, Dragsted LO, Bro R: Coupled matrix factorization with sparse factors to identify potential biomarkers in metabolomics. Int J Knowl Discov Bioinformatics. 2012, 3 (3): 22-43.

- 6.
Richards SE, Dumas ME, Fonville JM, Ebbels TM, Holmes E, Nicholson JK: Intra- and inter-omic fusion of metabolic profiling data in a systems biology framework. Chemometrics Int Lab Syst. 2010, 104: 121-131.

- 7.
Krishnamurthy R, Saleem F, Liu P, Dame ZT, Poelzer J, Huynh J, Yallou FS, Psychogios N, Dong E, Bogumil R, Roehring C, Wishart DS: The human urine metabolome. PLoS One. 2013, 8: e73076-

- 8.
Singh AP, Gordon GJ: Relational learning via collective matrix factorization. KDD’08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. 2008, 650-658.

- 9.
Ma H, Yang H, Lyu MR, King I: SoRec: Social recommendation using probabilistic matrix factorization. CIKM’08: Proceedings of the 17th ACM Conference on Information and Knowledge Management. 2008, 931-940.

- 10.
Jiang M, Cui P, Liu R, Yang Q, Wang F, Zhu W, Yang S: Social contextual recommendation. CIKM’12: Proceedings of the 21st ACM Conference on Information and Knowledge Management. 2012, 45-54.

- 11.
Yeredor A: Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation. IEEE Trans Signal Process. 2002, 50: 1545-1553.

- 12.
Yoo J, Kim M, Kang K, Choi S: Nonnegative matrix partial co-factorization for drum source separation. ICASSP’10: Proceedings of IEEE International Conference on Acoustics, Speech and Signal. 2010, 1942-1945.

- 13.
Lee CH, Alpert BO, Sankaranarayanan P, Alter O: GSVD Comparison of patient-matched normal and tumor aCGH profiles reveals global copy-number alterations predicting glioblastoma multiforme survival. PLoS One. 2012, 7: e30098-

- 14.
Acar E, Kolda TG, Dunlavy DM: All-at-once Optimization For Coupled Matrix and Tensor Factorizations. KDD Workshop on Mining and Learning with Graphs (arXiv:1105.3422). 2011,

- 15.
Banerjee A, Basu S, Merugu S: Multi-way clustering on relation graphs. SDM’07: Proceedings of the 2007 SIAM International Conference on Data Mining. 2007, 145-156.

- 16.
Smilde A, Westerhuis JA, Boque R: Multiway multiblock component and covariates regression models. J Chemometrics. 2000, 14: 301-331.

- 17.
Yilmaz YK, Cemgil AT, Simsekli U: Generalised coupled tensor factorisation. Advances in Neural Information Processing Systems 24. Edited by: and Pereira, Shawe-taylor J, Zemel RS, Bartlett P, Weinberger KQ. 2011, 2151-2159. [http://books.nips.cc/papers/files/nips24/NIPS2011_1189.pdf],

- 18.
Johnson CS: Diffusion ordered nuclear magnetic resonance spectroscopy: principles and applications. Prog Nucl Magn Reson Spectrosc. 1999, 34: 203-256.

- 19.
Morris GA: Diffusion-ordered spectroscopy (DOSY). Encyclopedia of Magnetic Resonance. Edited by: Harris RK, Wasylishen RE. 2009, Chichester: Wiley, doi:10.1002/9780470034590.emrstm0119.pub2.,

- 20.
Pedersen HT, Dyrby M, Engelsen SB, Bro R: Application of multi-way analysis to 2D NMR data. Ann Rep Nmr Spectrosc. 2006, 59: 207-233.

- 21.
Nilsson M, Khajeh M, Botana A, Bernstein MA, Morris GA: Diffusion NMR and trilinear analysis in the study of reaction kinetics. Chemical Commun. 2009, 1252-1254.

- 22.
Ermis B, Acar E, Cemgil AT: Link prediction in heterogeneous data via generalized coupled tensor factorization. Data Min Knowl Discov. 2013, doi:10.1007/s10618-013-0341-y. [http://link.springer.com/article/10.1007%2Fs10618-013-0341-y],

- 23.
Lin YR, Sun J, Castro P, Konuru R, Sundaram H, Kelliher A: MetaFac: community discovery via relational hypergraph factorization. KDD’09: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2009, 527-536.

- 24.
Zheng VW, Cao B, Zheng Y, Xie X, Yang Q: Collaborative filtering meets mobile recommendation: a user-centered approach. AAAI’10: Proceedings of the 24th Conference on Artificial Intelligence. 2010, 236-241.

- 25.
Acar E, Lawaetz AJ, Rasmussen MA, Bro R: Structure-revealing data fusion model with applications in metabolomics. EMBS’13: Proceedings of the 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society. 2013, 6023-6026.

- 26.
van Deun K, van Mechelen I, Schouteden M, de Moor B, van der Werf M, de Lathauwer L, Smilde AK, Kiers HAL: DISCO-SCA and adapted GSVD as swinging alternatives to GSVD in finding common and distinctive processes. PLoS One. 2012, 7: e37840-

- 27.
Gupta SK, Phung D, Adams B, Tran T, Venkatesh S: Nonnegative shared subspace learning and its application to social media retrieval. KDD’10: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2010, 1169-1178.

- 28.
Lock EF, Hoadley KA, Marron J, Nobel AB: Joint and individual variation explained (JIVE) for integrated analysis of multiple data types. Ann Appl Stat. 2013, 7: 523-542.

- 29.
Xiao X, M-Moral A, Rotival M, Bottolo L, Petretto E: Multi-tissue analysis of co-expression networks by higher-order generalized singular value decomposition identifies functionally coherent transcriptional modules. PLoS Genetics. 2014, 10: e1004006-

- 30.
Liu W, Chan J, Bailey J, Leckie C, Ramamohanarao K: Mining labelled tensors by discovering both their common and discriminative subspaces. SDM’13: Proceedings of the 2013 SIAM International Conference on Data Mining. 2013, 614-622.

- 31.
Tucker LR: An inter-battery method of factor analysis. Psychometrika. 1958, 23: 111-136.

- 32.
Huopaniemi I, Suvitaival T, Nikkila J, Oresic M, Kaski S: Multivariate multi-way analysis of multi-source data. Bioinformatics. 2010, 26: i391-i398.

- 33.
Virtanen S, Klami A, Kaski S: Bayesian CCA via group sparsity. ICML’11: Proceedings of the 28th International Conference on Machine Learning. 2011, 457-464.

- 34.
Klami A, Virtanen S, Kaski S: Bayesian canonical correlation analysis. J Mach Learn Res. 2013, 14: 965-1003.

- 35.
Hotelling H: Relations between two sets of variates. Biometrika. 1936, 28: 321-377.

- 36.
Levin J: Simultaneous factor analysis of several Gramian matrices. Psychometrika. 1966, 31: 413-419.

- 37.
Westerhuis JA, Kourti T, Macgregor JF: Analysis of multiblock and hierarchical PCA and PLS models. J Chemometrics. 1998, 12: 301-321.

- 38.
Long B, Zhang ZM, Wu X, Yu PS: Spectral clustering for multi-type relational data. ICML’06: Proceedings of the 23rd International Conference on Machine Learning. 2006, 585-592.

- 39.
van Deun K, Wilderjans TF, van den Berg RA, Antoniadis A, van Mechelen I: A flexible framework for sparse simultaneous component based data integration. BMC Bioinformatics. 2011, 12: 448-

- 40.
Bouchard G, Guo S, Yin D: Convex collective matrix factorization. AISTATS 13: Proceedings of the 16th International Conference on Artificial Intelligence and Statistics. 2013, 144-152.

- 41.
Smilde A, Bro R, Geladi P: Multi-way Analysis: Applications in the Chemical Sciences. 2004, West Sussex: Wiley

- 42.
Acar E, Yener B: Unsupervised multiway data analysis: a literature survey. IEEE Trans Knowl Data Eng. 2009, 21: 6-20.

- 43.
Kolda TG, Bader BW: Tensor decompositions and applications. SIAM Rev. 2009, 51 (3): 455-500.

- 44.
Carroll JD, Chang JJ: Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition. Psychometrika. 1970, 35: 283-319.

- 45.
Harshman RA: Foundations of the PARAFAC procedure: Models and conditions for an “explanatory” multi-modal factor analysis. UCLA Working Papers Phonetics. 1970, 16: 1-84.

- 46.
Harshman RA, Lundy ME: PARAFAC: parallel factor analysis. Comput Stat Data Anal. 1994, 18: 39-72.

- 47.
Wilderjans TF, Ceulemans E, Kiers HAL, Meers K: The LMPCA program: A graphical user interface for fitting the Linked-Mode PARAFAC-PCA model to coupled real-valued data. Behav Res Methods. 2009, 41: 1073-1082.

- 48.
Papalexakis EE, Mitchell TM, Sidiropoulos ND, Faloutsos C, Talukdar PP, Murphy B: Turbo-SMT: accelerating coupled sparse matrix-tensor factorizations by 200x. SDM’14: Proceedings of the 2014 SIAM International Conference on Data Mining. 2014,

- 49.
Beutel A, Kumar A, Papalexakis EE, Talukdar PP, Faloutsos C, Xing EP: FLEXIFACT: scalable flexible factorization of coupled tensors on Hadoop. SDM’14: Proceedings of the 2014 SIAM International Conference on Data Mining. 2014,

- 50.
Sorber L, Barel MV, De Lathauwer L: Structured data fusion. Tech. rep., 13-177, ESAT-STADIUS, KU Leuven 2013. [http://bit.ly/1iKJprY],

- 51.
Narita A, Hayashi K, Tomioka R, Kashima H:

*Tensor factorization using auxiliary information*. 2011, - 52.
Acar E, Rasmussen MA, Savorani F, Næs T, Bro R: Understanding data fusion within the framework of coupled matrix and tensor factorizations. Chemometrics Intell Lab Syst. 2013, 129: 53-63.

- 53.
Nocedal J, Wright SJ: Numerical Optimization, second edition. 2006, New York: Springer

- 54.
Lee S, Lee H, Abbeel P, Ng AY: Efficient L1 regularized logistic regression. AAAI’06: Proceedings of the 20th Conference on Artificial Intelligence. 2006, 401-408.

- 55.
Tomasi G, Bro R: PARAFAC and missing values. Chemometrics Intell Lab Syst. 2005, 75: 163-180.

- 56.
Acar E, Dunlavy D, Kolda T, Mørup M: Scalable tensor factorizations for incomplete data. Chemometrics Intell Lab Syst. 2011, 106: 41-56.

- 57.
Dunlavy DM, Kolda TG, Acar E: Poblano v1.0: A Matlab toolbox for gradient-based optimization. Tech. Rep. SAND2010-1422, Sandia National Laboratories, Albuquerque, NM and Livermore, CA 2010. http://www.cs.sandia.gov/~dmdunla/publications/SAND2010-1422.pdf,

- 58.
Beckonert O, Keun HC, Ebbels TMD, Bundy J, Holmes E, Lindon JC, Nicholson JK: Metabolic profiling, metabolomic and metabonomic procedures for NMR spectroscopy of urine, plasma, serum and tissue extracts. Nature Protocols. 2007, 2: 2692-2703.

- 59.
Morris GA, Barjat H, Home TJ: Reference deconvolution methods. Prog Nucl Magn Reson Spectrosc. 1997, 31: 197-257.

- 60.
Botana A, Aguilar JA, Nilsson M, Morris GA: J-modulation effects in DOSY experiments and their suppression: The Oneshot45 experiment. J Magn Reson. 2011, 208: 270-278.

- 61.
Nilsson M: The DOSY Toolbox: A new tool for processing PFG NMR diffusion data. J Magn Reson. 2009, 200: 296-302.

- 62.
Nilsson M, Morris GA: Correction of systematic errors in CORE processing of DOSY data. Magn Reson Chem. 2006, 44: 655-660.

- 63.
Smith CA, Want EJ, Abagyan R, Siuzdak G, G O: XCMS: processing mass spectrometry data for metabolite profiling using nonlinear peak alignment, matching, and identification. Anal Chem. 2006, 78: 779-787.

- 64.
Kuhl C, Tautenhahn R, Bottcher C, Larson TR, Neumann S: CAMERA: an integrated strategy for compound spectra extraction and annotation of liquid chromatography/mass spectrometry data sets. Anal Chem. 2012, 84: 283-289.

- 65.
Nilsson M, Botana M, Morris GA: T-1-diffusion-ordered spectroscopy: nuclear magnetic resonance mixture analysis using parallel factor analysis. Anal Chem. 2009, 81: 8119-8125.

- 66.
Bro R, Viereck N, Toft M, Toft H, Hansen IP, Engelsen SB: Mathematical chromatography solves the cocktail party effect in mixtures using 2D spectra and PARAFAC. Trac-Trends Anal Chem. 2010, 29: 281-284.

- 67.
Björneras J, Botana A, Morris GA, Nilsson M: Resolving complex mixtures: trilinear diffusion data. J Biomolecular NMR. 2014, 58: 251-257.

- 68.
Khajeh M, Botana A, Bernstein MA, Nilsson M, Morris GA: Reaction kinetics studied using diffusion-ordered spectroscopy and multiway chemometrics. Anal Chem. 2010, 82: 2102-2108.

- 69.
Zou H, Hastie T, Tibshirani R: Sparse principal component analysis. J Comput Graph Stat. 2006, 15: 265-286.

- 70.
Lawaetz AJ, Bro R, Kamstrup-Nielsen M, Christensen IJ, Jorgensen LN, Nielsen HJ: Fluorescence spectroscopy as a potential metabonomic tool for early detection of colorectal cancer. Metabolomics. 2012, 8: 111-121.

- 71.
Calhoun V, Adali T, Pearlson G, Kiehl K: Neuronal chronometry of target detection: Fusion of hemodynamic and event-related potential data. NeuroImage. 2006, 30: 544-553.

- 72.
Swinnen W, Hunyadi B, Acar E, Huffel SV, De Vos M: Incorporating higher dimensionality in joint decomposition of EEG and fMRI. Eusipco’14: Proceedings of the 22nd European Signal Processing Conference (To Appear). 2014, ftp://ftp.esat.kuleuven.ac.be/pub/stadius/wswinnen/reports/EUSIPCO-14-49.pdf,

- 73.
Sørensen M, De Lathauwer L: Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank- (

*L*_{r,n},*L*_{r,n},1) terms—part i: uniqueness. Tech. rep., 13-143, ESAT-STADIUS, KU Leuven 2014. [ftp://ftp.esat.kuleuven.be/pub/SISTA/sistakulak/reports/Coupled_CPD_Uniqueness_plusSM.pdf], - 74.
Acar E, Nilsson M, Saunders M: A flexible modeling framework for coupled matrix and tensor factorizations. Eusipco’14: Proceedings of the 22nd European Signal Processing Conference. 2014, [http://www.models.life.ku.dk/~acare/2014_Eusipco_SNOPT.pdf],

## Acknowledgements

We thank Daniela Rago for helping with the LC-MS measurements. We also thank Parvaneh Ebrahimi and Abdelrhani Mourib for their help in sample preparation. This work is funded by the Danish Council for Independent Research (DFF) - Technology and Production Sciences (FTP) Program under the projects 11-116328 and 11-120947.

## Author information

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

EA, MR and RB developed the model. EA implemented the proposed model and the algorithmic approach. EA and EP carried out the experiments on simulated data. GG, AL and MN designed and measured the mixtures. EA and RB analyzed the measured LC-MS and NMR data. GG and MN interpreted the factors extracted from LC-MS and NMR, respectively. All authors read and approved the final manuscript.

## Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

## Rights and permissions

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.

## About this article

#### Received

#### Accepted

#### Published

#### DOI

### Keywords

- Data fusion
- Coupled matrix and tensor factorizations
- Optimization
- Sparsity
- NMR
- DOSY
- MS