<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Big Data</journal-id>
<journal-title>Frontiers in Big Data</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Big Data</abbrev-journal-title>
<issn pub-type="epub">2624-909X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdata.2023.1151893</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Big Data</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Fused multi-modal similarity network as prior in guiding brain imaging genetic association</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>He</surname> <given-names>Bing</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1691510/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Xie</surname> <given-names>Linhui</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1586753/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Varathan</surname> <given-names>Pradeep</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Nho</surname> <given-names>Kwangsik</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/672720/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Risacher</surname> <given-names>Shannon L.</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/243600/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Saykin</surname> <given-names>Andrew J.</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/40036/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Yan</surname> <given-names>Jingwen</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/539668/overview"/>
</contrib>
<contrib contrib-type="author">
<collab>The Alzheimer&#x00027;s Disease Neuroimaging Initiative</collab>
<xref ref-type="author-notes" rid="fn002"><sup>&#x02020;</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Luddy School of Informatics, Computing, and Engineering, Indiana University Purdue University Indianapolis (IUPUI)</institution>, <addr-line>Indianapolis, IN</addr-line>, <country>United States</country></aff>
<aff id="aff2"><sup>2</sup><institution>School of Engineering and Technology, Indiana University Purdue University Indianapolis (IUPUI)</institution>, <addr-line>Indianapolis, IN</addr-line>, <country>United States</country></aff>
<aff id="aff3"><sup>3</sup><institution>Indiana Alzheimer&#x00027;s Disease Research Center</institution>, <addr-line>Indianapolis, IN</addr-line>, <country>United States</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Bin Gu, Mohamed bin Zayed University of Artificial Intelligence (MBZUAI), United Arab Emirates</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Haoteng Tang, University of Pittsburgh, United States; Xi Jiang, University of Electronic Science and Technology of China, China; Shu Yang, University of Pennsylvania, United States; Xiaoke Hao, Hebei University of Technology, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Jingwen Yan <email>jingyan&#x00040;iupui.edu</email></corresp>
<fn fn-type="other" id="fn002"><p>&#x02020;Data used in preparation of this article were obtained from the Alzheimer&#x00027;s Disease Neuroimaging Initiative (ADNI) database (<ext-link ext-link-type="uri" xlink:href="http://adni.loni.usc.edu/">adni.loni.usc.edu</ext-link>). As such, the investigators within the ADNI contributed to the design and implementation of ADNI and/or provided data but did not participate in analysis or writing of this report. A complete listing of ADNI investigators can be found at: <ext-link ext-link-type="uri" xlink:href="http://adni.loni.usc.edu/wp-content/uploads/how_to_apply/ADNI_Acknowledgement_List.pdf">http://adni.loni.usc.edu/wp-content/uploads/how_to_apply/ADNI_Acknowledgement_List.pdf</ext-link></p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>05</day>
<month>05</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>6</volume>
<elocation-id>1151893</elocation-id>
<history>
<date date-type="received">
<day>26</day>
<month>01</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>04</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2023 He, Xie, Varathan, Nho, Risacher, Saykin, Yan and the Alzheimer&#x00027;s Disease Neuroimaging Initiative.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>He, Xie, Varathan, Nho, Risacher, Saykin, Yan and the Alzheimer&#x00027;s Disease Neuroimaging Initiative</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license> </permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Brain imaging genetics aims to explore the genetic architecture underlying brain structure and functions. Recent studies showed that the incorporation of prior knowledge, such as subject diagnosis information and brain regional correlation, can help identify significantly stronger imaging genetic associations. However, sometimes such information may be incomplete or even unavailable.</p></sec>
<sec>
<title>Methods</title>
<p>In this study, we explore a new data-driven prior knowledge that captures the subject-level similarity by fusing multi-modal similarity networks. It was incorporated into the sparse canonical correlation analysis (SCCA) model, which is aimed to identify a small set of brain imaging and genetic markers that explain the similarity matrix supported by both modalities. It was applied to amyloid and tau imaging data of the ADNI cohort, respectively.</p></sec>
<sec>
<title>Results</title>
<p>Fused similarity matrix across imaging and genetic data was found to improve the association performance better or similarly well as diagnosis information, and therefore would be a potential substitute prior when the diagnosis information is not available (i.e., studies focused on healthy controls).</p></sec>
<sec>
<title>Discussion</title>
<p>Our result confirmed the value of all types of prior knowledge in improving association identification. In addition, the fused network representing the subject relationship supported by multi-modal data showed consistently the best or equally best performance compared to the diagnosis network and the co-expression network.</p></sec></abstract>
<kwd-group>
<kwd>Alzheimer&#x00027;s disease</kwd>
<kwd>imaging genetics</kwd>
<kwd>network fusion</kwd>
<kwd>prior knowledge</kwd>
<kwd>DSCCA</kwd>
</kwd-group>
<counts>
<fig-count count="3"/>
<table-count count="3"/>
<equation-count count="14"/>
<ref-count count="33"/>
<page-count count="8"/>
<word-count count="5586"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Medicine and Public Health</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>Brain imaging genetics studies the influence of genetic variation on brain structure and function. Its major task is to examine the association between genetic markers such as single nucleotide polymorphisms (SNPs) and quantitative traits (QTs) extracted from multi-modal neuroimaging data (e.g., MRI and PET scans). Although both gene and imaging phenotype are two well-known factors contributing to brain function, exploring their underlying connections would lead to a better mechanistic understanding of normal or disordered brain functions.</p>
<p>Early studies in brain imaging genetics associations typically adopt a univariate approach (Shen et al., <xref ref-type="bibr" rid="B24">2010</xref>), where each pair of SNP and brain phenotype were examined individually for the association. Based on the assumption that a real imaging genetic association typically involves a small subset of SNPs and QTs, bi-multivariate association models, such as sparse canonical correlation analysis (SCCA), have been increasingly used later to identify the best linear transformation for imaging and genetics features so that the correlation between imaging and genetic components can be maximized (Chi et al., <xref ref-type="bibr" rid="B5">2013</xref>; Lin et al., <xref ref-type="bibr" rid="B16">2014</xref>). Recently, to further improve the performance, various prior knowledge, such as diagnosis group, linkage disequilibrium block in SNPs, and brain co-expression networks, have been incorporated into the SCCA model. These prior knowledge mitigates the effect of limited sample size and all of them have helped yield much improved performance over the traditional SCCA model. However, these prior knowledge are not always available or sometimes not applicable. For example, the brain co-expression network used by Yan et al. (<xref ref-type="bibr" rid="B31">2014</xref>) requires a predefined subset of genes related to brain imaging, which would not be available for structural MRI. Some imaging genetics studies may have to deal with data without diagnosis information or with a single diagnosis group. In both cases, diagnosis information cannot be used as prior. Data-driven subject similarity network has been previously explored but was derived from a single modality with limited guidance (Du et al., <xref ref-type="bibr" rid="B6">2016</xref>).</p>
<p>To address this problem, we propose a multi-modal subject similarity network as a new prior knowledge using the similarity network fusion (SNF) approach. In particular, we aim to build a subject similarity network that is supported by both brain imaging phenotype and genetic variants. Then, we will employ a discriminative SCCA model (Yan et al., <xref ref-type="bibr" rid="B32">2017</xref>) to identify a subset of SNPs and brain imaging ROIs that are not only highly correlated but also can best explain the shared similarity network. When applied to the real brain imaging (including amyloid and tau PET) and genetic data in the ADNI cohort, we found that SCCA guided by the fused similarity network showed similar performance as that guided by diagnosis information and both outperformed those guided by other prior knowledge. Taken together, our results suggested the value of a fused similarity network as a great alternative prior in case of the absence of diagnostic network, particularly when the study focuses only on one group (like the aging process of healthy older adults).</p></sec>
<sec id="s2">
<title>2. Data</title>
<p>Amyloid and tau PET imaging data, together with the imputed genotype data, were downloaded from the Alzheimer&#x00027;s disease Neuroimaging Initiative (ADNI) (<ext-link ext-link-type="uri" xlink:href="http://adni.loni.usc.edu/">http://adni.loni.usc.edu/</ext-link>) database. The ADNI was launched in 2003 as a public-private partnership, led by Principal Investigator Michael W. Weiner, MD. The primary goal of ADNI has been to test whether serial magnetic resonance imaging (MRI), positron emission tomography (PET), other biological markers, and clinical and neuropsychological assessments can be combined to measure the progression of mild cognitive impairment (MCI) and early Alzheimer&#x00027;s disease (AD). For up-to-date information, see <ext-link ext-link-type="uri" xlink:href="http://www.adni-info.org">www.adni-info.org</ext-link>. In this study, we have 800 subjects with both genotype data and amyloid imaging, including 158 cognitive normals (CN), 90 with significant memory concern (SMC), 279 early mild cognitive impairment (EMCI), 143 late MCI (LMCI), and 130 AD patients. For Tau, we have 291 subjects with both genotype data and tau imaging data, including 75 CN, 135 SMC, 30 EMCI, 32 LMCI, and 19 AD patients. The detailed demographic information of gender, age, and education years are shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Demographic information of ADNI image data.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:&#x00023;ffffff">
<th/>
<th valign="top" align="center"><bold>Subjects</bold></th>
<th valign="top" align="center"><bold>NC</bold></th>
<th valign="top" align="center"><bold>SMC</bold></th>
<th valign="top" align="center"><bold>EMCI</bold></th>
<th valign="top" align="center"><bold>LMCI</bold></th>
<th valign="top" align="center"><bold>AD</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Amyloid</td>
<td valign="top" align="center">Number</td>
<td valign="top" align="center">158</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">279</td>
<td valign="top" align="center">143</td>
<td valign="top" align="center">130</td>
</tr><tr>
<td/>
<td valign="top" align="center">Gender (M/F)</td>
<td valign="top" align="center">79/79</td>
<td valign="top" align="center">36/54</td>
<td valign="top" align="center">158/121</td>
<td valign="top" align="center">79/64</td>
<td valign="top" align="center">78/52</td>
</tr><tr>
<td/>
<td valign="top" align="center">Age (mean &#x000B1; SD)</td>
<td valign="top" align="center">73.25 &#x000B1; 6.05</td>
<td valign="top" align="center">71.62 &#x000B1; 5.45</td>
<td valign="top" align="center">71.05 &#x000B1; 7.27</td>
<td valign="top" align="center">71.41 &#x000B1; 7.49</td>
<td valign="top" align="center">73.95 &#x000B1; 8.03</td>
</tr><tr>
<td/>
<td valign="top" align="center">Educ (mean &#x000B1; SD)</td>
<td valign="top" align="center">16.62 &#x000B1; 2.50</td>
<td valign="top" align="center">16.79 &#x000B1; 2.62</td>
<td valign="top" align="center">16.09 &#x000B1; 2.66</td>
<td valign="top" align="center">16.71 &#x000B1; 2.51</td>
<td valign="top" align="center">15.72 &#x000B1; 2.69</td>
</tr><tr>
<td valign="top" align="left">TAU</td>
<td valign="top" align="center">Number</td>
<td valign="top" align="center">75</td>
<td valign="top" align="center">135</td>
<td valign="top" align="center">30</td>
<td valign="top" align="center">32</td>
<td valign="top" align="center">19</td>
</tr><tr>
<td/>
<td valign="top" align="center">Gender (M/F)</td>
<td valign="top" align="center">27/48</td>
<td valign="top" align="center">55/80</td>
<td valign="top" align="center">18/12</td>
<td valign="top" align="center">20/12</td>
<td valign="top" align="center">12/7</td>
</tr><tr>
<td/>
<td valign="top" align="center">Age (mean &#x000B1; SD)</td>
<td valign="top" align="center">69.25 &#x000B1; 5.40</td>
<td valign="top" align="center">70.96 &#x000B1; 6.15</td>
<td valign="top" align="center">70.2 &#x000B1; 7.23</td>
<td valign="top" align="center">71.97 &#x000B1; 8.64</td>
<td valign="top" align="center">73.42 &#x000B1; 10.80</td>
</tr>
<tr>
<td/>
<td valign="top" align="center">Edu (mean &#x000B1; SD)</td>
<td valign="top" align="center">17.12 &#x000B1; 2.14</td>
<td valign="top" align="center">16.84 &#x000B1; 2.21</td>
<td valign="top" align="center">16.03 &#x000B1; 2.68</td>
<td valign="top" align="center">15.94 &#x000B1; 2.23</td>
<td valign="top" align="center">16.16 &#x000B1; 2.75</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec>
<title>2.1. Imaging data preprocessing</title>
<p>Both amyloid and tau imaging data have been downloaded from the ADNI website as preprocessed. Briefly, amyloid PET used florbetapir (18F) as a tracer to measure amyloid-&#x003B2; (A&#x003B2;) plaques (Okamura and Yanai, <xref ref-type="bibr" rid="B18">2010</xref>). For each subject, brain regions of interest (ROIs) were defined from structural MRI through segmentation and parcellation using Freesurfer (Fischl, <xref ref-type="bibr" rid="B7">2012</xref>). Then, each florbetapir scan was coregistered to the corresponding MRI and calculated the mean florbetapir uptake within the predefined ROIs. All the regional amyloid deposition was re-normalized using the whole cerebellum as a reference region. Tau PET used flortaucipir as a tracer to detect the aggregated tau (Fleisher et al., <xref ref-type="bibr" rid="B8">2020</xref>), and the regional tau aggregation was obtained similarly as amyloid. All the regional tau tangle accumulation was re-normalized using inferior cerebellar as reference region. Finally, we have amyloid measurement in 68 cortical ROIs and tau measurement in 73 ROIs. More detailed image processing information can be found in Landau et al. (<xref ref-type="bibr" rid="B15">2013</xref>) and Landau et al. (<xref ref-type="bibr" rid="B14">2016</xref>). To remove potential bias, both amyloid and tau measures were pre-adjusted using baseline age, gender, and the weight derived from healthy controls. Finally, they were normalized to zero mean and unit variance for subsequent analysis.</p></sec>
<sec>
<title>2.2. Genotype data processing</title>
<p>Genotype data of both ADNI-1 and ADNI-2/GO phases were also obtained from the ADNI cohort (<ext-link ext-link-type="uri" xlink:href="http://adni.loni.usc.edu">adni.loni.usc.edu</ext-link>). We focused our analysis on top SNPs from the International Genomics of Alzheimer&#x00027;s Project (IGAP), a large-scale genome-wide association study of AD (Schellenberg and IGAP, <xref ref-type="bibr" rid="B23">2012</xref>). It tested the association of 7,055,881 single nucleotide polymorphisms (SNPs) of 17,008 Alzheimer&#x00027;s disease cases and 37,154 controls. SNPs with <italic>p</italic> &#x02264; 5 &#x000D7; 10<sup>&#x02212;6</sup> in their meta analysis were used as our candidates and their genotypes were extracted based on the quality controlled and imputed genetic data in the ADNI using PLINK (Purcell et al., <xref ref-type="bibr" rid="B22">2007</xref>). Finally, we have 1,080 SNPs for the subsequent imaging genetics association.</p></sec></sec>
<sec sec-type="methods" id="s3">
<title>3. Methods</title>
<p>To evaluate the proposed prior knowledge, we apply it to amyloid and tau imaging and genetic data in the study of Alzheimer&#x00027;s disease (AD). Deposition of amyloid-&#x003B2; and abnormal accumulations of tau protein are two major hallmarks in AD pathogenesis. Prior knowledge tested in this analysis for comparison include (1) subject diagnosis information, (2) brain co-expression network using amyloid- and tau-related genes, respectively (Zeng et al., <xref ref-type="bibr" rid="B33">2012</xref>), and (3) fused similarity network built on imaging and genetics data.</p>
<sec>
<title>3.1. Fused similarity network</title>
<p>In this study, we proposed to use a fused similarity network as a new prior knowledge, as inspired by Wang et al. (<xref ref-type="bibr" rid="B28">2014</xref>) and hypothesize that it will help improve the performance of imaging genetics association. First, we have original SNP data and imaging data showed in <xref ref-type="fig" rid="F1">Figure 1A</xref>, we build a sample-sample similarity matrix for imaging and genetic data, respectively (<xref ref-type="fig" rid="F1">Figure 1B</xref>) and their subject similarity network look like in <xref ref-type="fig" rid="F1">Figure 1C</xref>. This similarity matrix can be seen as a similarity network G = (V,E,W), where nodes V represent subjects {<italic><bold>x</bold></italic><sub>1</sub>, <italic><bold>x</bold></italic><sub>2</sub>, ..., <italic><bold>x</bold></italic><sub><italic>n</italic></sub>}, the weighted edges <italic>E</italic> represent similarities of a subject to others and W is a <italic>n</italic> &#x000D7; <italic>n</italic> similarity weighted matrix representing the similarity between subjects <italic><bold>x</bold></italic><sub><italic>i</italic></sub> and <italic><bold>x</bold></italic><sub><italic>j</italic></sub>. Suppose &#x003C1; (<italic><bold>x</bold></italic><sub><italic>i</italic></sub>,<italic><bold>x</bold></italic><sub><italic>j</italic></sub>) is euclidean distance between subjects <italic><bold>x</bold></italic><sub><italic>i</italic></sub> and <italic><bold>x</bold></italic><sub><italic>j</italic></sub>. Then a scaled exponential similarity kernel was used to determine the weight of the edge:
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo class="qopname">exp</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C1;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>&#x003BC;</mml:mi><mml:msub><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where &#x003BC; is a hyper parameter that can be empirically set. It was recommended from [0.3, 0.8], and we set it as 0.5 by default (Wang et al., <xref ref-type="bibr" rid="B28">2014</xref>). and &#x003B5;<sub><italic>i, j</italic></sub> is used to eliminate the scaling problem. Here we define:
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo class="qopname">mean</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C1;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mo class="qopname">mean</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C1;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003C1;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <italic>N</italic><sub><italic>i</italic></sub> denote a set of <italic>x</italic><sub><italic>i</italic></sub>&#x00027;s neighbors including <italic>x</italic><sub><italic>i</italic></sub> in <italic>G</italic>, and &#x003C1;(<italic>x</italic><sub><italic>i</italic></sub>, <italic>N</italic><sub><italic>i</italic></sub>) is the average value of the distance between <italic>x</italic><sub><italic>i</italic></sub> and each of its neighbors. Each row of <bold>W</bold> was then normalized as below:
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mo>&#x003A3;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
Given a graph <italic>G</italic>, we use <italic>K</italic> nearest neighbors (KNN) to measure local affinity as:
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle mathvariant="bold"><mml:mtext>S</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x003A3;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>j</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mtext>otherwise</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p><bold>P</bold> offers the similarity information of each subject to all others and <bold>S</bold> encodes the similarity to the <bold>K</bold> most similar neighbors for each subject. In this article, we have two types of data, genomics data and imaging data. We first calculated the status matrices <italic>P</italic><sup>(1)</sup> and <italic>P</italic><sup>(2)</sup> following equation (3), and then the kernel matrices <italic>S</italic><sup>(1)</sup> and <italic>S</italic><sup>(2)</sup> following in equation (4). For both amyloid and tau data, we tested the model performance with varying <italic>K</italic> values from 5 to 50. Association performance was found highly stable across varying <italic>K</italic> values, therefore we set <italic>K</italic> = 20 as default.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Workflow of similarity network fusion. <bold>(A)</bold> Original SNP data and imaging data. <bold>(B)</bold> Subject similarity matrix generated using normalized mutual information (NMI). <bold>(C)</bold> Subject similarity network (equivalent to the subject by subject matrix). <bold>(D)</bold> Fused network by integrating information from both imaging and genotype data.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-06-1151893-g0001.tif"/>
</fig>
<p>Next, we performed the network fusion of two kernel matrices using a message-passing theory (Pearl, <xref ref-type="bibr" rid="B20">1988</xref>) non-linear method. This is an iterative process where both networks keep getting updated until they converge (i.e., not change much). The final network, known as the fused network, is expected to represent the subject relationships supported by both brain image data and genotype data. Let <inline-formula><mml:math id="M5"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula><mml:math id="M6"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> be the initial two status matrices when <italic>t</italic> = 0. The fusion process will iteratively update two similarity matrices corresponding to two data types as follows:
<disp-formula id="E5"><label>(5)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x000D7;</mml:mo><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E6"><label>(6)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x000D7;</mml:mo><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M10"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> are the status matrix of these two data types after t iterations. After each iteration, we performed normalization on <inline-formula><mml:math id="M11"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M12"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> as in equation (3). This step ensures that subject self-similarity is always higher than the similarity to other neighbors. Here, the alternating multiplication of the squared KNN similarity of the two modalities essentially combines the local information of the two modalities in a way that reinforces their shared information. By multiplying the initial similarity matrix of one modality with the squared KNN similarity matrix of the other modality, the shared information between the two modalities is amplified and the unique information in each modality is retained. This process is then repeated in an alternating manner to ensure that both modalities contribute equally to the final similarity matrix, thereby achieving a balanced fusion of the two modalities (The fused network as showed in <xref ref-type="fig" rid="F1">Figure 1D</xref>). This approach is expected to result in a more informative similarity matrix that captures the shared and unique features of both modalities, which in turn can improve the performance of downstream analysis such as association identification between brain imaging and genetic features.</p></sec>
<sec>
<title>3.2. Prior knowledge for comparison</title>
<sec>
<title>3.2.1. Diagnosis network</title>
<p>A similarity matrix based on diagnosis was built by assigning 1 s between samples in the same diagnosis and 0 s otherwise. In other words, we build a complete graph for all the subjects belonging to the same diagnosis group. To ensure &#x003A3;<sub><italic>j</italic></sub><bold>P</bold>(<italic>i, j</italic>) &#x0003D; 1, it was then normalized by setting the diagonal entries as 0.5, and other elements as 0.5 divided by the group size.
<disp-formula id="E7"><label>(7)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle mathvariant="bold"><mml:mtext>P</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x000B7;</mml:mo><mml:mi>L</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>G</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <italic>Length</italic>(<italic>Group</italic>(<italic>k</italic>)) means the size of diagnosis group, and there are totally five groups in this article.</p></sec>
<sec>
<title>3.2.2. Brain co-expression network</title>
<p>We use amyloid as an example to demonstrate the co-expression network construction process. We first identified 15 genes related to amyloid pathways according to previous studies (Swaminathan et al., <xref ref-type="bibr" rid="B26">2012</xref>). We then extracted the expression level of these genes across 1,210 brain samples in the Allen Human Brain Atlas (AHBA) database. A partial correlation analysis was performed on the brain expression data, and generated a 1, 210 &#x000D7; 1,210 matrix indicating the ROI&#x02013;ROI similarity based on the expression of selected genes. This matrix was later down-sampled to 68 &#x000D7; 68, where all 1,210 brain samples were mapped to amyloid ROIs and the median value was applied to aggregate the similarity measures. For tau, there are eight genes found involved in tau phosphorylation pathway (Bekris et al., <xref ref-type="bibr" rid="B2">2012</xref>). We went through the same process and generated a 73 &#x000D7; 73 co-expression matrix for tau. These two matrices were used as the prior knowledge in subsequent analysis.</p></sec></sec>
<sec>
<title>3.3. Discriminative SCCA</title>
<p>In this part, let <inline-formula><mml:math id="M14"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>x</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>x</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>x</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>&#x02286;</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>R</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> be the imaging data and <inline-formula><mml:math id="M15"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>y</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>y</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>y</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>&#x02286;</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>R</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> be the genotype data, where n is the number of patients, <italic>p</italic> and <italic>q</italic> are the numbers of ROIs and SNPs, respectively. Sparse canonical correlation analysis (SCCA) aims to find the maximal correlation between <italic>Xu</italic> and <italic>Yv</italic> by adjusting these two weights, u and v, which indicates the significance of each feature of the imaging genetic associations. As shown in this formula:
<disp-formula id="E8"><label>(8)</label><mml:math id="M16"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">max</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x02003;</mml:mtext><mml:mstyle class="mbox"><mml:mtext>s</mml:mtext></mml:mstyle><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>P</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>c</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>P</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <italic><bold>P</bold></italic><sub>1</sub>(<italic>u</italic>) &#x02264; <italic>c</italic>1<italic>and</italic><italic><bold>P</bold></italic><sub>2</sub>(<italic>v</italic>) &#x02264; <italic>c</italic>2 are two penalty terms to control the sparsity of selected features. In this study, we used the PMA package (Witten et al., <xref ref-type="bibr" rid="B30">2009</xref>) that applied the <italic>L</italic><sub>1</sub> norm penalty for <italic>P</italic><sub>1</sub> and <italic>P</italic><sub>2</sub> constraints to perform the SCCA method. To ensure the selection of disease-relevant features, we used a novel discriminative SCCA (DSCCA) algorithm (Yan et al., <xref ref-type="bibr" rid="B32">2017</xref>) to integrate imaging data, SNPs data and the prior knowledge for imaging genetics association. Prior knowledge can be diagnosis network, fusion network or ROI&#x02013;ROI co-expression network. As such, we can not only identify disease-relevant multi-modal biomarkers, but also reveal a strong association between them. Finally, we compare the performance of multiple DSCCA models guided by different prior knowledge.</p>
<p>For the original DSCCA algorithm, there are two constraints, <italic>P</italic><sub>1</sub> and <italic>P</italic><sub>2</sub>, which are added for the multi-class discrimination, inspired by the application of locality preserving projection (LPP) in linear discriminative analysis (Ghamisi et al., <xref ref-type="bibr" rid="B9">2018</xref>).
<disp-formula id="E9"><label>(9)</label><mml:math id="M17"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>L</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>L</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
Here, <italic>L</italic><sub><italic>w</italic></sub> is the Laplacian graphs of prior knowledge graph.</p>
<p>The final objective function of DSCCA can be written as follows:
<disp-formula id="E10"><label>(10)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">max</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02264;</mml:mo><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02264;</mml:mo><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
Using Lagrange multipliers, Equation (10) can be reformulated as follows:
<disp-formula id="E11"><label>(11)</label><mml:math id="M19"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">max</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B3;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msubsup><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B3;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msubsup><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
Equation (11) is known as a bi-convex problem, which can be solved using an alternating algorithm as discussed in Witten et al. (<xref ref-type="bibr" rid="B30">2009</xref>). By fixing <italic>u</italic> and <italic>v</italic>, respectively, we will have the following two minimization problems shown in Equations (12) and (13).
<disp-formula id="E13"><label>(12)</label><mml:math id="M21"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B3;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E14"><label>(13)</label><mml:math id="M22"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>u</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>X</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B3;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>Y</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>v</mml:mtext></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
We used the Nesterovs accelerated proximal gradient optimization algorithm to solve this objective function following original DSCCA paper (Liu et al., <xref ref-type="bibr" rid="B17">2012</xref>; Yan et al., <xref ref-type="bibr" rid="B32">2017</xref>). The convergence is based on the value changes of the objective function and we use 10<sup>&#x02212;6</sup> as stop criteria. A five-fold nested cross-validation was applied to automatically tune the parameters <italic><bold>&#x003B2;</bold></italic><sub>1</sub>, <italic><bold>&#x003B2;</bold></italic><sub>2</sub>, <italic><bold>&#x003BB;</bold></italic><sub>1</sub>, and <italic><bold>&#x003BB;</bold></italic><sub>2</sub>. According to Chen et al. (<xref ref-type="bibr" rid="B4">2012</xref>), the learned pattern and performance are insensitive to <italic><bold>&#x003B3;</bold></italic><sub>1</sub> and <italic><bold>&#x003B3;</bold></italic><sub>2</sub> settings. Therefore, in this article, we set both of them to 1 for simplicity.</p></sec></sec>
<sec sec-type="results" id="s4">
<title>4. Results</title>
<p>To test the effect of different prior knowledge on the performance of imaging genetics association, we performed four groups of experiments including the DSCCA algorithm with different prior knowledge (fusion network, diagnosis network, and ROI&#x02013;ROI network) and the simple SCCA method as the baseline. For SCCA, the parameters were automatically tuned using a permutation method provided in the PMA package. For DSCCA algorithm, we applied a five-fold nested cross-validation to tune the parameters that can also help avoid the overfitting problem. For a fair comparison, the training/test partition was kept exactly the same across methods and ratios of diagnosis groups inside each partition are also identical. All methods went through the same nested cross-validation for parameter tuning.</p>
<sec>
<title>4.1. Imaging genetic associations for AV45</title>
<p>We first tested the association between brain-wide amyloid deposition and top AD-risk SNPs. The performance of test data including the DSCCA algorithm with fused network, diagnosis network, co-expression network as prior knowledge, and the original SCCA method are shown in <xref ref-type="table" rid="T2">Table 2</xref>. As expected, DSCCA algorithms with the guidance of prior knowledge all outperformed traditional SCCA, confirming that prior knowledge does help reveal stronger brain imaging genetics associations. More specifically, out of all three types of prior, fused network and diagnosis network led to similar association performance, which is much better than the co-expression network.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Test performance of brain imaging genetics association on AV45.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold>Prior knowledge</bold></th>
<th valign="top" align="center" colspan="6"><bold>Testing results</bold></th>
</tr>
<tr style="background-color:#919498;">
<th/>
<th valign="top" align="center"><bold>Fold 1</bold></th>
<th valign="top" align="center"><bold>Fold 2</bold></th>
<th valign="top" align="center"><bold>Fold 3</bold></th>
<th valign="top" align="center"><bold>Fold 4</bold></th>
<th valign="top" align="center"><bold>Fold 5</bold></th>
<th valign="top" align="center"><bold>Average</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><bold>Fused network</bold></td>
<td valign="top" align="center"><bold>0.4872</bold></td>
<td valign="top" align="center"><bold>0.5844</bold></td>
<td valign="top" align="center"><bold>0.5959</bold></td>
<td valign="top" align="center"><bold>0.5586</bold></td>
<td valign="top" align="center"><bold>0.5043</bold></td>
<td valign="top" align="center"><bold>0.5461</bold></td>
</tr><tr>
<td valign="top" align="left">Diagnosis network</td>
<td valign="top" align="center">0.4863</td>
<td valign="top" align="center">0.5848</td>
<td valign="top" align="center">0.5919</td>
<td valign="top" align="center">0.5655</td>
<td valign="top" align="center">0.4945</td>
<td valign="top" align="center">0.5446</td>
</tr><tr>
<td valign="top" align="left">Co-expression network</td>
<td valign="top" align="center">0.3486</td>
<td valign="top" align="center">0.4401</td>
<td valign="top" align="center">0.4185</td>
<td valign="top" align="center">0.4203</td>
<td valign="top" align="center">0.37</td>
<td valign="top" align="center">0.3995</td>
</tr>
<tr>
<td valign="top" align="left">SCCA (no prior)</td>
<td valign="top" align="center">0.2838</td>
<td valign="top" align="center">0.4041</td>
<td valign="top" align="center">0.4015</td>
<td valign="top" align="center">0.3588</td>
<td valign="top" align="center">0.3865</td>
<td valign="top" align="center">0.367</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values denote the best performance.</p>
</table-wrap-foot>
</table-wrap>
<p>For all ROIs and SNPs, we averaged their weights across five-folds for feature selection. <xref ref-type="fig" rid="F2">Figure 2</xref> shows the top 10 ROIs selected by DSCCA guided by the fused network, including left precentral, right parahippocampal, right rostral middle frontal, right precentral, right bankssts, left rostral anterior gingulate, right caudal middle frontal, left postcentral, right postcentral, and left parstriangularis. Among these, right bankssts, right caudal middle frontal, parstriangularis, and left rostral anterior gingulate are part of the default mode network (DMN), and right rostral middle frontal is part of the frontoparietal network. Both of them have consistently shown early accumulation of cortical A&#x003B2; fibrils in previous studies (Palmqvist et al., <xref ref-type="bibr" rid="B19">2017</xref>). Amyloid deposition of these regions is strongly associated with only one SNP, <italic>APOE SNP (rs429358)</italic>, which is known as the major risk factor for Alzheimer&#x00027;s disease. There are strong evidences suggesting that <italic>APOE</italic> could inhibit amyloid-&#x003B2; (A&#x003B2;) clearance and promote A&#x003B2; aggregation to increase AD risk (Polvikoski et al., <xref ref-type="bibr" rid="B21">1995</xref>; Kim et al., <xref ref-type="bibr" rid="B11">2009</xref>; Kok et al., <xref ref-type="bibr" rid="B12">2009</xref>; Wirths, <xref ref-type="bibr" rid="B29">2010</xref>).</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Top 10 brain regions with amyloid deposition associated with <italic>APOE SNP rs429358</italic>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-06-1151893-g0002.tif"/>
</fig></sec>
<sec>
<title>4.2. Imaging genetic associations for tau</title>
<p>We next tested the association between brain-wide tau deposition and top AD risk SNPs. The performance on test data across all the methods is shown in <xref ref-type="table" rid="T3">Table 3</xref>. Similar to amyloid, DSCCA guided by three types of prior knowledge performed significantly better than SCCA. Also, all tree DSCCA models showed very similar performance. Considering that the co-expression network only showed moderate performance in amyloid data, we speculate that the selection of candidate genes has a major effect on the prior co-expression network and later lead to the fluctuation of association performance.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Tau 5-fold cross-validation results.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:#919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold>Prior knowledge</bold></th>
<th valign="top" align="center" colspan="6"><bold>Testing results</bold></th>
</tr>
<tr style="background-color:#919498;">
<th/>
<th valign="top" align="center"><bold>Fold 1</bold></th>
<th valign="top" align="center"><bold>Fold 2</bold></th>
<th valign="top" align="center"><bold>Fold 3</bold></th>
<th valign="top" align="center"><bold>Fold 4</bold></th>
<th valign="top" align="center"><bold>Fold 5</bold></th>
<th valign="top" align="center"><bold>Average</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><bold>Fused network</bold></td>
<td valign="top" align="center"><bold>0.4186</bold></td>
<td valign="top" align="center"><bold>0.3948</bold></td>
<td valign="top" align="center"><bold>0.4882</bold></td>
<td valign="top" align="center"><bold>0.1725</bold></td>
<td valign="top" align="center"><bold>0.5443</bold></td>
<td valign="top" align="center"><bold>0.4025</bold></td>
</tr><tr>
<td valign="top" align="left">Diagnosis network</td>
<td valign="top" align="center">0.4237</td>
<td valign="top" align="center">0.3786</td>
<td valign="top" align="center">0.4809</td>
<td valign="top" align="center">0.1722</td>
<td valign="top" align="center">0.5458</td>
<td valign="top" align="center">0.4002</td>
</tr><tr>
<td valign="top" align="left">Co-expression network</td>
<td valign="top" align="center">0.4251</td>
<td valign="top" align="center">0.4246</td>
<td valign="top" align="center">0.4785</td>
<td valign="top" align="center">0.1775</td>
<td valign="top" align="center">0.5424</td>
<td valign="top" align="center">0.4096</td>
</tr>
<tr>
<td valign="top" align="left">SCCA (no prior)</td>
<td valign="top" align="center">0.3084</td>
<td valign="top" align="center">0.2674</td>
<td valign="top" align="center">0.321</td>
<td valign="top" align="center">0.1491</td>
<td valign="top" align="center">0.581</td>
<td valign="top" align="center">0.3254</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>Bold values denote the best performance.</p>
</table-wrap-foot>
</table-wrap>
<p>After averaging the weight across 5-folds, we found the tau deposition in the left and right amygdala are strongly associated with 56 SNPs (<xref ref-type="fig" rid="F3">Figure 3</xref>). Amygdala is one of the earliest sites showing tau deposition and neurofibrillary tangles, as reported in previous post-mortem and neuroimaging studies (Vogt et al., <xref ref-type="bibr" rid="B27">1990</xref>; Abiose et al., <xref ref-type="bibr" rid="B1">2020</xref>; Insel et al., <xref ref-type="bibr" rid="B10">2020</xref>). Early tau position in Amygdala is associated with reduced volume and worse cognition performance as well in the preclinical stage of AD (Abiose et al., <xref ref-type="bibr" rid="B1">2020</xref>; Berron et al., <xref ref-type="bibr" rid="B3">2021</xref>). Selected 56 SNPs associating with the amygdala tau deposition are located in or near genes <italic>TOMM40, AC011481.3, NECTIN2, APOC1, AC011481.2, AC015687.1, CLU</italic>. <italic>TOMM40</italic> poly-T lengths have a significant relationship with the higher medial temporal plaque and tangle burden in the living brain of non-demented older adults within individuals not carrying the <italic>APOE</italic>-4 allele (Siddarth et al., <xref ref-type="bibr" rid="B25">2018</xref>). We further performed pathway enrichment analysis of these genes using EnrichR (Kuleshov et al., <xref ref-type="bibr" rid="B13">2016</xref>). Top enriched biological process in gene ontology include regulation of receptor-mediated endocytosis (adjusted <italic>p</italic> &#x0003D; 0.01) and cholesterol transport (adjusted <italic>p</italic> &#x0003D; 0.01).</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Top tau brain regions selected by DSCCA guided by fused network.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-06-1151893-g0003.tif"/>
</fig></sec></sec>
<sec sec-type="discussion" id="s5">
<title>5. Discussion</title>
<p>We proposed a new data-driven prior knowledge and tested whether it could help improve the performance of association between brain imaging and genetic features. Our result confirmed the value of all types of prior knowledge in improving association identification. In addition, the fused network representing the subject relationship supported by multi-modal data showed consistently the best or equally best performance compared to the diagnosis network and the co-expression network. By incorporating information from multiple modalities, the fused network more accurately captures the similarity of subjects in disease severity. With the guidance of such a network, it is more likely to reveal the imaging genetic associations related to AD. Co-expression network showed moderate performance in amyloid but was among the top performers in Tau, suggesting the potential effect of gene selection. The construction of the co-expression network relies on a careful selection of gene set that is specific to certain aspects of AD. While our knowledge of the biological mechanism underlying AD is still very limited, there is no optimal strategy to select relevant genes and different selection processes may lead to varying performance in association. Therefore, the value of co-expression network as prior is compromised. Finally, considering fused network and diagnosis network consistently demonstrated similarly good performance, fused network can be valuable prior knowledge to leverage when there is no diagnosis information or in case of studies using a single diagnosis group, e.g., control only or case only.</p></sec>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p></sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>BH: conceptualization, methodology, visualization, formal analysis, validation, writing&#x02014;original draft, and writing&#x02014;review and editing. LX: investigation, visualization, and formal analysis. PV: conceptualization and visualization. KN: data curation and writing&#x02014;review and editing. SR: methodology, supervision, and writing&#x02014;review and editing. AS: data curation, resource, and writing&#x02014;review and editing. JY: conceptualization, methodology, visualization, writing&#x02014;original draft, writing&#x02014;review and editing, supervision, and funding acquisition. All authors contributed to the article and approved the submitted version.</p></sec>
</body>
<back>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>This research was supported by the National Institutes of Health (grants R01 LM013463, R21 AG066135, R21 AG072101, R01 EB022574, R01 AG019771, and P30 AG010133) and the National Science Foundation (grants CRII 1755836 and CAREER 1942394).</p>
</sec>
<ack><p>Data collection and sharing for this project was funded by the Alzheimer&#x00027;s Disease Neuroimaging Initiative (ADNI) (National Institutes of Health Grant U01 AG024904) and DOD ADNI (Department of Defense award number W81XWH-12-2-0012). ADNI is funded by the National Institute on Aging, the National Institute of Biomedical Imaging and Bioengineering, and through generous contributions from the following: AbbVie, Alzheimer&#x00027;s Association; Alzheimer&#x00027;s Drug Discovery Foundation; Araclon Biotech; BioClinica, Inc.; Biogen; Bristol-Myers Squibb Company; CereSpir, Inc.; Cogstate; Eisai Inc.; Elan Pharmaceuticals, Inc.; Eli Lilly and Company; EuroImmun; F. Hoffmann-La Roche Ltd. and its affiliated company Genentech, Inc.; Fujirebio; GE Healthcare; IXICO Ltd.; Janssen Alzheimer Immunotherapy Research &#x00026; Development, LLC.; Johnson &#x00026; Johnson Pharmaceutical Research &#x00026; Development LLC.; Lumosity; Lundbeck; Merck &#x00026; Co., Inc.; Meso Scale Diagnostics, LLC.; NeuroRx Research; Neurotrack Technologies; Novartis Pharmaceuticals Corporation; Pfizer Inc.; Piramal Imaging; Servier; Takeda Pharmaceutical Company; and Transition Therapeutics. The Canadian Institutes of Health Research is providing funds to support ADNI clinical sites in Canada. Private sector contributions are facilitated by the Foundation for the National Institutes of Health (<ext-link ext-link-type="uri" xlink:href="http://www.fnih.org">www.fnih.org</ext-link>). The grantee organization is the Northern California Institute for Research and Education, and the study is coordinated by the Alzheimer&#x00027;s Therapeutic Research Institute at the University of Southern California. ADNI data are disseminated by the Laboratory for Neuro Imaging at the University of Southern California.</p>
</ack>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abiose</surname> <given-names>O.</given-names></name> <name><surname>Deters</surname> <given-names>K. D.</given-names></name> <name><surname>Young</surname> <given-names>C.</given-names></name> <name><surname>Mormino</surname> <given-names>E. C.</given-names></name></person-group> (<year>2020</year>). <article-title>Amygdala tau in preclinical Alzheimer&#x00027;s disease: neuroimaging/normal brain aging</article-title>. <source>Alzheimers Dement</source>. <volume>16</volume>, <fpage>e046762</fpage>. <pub-id pub-id-type="doi">10.1002/alz.046762</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bekris</surname> <given-names>L. M.</given-names></name> <name><surname>Millard</surname> <given-names>S.</given-names></name> <name><surname>Lutz</surname> <given-names>F.</given-names></name> <name><surname>Li</surname> <given-names>G.</given-names></name> <name><surname>Galasko</surname> <given-names>D. R.</given-names></name> <name><surname>Farlow</surname> <given-names>M. R.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Tau phosphorylation pathway genes and cerebrospinal fluid tau levels in alzheimer&#x00027;s disease</article-title>. <source>Am. J. Med. Genet. B Neuropsychiatr. Genet</source>. <volume>159</volume>, <fpage>874</fpage>&#x02013;<lpage>883</lpage>. <pub-id pub-id-type="doi">10.1002/ajmg.b.32094</pub-id><pub-id pub-id-type="pmid">22927204</pub-id></citation></ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Berron</surname> <given-names>D.</given-names></name> <name><surname>Vogel</surname> <given-names>J. W.</given-names></name> <name><surname>Insel</surname> <given-names>P. S.</given-names></name> <name><surname>Pereira</surname> <given-names>J. B.</given-names></name> <name><surname>Xie</surname> <given-names>L.</given-names></name> <name><surname>Wisse</surname> <given-names>L. E.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Early stages of tau pathology and its associations with functional connectivity, atrophy and memory</article-title>. <source>Brain</source> <volume>144</volume>, <fpage>2771</fpage>&#x02013;<lpage>2783</lpage>. <pub-id pub-id-type="doi">10.1093/brain/awab114</pub-id><pub-id pub-id-type="pmid">33725124</pub-id></citation></ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>X.</given-names></name> <name><surname>Han</surname> <given-names>L.</given-names></name> <name><surname>Carbonell</surname> <given-names>J.</given-names></name></person-group> (<year>2012</year>). <article-title>Structured sparse canonical correlation analysis</article-title>, in <source>Artificial Intelligence and Statistics</source>. <volume>PMLR</volume>, <fpage>199</fpage>&#x02013;<lpage>207</lpage>.</citation></ref>
<ref id="B5">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Chi</surname> <given-names>E. C.</given-names></name> <name><surname>Allen</surname> <given-names>G. I.</given-names></name> <name><surname>Zhou</surname> <given-names>H.</given-names></name> <name><surname>Kohannim</surname> <given-names>O.</given-names></name> <name><surname>Lange</surname> <given-names>K.</given-names></name> <name><surname>Thompson</surname> <given-names>P. M.</given-names></name> <etal/></person-group>. (<year>2013</year>). <article-title>Imaging genetics via sparse canonical correlation analysis</article-title>, in <source>2013 IEEE 10th International Symposium on Biomedical Imaging</source> (<publisher-loc>San Francisco, CA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>740</fpage>&#x02013;<lpage>743</lpage>. <pub-id pub-id-type="doi">10.1109/ISBI.2013.6556581</pub-id><pub-id pub-id-type="pmid">31844486</pub-id></citation></ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Du</surname> <given-names>L.</given-names></name> <name><surname>Huang</surname> <given-names>H.</given-names></name> <name><surname>Yan</surname> <given-names>J.</given-names></name> <name><surname>Kim</surname> <given-names>S.</given-names></name> <name><surname>Risacher</surname> <given-names>S. L.</given-names></name> <name><surname>Inlow</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Structured sparse canonical correlation analysis for brain imaging genetics: an improved graphnet method</article-title>. <source>Bioinformatics</source> <volume>32</volume>, <fpage>1544</fpage>&#x02013;<lpage>1551</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btw033</pub-id><pub-id pub-id-type="pmid">26801960</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fischl</surname> <given-names>B.</given-names></name></person-group> (<year>2012</year>). <article-title>Freesurfer</article-title>. <source>Neuroimage</source> <volume>62</volume>, <fpage>774</fpage>&#x02013;<lpage>781</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2012.01.021</pub-id><pub-id pub-id-type="pmid">22248573</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fleisher</surname> <given-names>A. S.</given-names></name> <name><surname>Pontecorvo</surname> <given-names>M. J.</given-names></name> <name><surname>Devous</surname> <given-names>M. D.</given-names></name> <name><surname>Lu</surname> <given-names>M.</given-names></name> <name><surname>Arora</surname> <given-names>A. K.</given-names></name> <name><surname>Truocchio</surname> <given-names>S. P.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Positron emission tomography imaging with [18f] flortaucipir and postmortem assessment of alzheimer disease neuropathologic changes</article-title>. <source>JAMA Neurol</source>. <volume>77</volume>, <fpage>829</fpage>&#x02013;<lpage>839</lpage>. <pub-id pub-id-type="doi">10.1001/jamaneurol.2020.0528</pub-id><pub-id pub-id-type="pmid">32338734</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ghamisi</surname> <given-names>P.</given-names></name> <name><surname>Maggiori</surname> <given-names>E.</given-names></name> <name><surname>Li</surname> <given-names>S.</given-names></name> <name><surname>Souza</surname> <given-names>R.</given-names></name> <name><surname>Tarablaka</surname> <given-names>Y.</given-names></name> <name><surname>Moser</surname> <given-names>G.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>New frontiers in spectral-spatial hyperspectral image classification: the latest advances based on mathematical morphology, markov random fields, segmentation, sparse representation, and deep learning</article-title>. <source>IEEE Geosci. Remote Sens. Mag</source>. <volume>6</volume>, <fpage>10</fpage>&#x02013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1109/MGRS.2018.2854840</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Insel</surname> <given-names>P. S.</given-names></name> <name><surname>Mormino</surname> <given-names>E. C.</given-names></name> <name><surname>Aisen</surname> <given-names>P. S.</given-names></name> <name><surname>Thompson</surname> <given-names>W. K.</given-names></name> <name><surname>Donohue</surname> <given-names>M. C.</given-names></name></person-group> (<year>2020</year>). <article-title>Neuroanatomical spread of amyloid &#x003B2; and tau in Alzheimer&#x00027;s disease: implications for primary prevention</article-title>. <source>Brain Commun</source>. <volume>2</volume>, <fpage>fcaa007</fpage>. <pub-id pub-id-type="doi">10.1093/braincomms/fcaa007</pub-id><pub-id pub-id-type="pmid">32140682</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kim</surname> <given-names>J.</given-names></name> <name><surname>Basak</surname> <given-names>J. M.</given-names></name> <name><surname>Holtzman</surname> <given-names>D. M.</given-names></name></person-group> (<year>2009</year>). <article-title>The role of apolipoprotein e in Alzheimer&#x00027;s disease</article-title>. <source>Neuron</source> <volume>63</volume>, <fpage>287</fpage>&#x02013;<lpage>303</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2009.06.026</pub-id><pub-id pub-id-type="pmid">19679070</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kok</surname> <given-names>E.</given-names></name> <name><surname>Haikonen</surname> <given-names>S.</given-names></name> <name><surname>Luoto</surname> <given-names>T.</given-names></name> <name><surname>Huhtala</surname> <given-names>H.</given-names></name> <name><surname>Goebeler</surname> <given-names>S.</given-names></name> <name><surname>Haapasalo</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2009</year>). <article-title>Apolipoprotein e-dependent accumulation of alzheimer disease-related lesions begins in middle age</article-title>. <source>Ann. Neurol</source>. <volume>65</volume>, <fpage>650</fpage>&#x02013;<lpage>657</lpage>. <pub-id pub-id-type="doi">10.1002/ana.21696</pub-id><pub-id pub-id-type="pmid">19557866</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kuleshov</surname> <given-names>M. V.</given-names></name> <name><surname>Jones</surname> <given-names>M. R.</given-names></name> <name><surname>Rouillard</surname> <given-names>A. D.</given-names></name> <name><surname>Fernandez</surname> <given-names>N. F.</given-names></name> <name><surname>Duan</surname> <given-names>Q.</given-names></name> <name><surname>Wang</surname> <given-names>Z.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Enrichr: a comprehensive gene set enrichment analysis web server 2016 update</article-title>. <source>Nucleic Acids Res</source>. <volume>44</volume>, <fpage>W90</fpage>&#x00027;<lpage>W97</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkw377</pub-id><pub-id pub-id-type="pmid">27141961</pub-id></citation></ref>
<ref id="B14">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Landau</surname> <given-names>S.</given-names></name> <name><surname>Ward</surname> <given-names>T. J.</given-names></name> <name><surname>Murphy</surname> <given-names>A.</given-names></name> <name><surname>Jagust</surname> <given-names>W.</given-names></name></person-group> (<year>2016</year>). <source>Flortaucipir (AV-1451) Processing Methods. Alzheimer&#x00027;s Disease Neuroimaging Initiative</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://adni.bitbucket.io/reference/docs/UCBERKELEYAV1451/UCBERKELEY_AV1451_Methods_2021-01-14.pdf">https://adni.bitbucket.io/reference/docs/UCBERKELEYAV1451/UCBERKELEY_AV1451_Methods_2021-01-14.pdf</ext-link></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Landau</surname> <given-names>S. M.</given-names></name> <name><surname>Breault</surname> <given-names>C.</given-names></name> <name><surname>Joshi</surname> <given-names>A. D.</given-names></name> <name><surname>Pontecorvo</surname> <given-names>M.</given-names></name> <name><surname>Mathis</surname> <given-names>C. A.</given-names></name> <name><surname>Jagust</surname> <given-names>W. J.</given-names></name> <etal/></person-group>. (<year>2013</year>). <article-title>Amyloid-&#x003B2; imaging with Pittsburgh compound b and florbetapir: comparing radiotracers and quantification methods</article-title>. <source>J. Nucl. Med</source>. <volume>54</volume>, <fpage>70</fpage>&#x02013;<lpage>77</lpage>. <pub-id pub-id-type="doi">10.2967/jnumed.112.109009</pub-id><pub-id pub-id-type="pmid">23166389</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>D.</given-names></name> <name><surname>Cao</surname> <given-names>H.</given-names></name> <name><surname>Calhoun</surname> <given-names>V. D.</given-names></name> <name><surname>Wang</surname> <given-names>Y.-P.</given-names></name></person-group> (<year>2014</year>). <article-title>Sparse models for correlative and integrative analysis of imaging and genetic data</article-title>. <source>J. Neurosci. Methods</source> <volume>237</volume>, <fpage>69</fpage>&#x02013;<lpage>78</lpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2014.09.001</pub-id><pub-id pub-id-type="pmid">25218561</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Ji</surname> <given-names>S.</given-names></name> <name><surname>Ye</surname> <given-names>J.</given-names></name></person-group> (<year>2012</year>). <article-title>Multi-task feature learning via efficient l2, 1-norm minimization</article-title>. <source>arXiv</source>. [preprint]. <volume>2009</volume>, <fpage>339</fpage>&#x02013;<lpage>348</lpage>. <pub-id pub-id-type="doi">10.48550/arXiv.1205.2631</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Okamura</surname> <given-names>N.</given-names></name> <name><surname>Yanai</surname> <given-names>K.</given-names></name></person-group> (<year>2010</year>). <article-title>Florbetapir (18f), a pet imaging agent that binds to amyloid plaques for the potential detection of Alzheimer&#x00027;s disease</article-title>. <source>IDrugs</source> <volume>13</volume>, <fpage>890</fpage>&#x02013;<lpage>899</lpage>. <pub-id pub-id-type="pmid">21154149</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Palmqvist</surname> <given-names>S.</given-names></name> <name><surname>Sch&#x000F6;ll</surname> <given-names>M.</given-names></name> <name><surname>Strandberg</surname> <given-names>O.</given-names></name> <name><surname>Mattsson</surname> <given-names>N.</given-names></name> <name><surname>Stomrud</surname> <given-names>E.</given-names></name> <name><surname>Zetterberg</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Earliest accumulation of &#x003B2;-amyloid occurs within the default-mode network and concurrently affects brain connectivity</article-title>. <source>Nat. Commun</source>. <volume>8</volume>, <fpage>1214</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-017-01150-x</pub-id><pub-id pub-id-type="pmid">29089479</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Pearl</surname> <given-names>J.</given-names></name></person-group> (<year>1988</year>). <source>Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference</source>. <publisher-loc>Burlington, MA</publisher-loc>: <publisher-name>Morgan Kaufmann</publisher-name>. <pub-id pub-id-type="doi">10.1016/B978-0-08-051489-5.50008-4</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Polvikoski</surname> <given-names>T.</given-names></name> <name><surname>Sulkava</surname> <given-names>R.</given-names></name> <name><surname>Haltia</surname> <given-names>M.</given-names></name> <name><surname>Kainulainen</surname> <given-names>K.</given-names></name> <name><surname>Vuorio</surname> <given-names>A.</given-names></name> <name><surname>Verkkoniemi</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>1995</year>). <article-title>Apolipoprotein e, dementia, and cortical deposition of &#x003B2;-amyloid protein</article-title>. <source>N. Engl. J. Medi</source>. <volume>333</volume>, <fpage>1242</fpage>&#x02013;<lpage>1248</lpage>. <pub-id pub-id-type="doi">10.1056/NEJM199511093331902</pub-id><pub-id pub-id-type="pmid">7566000</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Purcell</surname> <given-names>S.</given-names></name> <name><surname>Neale</surname> <given-names>B.</given-names></name> <name><surname>Todd-Brown</surname> <given-names>K.</given-names></name> <name><surname>Thomas</surname> <given-names>L.</given-names></name> <name><surname>Ferreira</surname> <given-names>M. A.</given-names></name> <name><surname>Bender</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2007</year>). <article-title>Plink: a tool set for whole-genome association and population-based linkage analyses</article-title>. <source>Am. J. Hum. Genet</source>. <volume>81</volume>, <fpage>559</fpage>&#x02013;<lpage>575</lpage>. <pub-id pub-id-type="doi">10.1086/519795</pub-id><pub-id pub-id-type="pmid">17701901</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schellenberg</surname> <given-names>G. D.</given-names></name> <collab>IGAP</collab></person-group>. (<year>2012</year>). <article-title>International genomics of alzheimer&#x00027;s disease project (IGAP) genome-wide association study</article-title>. <source>Alzheimers Dement.</source> <volume>8</volume>, <fpage>P101</fpage>. <pub-id pub-id-type="doi">10.1016/j.jalz.2012.05.254</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shen</surname> <given-names>L.</given-names></name> <name><surname>Chepelev</surname> <given-names>I.</given-names></name> <name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Wang</surname> <given-names>W.</given-names></name></person-group> (<year>2010</year>). <article-title>Prediction of quantitative phenotypes based on genetic networks: a case study in yeast sporulation</article-title>. <source>BMC Syst. Biol</source>. <volume>4</volume>, <fpage>1</fpage>&#x02013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1186/1752-0509-4-128</pub-id><pub-id pub-id-type="pmid">20828418</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siddarth</surname> <given-names>P.</given-names></name> <name><surname>Burggren</surname> <given-names>A. C.</given-names></name> <name><surname>Merrill</surname> <given-names>D. A.</given-names></name> <name><surname>Ercoli</surname> <given-names>L. M.</given-names></name> <name><surname>Mahmood</surname> <given-names>Z.</given-names></name> <name><surname>Barrio</surname> <given-names>J. R.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Longer tomm40 poly-t variants associated with higher fddnp-pet medial temporal tau and amyloid binding</article-title>. <source>PLoS ONE</source> <volume>13</volume>, <fpage>e0208358</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0208358</pub-id><pub-id pub-id-type="pmid">30517207</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Swaminathan</surname> <given-names>S.</given-names></name> <name><surname>Shen</surname> <given-names>L.</given-names></name> <name><surname>Risacher</surname> <given-names>S. L.</given-names></name> <name><surname>Yoder</surname> <given-names>K. K.</given-names></name> <name><surname>West</surname> <given-names>J. D.</given-names></name> <name><surname>Kim</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Amyloid pathway-based candidate gene analysis of [11C] pib-pet in the alzheimer&#x00027;s disease neuroimaging initiative (ADNI) cohort</article-title>. <source>Brain Imaging Behav</source>. <volume>6</volume>, <fpage>1</fpage>&#x02013;<lpage>15</lpage>. <pub-id pub-id-type="doi">10.1007/s11682-011-9136-1</pub-id><pub-id pub-id-type="pmid">21901424</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vogt</surname> <given-names>L. K.</given-names></name> <name><surname>Hyman</surname> <given-names>B.</given-names></name> <name><surname>Van Hoesen</surname> <given-names>G.</given-names></name> <name><surname>Damasio</surname> <given-names>A.</given-names></name></person-group> (<year>1990</year>). <article-title>Pathological alterations in the amygdala in Alzheimer&#x00027;s disease</article-title>. <source>Neuroscience</source> <volume>37</volume>, <fpage>377</fpage>&#x02013;<lpage>385</lpage>. <pub-id pub-id-type="doi">10.1016/0306-4522(90)90408-v</pub-id><pub-id pub-id-type="pmid">2133349</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>B.</given-names></name> <name><surname>Mezlini</surname> <given-names>A. M.</given-names></name> <name><surname>Demir</surname> <given-names>F.</given-names></name> <name><surname>Fiume</surname> <given-names>M.</given-names></name> <name><surname>Tu</surname> <given-names>Z.</given-names></name> <name><surname>Brudno</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>Similarity network fusion for aggregating data types on a genomic scale</article-title>. <source>Nat. Methods</source> <volume>11</volume>, <fpage>333</fpage>&#x02013;<lpage>337</lpage>. <pub-id pub-id-type="doi">10.1038/nmeth.2810</pub-id><pub-id pub-id-type="pmid">24464287</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wirths</surname> <given-names>O.</given-names></name></person-group> (<year>2010</year>). <article-title>Accumulation of intraneuronal abeta correlates with apoe4 genotype</article-title>. <source>Acta Neuropathol</source>. <volume>119</volume>, <fpage>555566</fpage>. <pub-id pub-id-type="doi">10.1007/s00401-010-0666-1</pub-id><pub-id pub-id-type="pmid">20217101</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Witten</surname> <given-names>D. M.</given-names></name> <name><surname>Tibshirani</surname> <given-names>R.</given-names></name> <name><surname>Hastie</surname> <given-names>T.</given-names></name></person-group> (<year>2009</year>). <article-title>A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis</article-title>. <source>Biostatistics</source> <volume>10</volume>, <fpage>515</fpage>&#x02013;<lpage>534</lpage>. <pub-id pub-id-type="doi">10.1093/biostatistics/kxp008</pub-id><pub-id pub-id-type="pmid">19377034</pub-id></citation></ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>J.</given-names></name> <name><surname>Du</surname> <given-names>L.</given-names></name> <name><surname>Kim</surname> <given-names>S.</given-names></name> <name><surname>Risacher</surname> <given-names>S. L.</given-names></name> <name><surname>Huang</surname> <given-names>H.</given-names></name> <name><surname>Moore</surname> <given-names>J. H.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>Transcriptome-guided amyloid imaging genetic analysis via a novel structured sparse learning algorithm</article-title>. <source>Bioinformatics</source> <volume>30</volume>, <fpage>i564</fpage>&#x02013;<lpage>i571</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btu465</pub-id><pub-id pub-id-type="pmid">25161248</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>J.</given-names></name> <name><surname>Risacher</surname> <given-names>S. L.</given-names></name> <name><surname>Nho</surname> <given-names>K.</given-names></name> <name><surname>Saykin</surname> <given-names>A. J.</given-names></name> <name><surname>Shen</surname> <given-names>L.</given-names></name> <collab>Alzheimer&#x00027;s Disease Neuroimaging Initiative</collab></person-group> (<year>2017</year>). <article-title>Identification of discriminative imaging proteomics associations in Alzheimer&#x00027;s disease via a novel sparse correlation model</article-title>. <source>Pac. Symp. Biocomput</source>. <volume>22</volume>, <fpage>94</fpage>&#x02013;<lpage>104</lpage>. <pub-id pub-id-type="doi">10.1142/9789813207813_0010</pub-id><pub-id pub-id-type="pmid">27896965</pub-id></citation></ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zeng</surname> <given-names>H.</given-names></name> <name><surname>Shen</surname> <given-names>E. H.</given-names></name> <name><surname>Hohmann</surname> <given-names>J. G.</given-names></name> <name><surname>Oh</surname> <given-names>S. W.</given-names></name> <name><surname>Bernard</surname> <given-names>A.</given-names></name> <name><surname>Royall</surname> <given-names>J. J.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Large-scale cellular-resolution gene profiling in human neocortex reveals species-specific molecular signatures</article-title>. <source>Cell</source> <volume>149</volume>, <fpage>483</fpage>&#x02013;<lpage>496</lpage>. <pub-id pub-id-type="doi">10.1016/j.cell.2012.02.052</pub-id><pub-id pub-id-type="pmid">22500809</pub-id></citation></ref>
</ref-list>
</back>
</article>