<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Archiving and Interchange DTD v2.3 20070202//EN" "archivearticle.dtd">
<article article-type="methods-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Genet.</journal-id>
<journal-title>Frontiers in Genetics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Genet.</abbrev-journal-title>
<issn pub-type="epub">1664-8021</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1370013</article-id>
<article-id pub-id-type="doi">10.3389/fgene.2024.1370013</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Genetics</subject>
<subj-group>
<subject>Methods</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>OGNNMDA: a computational model for microbe-drug association prediction based on ordered message-passing graph neural networks</article-title>
<alt-title alt-title-type="left-running-head">Zhao et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fgene.2024.1370013">10.3389/fgene.2024.1370013</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Zhao</surname>
<given-names>Jiabao</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2628611/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Kuang</surname>
<given-names>Linai</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/617659/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Hu</surname>
<given-names>An</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2656522/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Qi</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yang</surname>
<given-names>Dinghai</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Chunxiang</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/data curation/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>School of Computer Science and School of Cyberspace Science</institution>, <institution>Xiangtan University</institution>, <addr-line>Xiangtan</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Hunan Institute of Engineering College of textile and clothing</institution>, <addr-line>Xiangtan</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/720835/overview">Wen Zhang</ext-link>, Huazhong Agricultural University, China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/578423/overview">Jia Qu</ext-link>, Changzhou University, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2346841/overview">Advait Balaji</ext-link>, Occidental Petroleum Corporation, United States</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Linai Kuang, <email>kla@xtu.edu.cn</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>16</day>
<month>04</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>15</volume>
<elocation-id>1370013</elocation-id>
<history>
<date date-type="received">
<day>13</day>
<month>01</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>14</day>
<month>03</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2024 Zhao, Kuang, Hu, Zhang, Yang and Wang.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Zhao, Kuang, Hu, Zhang, Yang and Wang</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>
<p>In recent years, many excellent computational models have emerged in microbe-drug association prediction, but their performance still has room for improvement. This paper proposed the OGNNMDA framework, which applied an ordered message-passing mechanism to distinguish the different neighbor information in each message propagation layer, and it achieved a better embedding ability through deeper network layers. Firstly, the method calculates four similarity matrices based on microbe functional similarity, drug chemical structure similarity, and their respective Gaussian interaction profile kernel similarity. After integrating these similarity matrices, it concatenates the integrated similarity matrix with the known association matrix to obtain the microbe-drug heterogeneous matrix. Secondly, it uses a multi-layer ordered message-passing graph neural network encoder to encode the heterogeneous network and the known association information adjacency matrix, thereby obtaining the final embedding features of the microbe-drugs. Finally, it inputs the embedding features into the bilinear decoder to get the final prediction results. The OGNNMDA method performed comparative experiments, ablation experiments, and case studies on the aBiofilm, MDAD and DrugVirus datasets using 5-fold cross-validation. The experimental results showed that OGNNMDA showed the strongest prediction performance on aBiofilm and MDAD and obtained sub-optimal results on DrugVirus. In addition, the case studies on well-known drugs and microbes also support the effectiveness of the OGNNMDA method. Source codes and data are available at: <ext-link ext-link-type="uri" xlink:href="https://github.com/yyzg/OGNNMDA">https://github.com/yyzg/OGNNMDA</ext-link>.</p>
</abstract>
<kwd-group>
<kwd>graph neural network</kwd>
<kwd>ordered message-passing mechanism</kwd>
<kwd>microbe-drug association</kwd>
<kwd>multi-similarities</kwd>
<kwd>prediction model</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Computational Genomics</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>The human microbiome consists of trillions of microbes that reside inside and outside the human body, and these microbes play an essential role in maintaining the overall health of the human body (<xref ref-type="bibr" rid="B27">Ogunrinola et al., 2020</xref>). The host-microbe plays a crucial role in several physiological processes in the human body, such as energy collection and storage (<xref ref-type="bibr" rid="B1">Amato et al., 2019</xref>), facilitating carbohydrate absorption, and protecting the body from foreign microorganisms and pathogens (<xref ref-type="bibr" rid="B13">Hajiagha et al., 2022</xref>). Moreover, the changes in microbiota composition can significantly affect human health <xref ref-type="bibr" rid="B18">Kim et al. (2018)</xref>; <xref ref-type="bibr" rid="B28">Partula et al. (2019)</xref>; <xref ref-type="bibr" rid="B7">Catinean et al. (2018)</xref>. Many studies have shown that the dysbiosis or unbalance of microbiota is closely related to disease, and the microbiota is an important causative factor for many diseases. Therefore, microbes are considered new therapeutic targets for precision medicine (<xref ref-type="bibr" rid="B10">Cullin et al., 2021</xref>), and the research on the relationship between microbes and drugs not only aids in drug development but also the diagnosis and treatment of human diseases. However, the popularization and widespread use of antibiotics in modern medicine have led to the emergence of an increasing number of drug-resistant microbes, which seriously threaten human health (<xref ref-type="bibr" rid="B31">Pugazhendhi et al., 2020</xref>). Although many researchers have provided extensive evidence on the association between microbes and drugs, traditional biomedical experiments are time-consuming, labor-intensive, and costly (<xref ref-type="bibr" rid="B29">Paul et al., 2010</xref>). These reasons hinder the efficiency of drug development and hardly satisfy the massive demands for novel drugs. Therefore, it is necessary to explore the microbe-drug associations at a large-scale level for drug development.</p>
<p>To overcome the above challenges, computational models have emerged as an effective method for identifying microbe-drug associations, and these models are used to predict microbe-drug associations by integrating different genomic information, including genomics, macro genomics, and metabolomics. With the rapid development of high-throughput sequencing technology and advanced genomics techniques, the research on microbe-drug association prediction has developed rapidly, generating a large amount of valuable research data. To further investigate the potential association between microbes and drugs, a series of microbe-drug association databases have been constructed in recent years, such as aBiofilm (<xref ref-type="bibr" rid="B33">Rajput et al., 2018</xref>), MDAD (<xref ref-type="bibr" rid="B39">Sun et al., 2018</xref>) and DrugVirus (<xref ref-type="bibr" rid="B2">Andersen et al., 2020</xref>), which have immensely promoted the development of microbe-drug association prediction models. Over the past few years, many computational models have emerged that utilize the above databases to infer potential associations between microbes and drugs. As an illustration, Zhu et al. proposed a computational method, HMDAKATZ, which applied the KATZ measure to predict inherent associations between microbes and drugs (<xref ref-type="bibr" rid="B49">Zhu et al., 2019b</xref>). <xref ref-type="bibr" rid="B23">Long et al. (2020)</xref> proposed a computational method called GCNMDA, which combined graph convolutional networks (GCNs) and conditional random fields (CRFs) with an attentional mechanism aiming to identify the hidden associations between microbes and drugs. In 2021, GATMDA was proposed, which utilized inductive matrix completion and graph attention networks (GNNs) to predict associations between microbes and diseases (<xref ref-type="bibr" rid="B22">Long et al., 2021</xref>). The Graph2MDA model combined the constructed multimodal attribute graphs and variational graph autoencoder (VGAE) to predict microbe-drug associations accurately (<xref ref-type="bibr" rid="B11">Deng et al., 2022</xref>). GSAMDA is likewise a microbe-drug association prediction model, which primarily applies graph attention networks (GATs) and sparse autoencoders (<xref ref-type="bibr" rid="B41">Tan et al., 2022</xref>). The computational model NIRBMMDA (<xref ref-type="bibr" rid="B9">Cheng et al., 2022</xref>) combines neighborhood-based inference (NI) and restricted Boltzmann machine (RBM) methodologies to predict Microbe-Drug Associations (MDA). By leveraging NI, it extracts proximity information from microbes or drugs, while RBM is used to learn the latent probability distribution inherent in the known association data. This integrative approach harnesses the strengths of both components, resulting in a more robust predictive framework. In the study of <xref ref-type="bibr" rid="B42">Tian et al. (2023)</xref>, they proposed the SCSMDA model, which was based on GCN and integrated structure-enhanced contrast learning and self-paced negative sampling strategies to improve the accuracy in microbe-drug association prediction. In addition, the GACNNMDA model integrated a GTA-based autoencoder and a CNN-based classifier, which transforms multiple attribute combinations of the microbes and drugs into two feature matrices to predict the associations of the microbes and drugs (<xref ref-type="bibr" rid="B26">Ma et al., 2023</xref>). <xref ref-type="bibr" rid="B32">Qu et al. (2023)</xref> proposed MHBVDA to predicts virus-drug associations by integrating multiple biological data sources and employing integrating two matrix decomposition-based methods. And it innovatively applies Bounded Nuclear Norm Regularization (BNNR) with regularization terms to mitigate the impact of noisy data and overfitting issues, thereby enhancing prediction accuracy. However, these methods based on graph neural networks still have room for improvement in prediction performance. When multi-layer networks are stacked, there is some confusion between different orders of neighborhood information, the node representations become indistinguishable, and the network performance decreases, which tends to prevent GNN with multiple layers from effectively utilizing the higher-order neighborhood information (<xref ref-type="bibr" rid="B20">Li et al., 2018</xref>).</p>
<p>Therefore, to achieve better prediction performance, inspired by the work of <xref ref-type="bibr" rid="B38">Song et al. (2023)</xref>, this paper proposed an ordered gating mechanism-based ordered message-passing GNN method to infer potential microbe-drug associations, called OGNNMDA. In OGNNMDA, the known association data are preprocessed to compute Gaussian interaction profile kernel similarity and additional biomedical information similarity (microbe functional similarity, drug structural similarity) for drugs and microbes, respectively. Then, the multiple similarity matrices are fused and stitched together to obtain the heterogeneous networks. The heterogeneous network was fed into the encoder consisting of the two-layer fully connected network and the 12-layer ordered message-passing GNN to derive embedding representations of the drugs and microbes, respectively. Finally, the bilinear decoder was adopted to reconstruct the microbe-drug association matrix to infer possible associations between the microbes and drugs. Furthermore, to evaluate the predictive performance of OGNNMDA, in-depth comparative experiments, ablation experiments, and case studies are conducted in this paper. The results demonstrate that OGNNMDA outperforms current representative existing methods and achieves satisfactory results in potential drug-microbe association prediction.</p>
</sec>
<sec id="s2">
<title>2 Datasets</title>
<p>All the aBiofilm, MDAD and DrugVirus datasets provide important insights into the complex interactions between the drugs and the microbes, providing researchers in the fields of bioinformatics and graphical neural networks with a wealth of information to analyze and utilize to advance their studies and methods. The basic statistical information of the three datasets is presented in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Statistical information about the datasets.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Dataset</th>
<th align="left">Drugs</th>
<th align="left">Microbes</th>
<th align="left">Associations</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">aBiofilm</td>
<td align="left">1740</td>
<td align="left">140</td>
<td align="left">2,884</td>
</tr>
<tr>
<td align="left">MDAD</td>
<td align="left">1,373</td>
<td align="left">173</td>
<td align="left">2,470</td>
</tr>
<tr>
<td align="left">DrugVirus</td>
<td align="left">175</td>
<td align="left">95</td>
<td align="left">933</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s2-1">
<title>2.1 aBiofilm</title>
<p>In 2018, Rajput et al. introduced the aBiofilm (<ext-link ext-link-type="uri" xlink:href="http://bioinfo.imtech.res.in/manojk/abiofilm/">http://bioinfo.imtech.res.in/manojk/abiofilm/</ext-link>) dataset, which is of great significance for the development of the bioinformatics and graph neural network fields (<xref ref-type="bibr" rid="B33">Rajput et al., 2018</xref>). Over the last three&#xa0;decades, many anti-biofilm agents have been experimentally verified to disrupt biofilms. aBiofilm organizes these data, which contain a database, a predictor, and a data visualization module. The database contains biological, chemical, and structural details of 5,027 anti-biofilm agents (1720 different ones) reported from 1988 to 2017. After eliminating redundant associations among them, a total of 2,884 known interaction associations of 1720 drugs and 140 microbes were finally obtained.</p>
</sec>
<sec id="s2-2">
<title>2.2 MDAD</title>
<p>MDAD (<ext-link ext-link-type="uri" xlink:href="https://github.com/Sun-Yazhou/MDAD/">https://github.com/Sun-Yazhou/MDAD/</ext-link>) is also a valuable microbe-drug association dataset, which was proposed by Sun et al. based on a variety of drug-related databases as well as a large amount of literature (<xref ref-type="bibr" rid="B39">Sun et al., 2018</xref>). Specifically, MDAD contains 5,505 associations between 180 microbes and 1,388 drugs collected from 993 documentation. After filtering out redundant information, a total of 2,470 microbe-drug associations were obtained, involving 173 microbes and 1,373 drugs.</p>
</sec>
<sec id="s2-3">
<title>2.3 DrugVirus</title>
<p>DrugVirus (<ext-link ext-link-type="uri" xlink:href="https://drugvirus.info/">https://drugvirus.info/</ext-link>) compiles interactions involving 118 virus-targeting drugs and 83 human viruses, encompassing SARS-CoV-2 (2019-nCoV) (<xref ref-type="bibr" rid="B2">Andersen et al., 2020</xref>). Building upon this foundation, Lond et al. systematically extracted and curated 57 drug-virus associations from pertinent drug databases and scholarly publications, which involved 76 unique drugs and 12 distinct viruses. Ultimately, they assembled a dataset comprising 175 drugs and 95 viruses, yielding a total of 933 documented drug-virus interaction records.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Preprocessing</title>
<p>In this section, firstly, the definition of the association adjacency matrix is given, secondly, the similarity calculation of drugs and microbe based on the adjacency matrix is given, and finally, the heterogeneous network is obtained based on multiple similarities.</p>
<p>For simplicity, for each dataset, let <inline-formula id="inf1">
<mml:math id="m1">
<mml:mi>D</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> denote the set of different drugs, and <inline-formula id="inf2">
<mml:math id="m2">
<mml:mi>M</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> denote the set of different microbes. Therefore, a primitive known microbe-drug association network <inline-formula id="inf3">
<mml:math id="m3">
<mml:mi>N</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>&#x222a;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> can be constructed: for each given drug <inline-formula id="inf4">
<mml:math id="m4">
<mml:msub>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> and microbe <inline-formula id="inf5">
<mml:math id="m5">
<mml:msub>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> there exists a unique edge corresponding to it in <italic>E</italic> if and only if there is a known association between them. Based on the above definition, the adjacency matrix <inline-formula id="inf6">
<mml:math id="m6">
<mml:mi>A</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> can be obtained as shown in Eq. <xref ref-type="disp-formula" rid="e1">1</xref>.<disp-formula id="e1">
<mml:math id="m7">
<mml:msub>
<mml:mrow>
<mml:mi>A</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>&#x3d;</mml:mo>
<mml:mfenced open="{" close="">
<mml:mrow>
<mml:mtable class="cases">
<mml:mtr>
<mml:mtd columnalign="left">
<mml:mn>1</mml:mn>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd columnalign="left">
<mml:mtext>if&#x2009;drug&#x2009;</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x2009;and&#x2009;microbe&#x2009;</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x2009;has&#x2009;interaction&#x2009;association</mml:mtext>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="left">
<mml:mn>0</mml:mn>
<mml:mspace width="1em"/>
</mml:mtd>
<mml:mtd columnalign="left">
<mml:mtext>otherwise</mml:mtext>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(1)</label>
</disp-formula>That is, for any given <inline-formula id="inf7">
<mml:math id="m8">
<mml:msub>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> and <inline-formula id="inf8">
<mml:math id="m9">
<mml:msub>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, there is <italic>A</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub> &#x3d; 1 if and only if there is an edge between them in <italic>E</italic>. Otherwise, <italic>A</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub> &#x3d; 0.</p>
<sec id="s3-1">
<title>3.1 Constructing drug-drug similarity networks</title>
<p>First, considering that the functions of drugs are determined by their microstructures, and drugs with similar structures have similar chemical properties. So, the SIMCOMP2 tool based on the maximum common substructure between drugs is used in this paper to calculate the drug structure similarity (<xref ref-type="bibr" rid="B14">Hattori et al., 2010</xref>). For two drugs <italic>d</italic>
<sub>
<italic>i</italic>
</sub> and <italic>d</italic>
<sub>
<italic>j</italic>
</sub> respectively, their structure-based similarity can be expressed as <italic>DSS</italic>(<italic>d</italic>
<sub>
<italic>i</italic>
</sub>, <italic>d</italic>
<sub>
<italic>j</italic>
</sub>). After calculating all the similarities between all drug pairs, an <italic>N</italic>
<sub>
<italic>d</italic>
</sub> &#xd7; <italic>N</italic>
<sub>
<italic>d</italic>
</sub> matrix <inline-formula id="inf9">
<mml:math id="m10">
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> can be obtained to represent the chemical structure similarities between <italic>N</italic>
<sub>
<italic>d</italic>
</sub> different drugs.</p>
<p>Next, for any two given drugs or microbes, the Gaussian interaction profile kernel similarity between them is calculated herein by utilizing a Gaussian kernel function based on known microbe disease associations as shown in Eq. <xref ref-type="disp-formula" rid="e2">2</xref>:<disp-formula id="e2">
<mml:math id="m11">
<mml:mi>D</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</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>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>exp</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msup>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(2)</label>
</disp-formula>where <italic>A</italic> (<italic>i</italic>, :) and <italic>A</italic> (<italic>j</italic>, :) denote the <italic>ith</italic> and <italic>jth</italic> rows of the adjacency matrix <italic>A</italic>, respectively, and <italic>&#x3b3;</italic>
<sub>
<italic>d</italic>
</sub> denotes the drug-normalized kernel bandwidth, which can be calculated by Eq. <xref ref-type="disp-formula" rid="e3">3</xref>.<disp-formula id="e3">
<mml:math id="m12">
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msubsup>
<mml:mrow>
<mml:mo movablelimits="false" form="prefix">&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
</sec>
<sec id="s3-2">
<title>3.2 Constructing microbe-microbe similarity networks</title>
<p>Also, this paper measures microbe similarity in two ways. The first one is the functional similarity of microbe proposed by <xref ref-type="bibr" rid="B17">Kamneva (2017)</xref>. This computational method is mainly based on the microbial gene family information kernel protein-protein interaction association network. The second similarity between microbes is the Gaussian interaction profile kernel similarity MGS. similar to the drug similarity based on the Gaussian interaction profile kernel, for any given microbe pair <italic>m</italic>
<sub>
<italic>i</italic>
</sub> and <italic>m</italic>
<sub>
<italic>j</italic>
</sub>, it is computed using the Gaussian kernel function based on the known microbe drug associations as shown in Eq. <xref ref-type="disp-formula" rid="e4">4</xref>.<disp-formula id="e4">
<mml:math id="m13">
<mml:mi>M</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</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>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>exp</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msup>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>:</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>:</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(4)</label>
</disp-formula>where <italic>A</italic> (:, <italic>i</italic>) and <italic>A</italic> (:, <italic>j</italic>) denote the <italic>i</italic>th and <italic>j</italic>th columns of the adjacency matrix <italic>A</italic>, respectively, and <italic>&#x3b3;</italic>
<sub>
<italic>m</italic>
</sub> denotes the microbe normalized kernel bandwidth that can be computed according to Eq. <xref ref-type="disp-formula" rid="e5">5</xref>.<disp-formula id="e5">
<mml:math id="m14">
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msubsup>
<mml:mrow>
<mml:mo movablelimits="false" form="prefix">&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mo>:</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
</sec>
<sec id="s3-3">
<title>3.3 Constructing the heterogeneous network</title>
<p>Considering that not all drugs have their structures retrieved from databases, it is not possible to obtain all chemical structure similarities between drugs lacking structural information and other drugs. Therefore, in this paper, a comprehensive similarity is constructed to estimate the similarity between drugs and microbes by integrating Gaussian interaction profile nuclear similarity, microbe functional similarity, and drug chemical structure similarity. Specifically, for any two given drugs <italic>d</italic>
<sub>
<italic>i</italic>
</sub> and <italic>d</italic>
<sub>
<italic>j</italic>
</sub>, the integrated similarity between them is calculated as shown in Eq. <xref ref-type="disp-formula" rid="e6">6</xref>:<disp-formula id="e6">
<mml:math id="m15">
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</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>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="">
<mml:mrow>
<mml:mtable class="matrix">
<mml:mtr>
<mml:mtd columnalign="center">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</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>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</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>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mtext>if&#x2009;</mml:mtext>
<mml:mspace width="0.3333em"/>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</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>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2260;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="center">
<mml:mi>D</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>d</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>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mtext>&#x2009;otherwise</mml:mtext>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(6)</label>
</disp-formula>In addition, for any given microbe pair <italic>m</italic>
<sub>
<italic>i</italic>
</sub> and <italic>m</italic>
<sub>
<italic>j</italic>
</sub>, the combined similarity between them is calculated as shown in Eq. <xref ref-type="disp-formula" rid="e7">7</xref>:<disp-formula id="e7">
<mml:math id="m16">
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</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>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="">
<mml:mrow>
<mml:mtable class="matrix">
<mml:mtr>
<mml:mtd columnalign="center">
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</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>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</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>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mtext>if&#x2009;</mml:mtext>
<mml:mspace width="0.3333em"/>
<mml:mi>M</mml:mi>
<mml:mi>F</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</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>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2260;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="center">
<mml:mi>M</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>S</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>m</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>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mtext>otherwise</mml:mtext>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(7)</label>
</disp-formula>Then, the heterogeneous network <inline-formula id="inf10">
<mml:math id="m17">
<mml:mi mathvariant="script">H</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>, shown in Eq. <xref ref-type="disp-formula" rid="e8">8</xref>, can be constructed by combining the above integrated microbe similarity network <inline-formula id="inf11">
<mml:math id="m18">
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>, the integrated disease similarity network <inline-formula id="inf12">
<mml:math id="m19">
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> and the known drug-microbe association network <inline-formula id="inf13">
<mml:math id="m20">
<mml:mi>A</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>.<disp-formula id="e8">
<mml:math id="m21">
<mml:mi mathvariant="bold">H</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mtable class="matrix">
<mml:mtr>
<mml:mtd columnalign="center">
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mi>A</mml:mi>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="center">
<mml:msup>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(8)</label>
</disp-formula>Next, the model uses above newly constructed heterogeneous network <bold>H</bold> as an input to the GNN-based encoder to learn the low dimensional embedding representations of the drugs and microbes.</p>
</sec>
</sec>
<sec sec-type="methods" id="s4">
<title>4 Methods</title>
<p>
<xref ref-type="fig" rid="F1">Figure 1</xref> illustrates the framework of OGNNMDA, comprising three primary modules: the input module, encoder module, and decoder module. The input module is responsible for extracting multiple biomedical information features to be utilized as inputs for OGNNMDA. The encoder module focuses on learning the node embedding representation of the microbes and drugs. Lastly, the decoder module employs bilinear decoders to predict new drug-microbe associations.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Flowchart of the OGNNMDA.</p>
</caption>
<graphic xlink:href="fgene-15-1370013-g001.tif"/>
</fig>
<sec id="s4-1">
<title>4.1 Encoder</title>
<p>OGNNMDA is a graph neural network that directly processes the graph as input, effectively utilizing both node information and structural characteristics. Graph neural networks have gained significant popularity in link prediction tasks (<xref ref-type="bibr" rid="B46">Zhang and Chen, 2018</xref>), showcasing their widespread adoption. By leveraging the adjacency matrix <bold>H</bold> obtained earlier, Eq. <xref ref-type="disp-formula" rid="e9">9</xref> defines the specific formulation of the GNN.<disp-formula id="e9">
<mml:math id="m22">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo>&#x25a1;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi mathvariant="script">N</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>&#x3d5;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold">H</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(9)</label>
</disp-formula>Here, <inline-formula id="inf14">
<mml:math id="m23">
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">conv</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, <inline-formula id="inf15">
<mml:math id="m24">
<mml:msubsup>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> is the embedding feature of the layer <italic>l</italic>, <inline-formula id="inf16">
<mml:math id="m25">
<mml:mi mathvariant="script">N</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> denotes the set of neighboring nodes for the node <italic>v</italic>, <italic>L</italic>
<sub>
<italic>conv</italic>
</sub> corresponds to the number of layers in the GNN network and the number of message-passing rounds. The dimension of the node&#x2019;s embedding feature is denoted by <italic>k</italic>. In this study, the final embedding dimension is set to match the embedding dimensions used across the GNN layers. <bold>H</bold> is the microbe-drug heterogeneous network graph defined in Eq. <xref ref-type="disp-formula" rid="e8">8</xref>, which is processed for embedding and provides edge information for the GNN. The node representation <inline-formula id="inf17">
<mml:math id="m26">
<mml:msup>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> is obtained by a two-layer MLP defined by Eq. <xref ref-type="disp-formula" rid="e10">10</xref> and <xref ref-type="disp-formula" rid="e11">11</xref>. The trainable variables <inline-formula id="inf18">
<mml:math id="m27">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> and <inline-formula id="inf19">
<mml:math id="m28">
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> are involved in this process. Additionally, <inline-formula id="inf20">
<mml:math id="m29">
<mml:msub>
<mml:mrow>
<mml:mi>H</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">init</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> represents the initial node representation, and <italic>&#x3c3;</italic> denotes the ReLU activation function.<disp-formula id="e10">
<mml:math id="m30">
<mml:msup>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi>H</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">init</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(10)</label>
</disp-formula>
<disp-formula id="e11">
<mml:math id="m31">
<mml:msub>
<mml:mrow>
<mml:mi>H</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">init</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mtable class="matrix">
<mml:mtr>
<mml:mtd columnalign="center">
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mi>A</mml:mi>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="center">
<mml:msup>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mtd>
<mml:mtd columnalign="center">
<mml:mn>0</mml:mn>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(11)</label>
</disp-formula>The function <italic>&#x3d5;</italic> calculates the messages transmitted between nodes, where the edge attribute is directly used as the message. The symbol &#x25a1; represents the message aggregation function, and in this paper, the mean method is employed (<xref ref-type="bibr" rid="B15">Huan et al., 2021</xref>). This means that messages received from multiple neighboring nodes are aggregated by taking their average, resulting in message characteristics used for updating node representations. Finally, <italic>&#x3b3;</italic> represents the node representation update function, which implements the ordered message-passing mechanism discussed in this paper.</p>
<p>In the message-passing process of a single-level GNN, a node only exchanges messages with its immediate neighbors. This pattern of neighbor message transmission at different orders aligns with the structure of the node root tree in a multi-layer GNN (<xref ref-type="bibr" rid="B21">Liu et al., 2020</xref>). As illustrated in <xref ref-type="fig" rid="F2">Figure 2</xref>, for a node <italic>v</italic>, <inline-formula id="inf21">
<mml:math id="m32">
<mml:msubsup>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> represents the neighbor information of node <italic>v</italic> at the <italic>l</italic>th layer, and the nesting relationship of its neighbor messages at each layer can be described using Eq. <xref ref-type="disp-formula" rid="e12">12</xref>.<disp-formula id="e12">
<mml:math id="m33">
<mml:msubsup>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2286;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2286;</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>&#x2286;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">conv</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
<label>(12)</label>
</disp-formula>
</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Taking a two-layer GNN as an example, layer 0 represents the initial node embedding, and the adjacency of nodes between layers forms multiple trees. In the figure, <italic>u</italic> is a neighbor node of <italic>v</italic>. <inline-formula id="inf22">
<mml:math id="m34">
<mml:msubsup>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</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:math>
</inline-formula> and <inline-formula id="inf23">
<mml:math id="m35">
<mml:msubsup>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>u</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:math>
</inline-formula> are shown in the image with two colors respectively. The right side shows the tree structure of neighbor information with <italic>v</italic> node as the viewpoint, and the arrow represents the direction of neighbor information transfer.</p>
</caption>
<graphic xlink:href="fgene-15-1370013-g002.tif"/>
</fig>
<p>In single-layer message passing, direct-neighbor node messages and higher-order neighbor node messages are differentially encoded to ensure orderly message delivery. Specifically, the neuron rows are aligned with the node root tree at each layer, enabling the acquisition of node feature representations with consistent nesting relationships. To implement this alignment encoding method, the neurons can be ordered by linearly arranging the neurons of each layer and considering a segmentation point, denoted as <italic>s</italic>. The information of the neighbors of the current node <italic>v</italic>, at order one or higher, can be encoded as <inline-formula id="inf24">
<mml:math id="m36">
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> (<xref ref-type="bibr" rid="B38">Song et al., 2023</xref>). The segmentation point <italic>s</italic> corresponds to the nested nature of node <italic>v</italic>, and its size relationship is determined by Eq. <xref ref-type="disp-formula" rid="e13">13</xref>.<disp-formula id="e13">
<mml:math id="m37">
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">conv</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
<label>(13)</label>
</disp-formula>
</p>
<p>Next, we describe the node feature update function <italic>&#x3b3;</italic>, which is exemplified below for a specific node <italic>v</italic>. The function can be divided into three distinct steps.<list list-type="simple">
<list-item>
<p>1. Compute the aggregated message representation <inline-formula id="inf25">
<mml:math id="m38">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> for layer <italic>l</italic>.</p>
</list-item>
</list>
<disp-formula id="e14">
<mml:math id="m39">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mi mathvariant="normal">A</mml:mi>
<mml:mi mathvariant="normal">N</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold">H</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(14)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>2. For node <italic>v</italic>, this paper utilizes the gating vector <inline-formula id="inf26">
<mml:math id="m40">
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> of dimension <inline-formula id="inf27">
<mml:math id="m41">
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> to describe the segmentation point <inline-formula id="inf28">
<mml:math id="m42">
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. Specifically, the value of the left part <inline-formula id="inf29">
<mml:math id="m43">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> is set to 1, indicating the neighboring neurons of node v that are higher than the first order. Conversely, the value of the right part <inline-formula id="inf30">
<mml:math id="m44">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> is set to 0, denoting direct neighboring neurons. This is achieved by calculating the cumulative sum of the probability that each position in the node servers as a split point <inline-formula id="inf31">
<mml:math id="m45">
<mml:msubsup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. The expectation gating vector <inline-formula id="inf32">
<mml:math id="m46">
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> is obtained through a biased linear projection of the node representation vector in layer <italic>l</italic> &#x2212; 1 and the message vector in layer <italic>l</italic>, as shown in Eq. <xref ref-type="disp-formula" rid="e15">15</xref>.</p>
</list-item>
</list>
<disp-formula id="e15">
<mml:math id="m47">
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="normal">c</mml:mi>
<mml:mi mathvariant="normal">u</mml:mi>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">u</mml:mi>
<mml:mi mathvariant="normal">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2190;</mml:mo>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(15)</label>
</disp-formula>In Eq. <xref ref-type="disp-formula" rid="e15">15</xref>, the trainable parameters <inline-formula id="inf33">
<mml:math id="m48">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> and <inline-formula id="inf34">
<mml:math id="m49">
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> are utilized. Additionally, <inline-formula id="inf35">
<mml:math id="m50">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> represents the concatenation of two vectors <inline-formula id="inf36">
<mml:math id="m51">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> and <inline-formula id="inf37">
<mml:math id="m52">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. To ensure that the predicted gated vector <inline-formula id="inf38">
<mml:math id="m53">
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> adheres to the relative size relationship of the splitting points mentioned earlier, the operation described in Eq. <xref ref-type="disp-formula" rid="e16">16</xref>. This operation yields the final gated vector <inline-formula id="inf39">
<mml:math id="m54">
<mml:msubsup>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>.<disp-formula id="e16">
<mml:math id="m55">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x22c5;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
<label>(16)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>3. Equation <xref ref-type="disp-formula" rid="e17">17</xref> demonstrates the utilization of the gating vector <inline-formula id="inf40">
<mml:math id="m56">
<mml:msubsup>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> to regulate the integration of the layer <italic>l</italic> &#x2212; 1 node representation <inline-formula id="inf41">
<mml:math id="m57">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> with the layer <italic>l</italic> aggregated context <inline-formula id="inf42">
<mml:math id="m58">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. This process results in the acquisition of the new node representation <inline-formula id="inf43">
<mml:math id="m59">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>.</p>
</list-item>
</list>
<disp-formula id="e17">
<mml:math id="m60">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi mathvariant="normal">N</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x22c5;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x22c5;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(17)</label>
</disp-formula>In Eq. <xref ref-type="disp-formula" rid="e17">17</xref>, the symbol &#x22c5; represents element-by-element multiplication, and LN refers to the layer normalization operation (<xref ref-type="bibr" rid="B8">Chen et al., 2022</xref>).</p>
</sec>
<sec id="s4-2">
<title>4.2 Decoder</title>
<p>After the previous rounds of the ordered message passing process, the final node embedding representation <inline-formula id="inf44">
<mml:math id="m61">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">conv</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> is obtained. This representation can be considered as the concatenation of the final embedding features of the drugs, <inline-formula id="inf45">
<mml:math id="m62">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>, and the microbes, <inline-formula id="inf46">
<mml:math id="m63">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>. In this paper, the final embedding features <italic>h</italic>
<sub>
<italic>d</italic>
</sub> and <italic>h</italic>
<sub>
<italic>m</italic>
</sub> are obtained separately using the matrix splicing approach defined in Eq. <xref ref-type="disp-formula" rid="e18">18</xref>.<disp-formula id="e18">
<mml:math id="m64">
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mtable class="matrix">
<mml:mtr>
<mml:mtd columnalign="center">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="center">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">conv</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:math>
<label>(18)</label>
</disp-formula>
</p>
<p>To reconstruct the adjacency matrix <bold>A</bold>&#x2032; representing possible microbe-disease associations, the bilinear decoder is employed. It is a structural component employed for predicting the probability of potential edges or links based on node embedding vectors. These decoders commonly integrate the embedding vectors of node pairs within a graph to generate a score function that assesses the likelihood of a link between two nodes. The key characteristic of bilinear decoders lies in their utilization of bilinear transformations to capture the interaction effects among nodes. Specifically, for a drug node and microbe node pair (u, v) with their respective embedding vectors <bold>h</bold>
<sub>
<italic>d</italic>
</sub>(<italic>u</italic>) and <bold>h</bold>
<sub>
<italic>m</italic>
</sub>(<italic>v</italic>), a bilinear decoder might compute the score by Eq. <xref ref-type="disp-formula" rid="e19">19</xref>.<disp-formula id="e19">
<mml:math id="m65">
<mml:mi>s</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>u</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mi>W</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(19)</label>
</disp-formula>Where <italic>W</italic> is a learnable weight matrix. This score can be interpreted as the probability of link occurrence after a nonlinear activation function transformation, so that <bold>A</bold>&#x2032; can be obtained by the bilinear decoder as shown in Eq. <xref ref-type="disp-formula" rid="e20">20</xref>.<disp-formula id="e20">
<mml:math id="m66">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="bold">h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(20)</label>
</disp-formula>In the above formula, where <inline-formula id="inf47">
<mml:math id="m67">
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> represents a trainable matrix and <inline-formula id="inf48">
<mml:math id="m68">
<mml:mi>&#x3c3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>/</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> is the sigmoid function. Overall, the complete computational flow of OGNNMDA can be seen in <xref ref-type="statement" rid="Algorithm_1">Algorithm 1</xref>.</p>
<p>
<statement content-type="algorithm" id="Algorithm_1">
<label>Algorithm 1</label>
<p>OGNNMDA.<list list-type="simple">
<list-item>
<p>
<bold>Require:</bold> Known associations matrix <inline-formula id="inf49">
<mml:math id="m69">
<mml:mi>A</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>, drug similarity matrix <inline-formula id="inf50">
<mml:math id="m70">
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>, microbe similarity matrix <inline-formula id="inf51">
<mml:math id="m71">
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> and <italic>&#x3b1;</italic> &#x3d; 600 is the number of iterations for OGNNMDA</p>
</list-item>
<list-item>
<p>
<bold>Ensure:</bold> The constructed drug-microbe associations matrix <inline-formula id="inf52">
<mml:math id="m72">
<mml:msup>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>
</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;1: &#x2003;Construct the heterogeneous network <italic>H</italic> according to formula (<xref ref-type="disp-formula" rid="e8">8</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;2: &#x2003;Initialize the embedding feature matrix <italic>H</italic>
<sub>
<italic>init</italic>
</sub> according to formula (<xref ref-type="disp-formula" rid="e11">11</xref>).</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;3: &#x2003;Initialize the gate vector &#x3d; 0</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;4: &#x2003;<bold>for</bold> <italic>i</italic> &#x3d; 1 &#x2192; <italic>&#x3b1;</italic> <bold>do</bold>
</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;5: &#x2003;&#x2003;calculate <bold>h</bold>
<sub>0</sub> according to formula (<xref ref-type="disp-formula" rid="e10">10</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;6: &#x2003;&#x2003;<bold>for</bold> <italic>l</italic> &#x3d; 1 &#x2192; <italic>L</italic>
<sub>
<italic>conv</italic>
</sub> <bold>do</bold>
</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;7: &#x2003;&#x2003;&#x2003;calculate message matrix <inline-formula id="inf53">
<mml:math id="m73">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold">m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> formula (<xref ref-type="disp-formula" rid="e14">14</xref>).</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;8: &#x2003;&#x2003;&#x2003;calculate <inline-formula id="inf54">
<mml:math id="m74">
<mml:msup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> by formula (<xref ref-type="disp-formula" rid="e15">15</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;9: &#x2003;&#x2003;&#x2003;calculate <inline-formula id="inf55">
<mml:math id="m75">
<mml:msup>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo>&#x303;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> formula (<xref ref-type="disp-formula" rid="e16">16</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;10: &#x2003;&#x2003;&#x2003;calculate <inline-formula id="inf56">
<mml:math id="m76">
<mml:msup>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> formula (<xref ref-type="disp-formula" rid="e17">17</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;11: &#x2003;&#x2003;<bold>end for</bold>
</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;12: &#x2003;&#x2003;get the embedding feature for drugs and microbes with <italic>h</italic>
<sub>
<italic>d</italic>
</sub> and <italic>h</italic>
<sub>
<italic>m</italic>
</sub> according to formula (<xref ref-type="disp-formula" rid="e18">18</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;13: &#x2003;&#x2003;get the reconstruction matrix <italic>A</italic>&#x2032; by formula (<xref ref-type="disp-formula" rid="e20">20</xref>)</p>
</list-item>
<list-item>
<p>&#xa0;&#xa0;14: &#x2003;<bold>end for</bold>
</p>
</list-item>
</list>
</p>
</statement>
</p>
</sec>
<sec id="s4-3">
<title>4.3 Optimization</title>
<p>During the experiment, positive samples were the drug-microbe pairs with known associations, while negative samples were the drug-microbe pairs without known associations. These sets of positive and negative samples are denoted as &#x3a9;<sup>&#x2b;</sup> and &#x3a9;<sup>&#x2212;</sup>, respectively, for ease of description. It is important to note that the number of pairs with known associations in both the aBiofilm dataset and the MDAD dataset is significantly smaller than the number of pairs without known associations. Therefore, when training OGNNMDA, the loss function incorporates a weighted cross-entropy loss, as defined in Eq. <xref ref-type="disp-formula" rid="e21">21</xref>.<disp-formula id="e21">
<mml:math id="m77">
<mml:mi mathvariant="script">L</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2b;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mi>log</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mi>log</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(21)</label>
</disp-formula>In the above formula, (<italic>i</italic>, <italic>j</italic>) represents a pair of the drug <italic>d</italic>
<sub>
<italic>i</italic>
</sub> and microbe <italic>m</italic>
<sub>
<italic>j</italic>
</sub>. <italic>&#x3bb;</italic> is introduced as a balancing factor, calculated as the ratio of the number of samples in &#x3a9;<sup>&#x2212;</sup> to the number of samples in &#x3a9;<sup>&#x2b;</sup>. This factor helps attenuate the impact of data imbalance and emphasizes the reinforcement of known correlation information.</p>
<p>In this paper, the Xavier initialization method (<xref ref-type="bibr" rid="B12">Duong et al., 2019</xref>) is employed to initialize the trainable parameter matrices in various components of the model. These include the 2-layer fully connected layer, the ordered message-passing graph neural network layer, the bilinear decoder, and others, denoted as <inline-formula id="inf57">
<mml:math id="m78">
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>K</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, <inline-formula id="inf58">
<mml:math id="m79">
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>&#x2a;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>K</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">conv</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, and the bias matrix <inline-formula id="inf59">
<mml:math id="m80">
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>. Furthermore, the Adam optimizer (<xref ref-type="bibr" rid="B43">Wang et al., 2023</xref>) is utilized to minimize the loss function. Adam combines the benefits of momentum optimization and adaptive learning rate, enabling quick convergence and adaptation to different parameter learning rates during the training process. This optimization technique enhances the training effectiveness of the deep learning model.</p>
<p>To prevent overfitting, the paper introduces node dropout (<xref ref-type="bibr" rid="B30">Piotrowski et al., 2020</xref>) and regularized dropout (<xref ref-type="bibr" rid="B4">Berg et al., 2017</xref>) schemes in the graph convolution layer. Node dropout can be seen as training multiple models on various sub-nodes, and the combination of these sub-nodes is used to predict unknown microbe-drug pairs (<xref ref-type="bibr" rid="B40">Tan et al., 2020</xref>).</p>
</sec>
</sec>
<sec sec-type="results" id="s5">
<title>5 Results</title>
<p>This paper begins by providing a brief overview of the experimental setup and the analysis and selection of certain hyperparameters. The aim is to validate the predictive performance advantages of OGNNMDA through intensive comparison experiments. These experiments involve 6 representative microbe-drug association prediction models, including state-of-the-art approaches. The evaluation is conducted on three well-known public datasets, namely, aBiofilm, MDAD and DrugVirus, within a 5-fold cross-validation framework. Furthermore, ablation experiments are performed to investigate the effectiveness of the ordered message-passing mechanism employed in OGNNMDA. Finally, a case study is presented to validate OGNNMDA using two commonly used drugs, ciprofloxacin and moxifloxacin, along with two common oral microbes, Actinobacillus aggregatum and <italic>Clostridium</italic> nucleatum.</p>
<sec id="s5-1">
<title>5.1 Experimental parameter setting</title>
<p>In this paper, all experimental evaluations are conducted within a five-fold cross-validation setup. To ensure statistical robustness, each method is executed ten independent times for every experiment, thereby enabling the calculation of the mean value for each performance metric across these repetitions. In detail, this involves dividing all known associations in the dataset equally into 5 parts, denoted as <inline-formula id="inf60">
<mml:math id="m81">
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>. Additionally, a subset of the same size as the known associations is randomly selected from the unknown association set. This subset is divided equally into 5 parts, denoted as <inline-formula id="inf61">
<mml:math id="m82">
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>.</p>
<p>During the <italic>i</italic> &#x2212; <italic>th</italic> (1 &#x2264; <italic>i</italic> &#x2264; 5) cross-validation iteration, the training set is defined as <inline-formula id="inf62">
<mml:math id="m83">
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, and the test set is defined as <inline-formula id="inf63">
<mml:math id="m84">
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x222a;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>t</mml:mi>
<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:mfenced>
</mml:math>
</inline-formula>. The final test result of the 5-fold cross-validation experiment is calculated based on the combined test set, <italic>test</italic> &#x3d; <italic>test</italic>
<sub>
<italic>p</italic>
</sub> &#x222a; <italic>test</italic>
<sub>
<italic>n</italic>
</sub>.</p>
<p>Based on the previous description of the model structure, OGNNMDA incorporates several hyperparameters, including the dimension size (<italic>k</italic>) of embedded features, the number of fully-connected layers (<italic>L</italic>
<sub>
<italic>fc</italic>
</sub>), the number of ordered message-passing GNN layers (<italic>L</italic>
<sub>
<italic>conv</italic>
</sub>), the initial learning rate (<italic>r</italic>) of Adam&#x2019;s optimizer, the total training period (<italic>&#x3b1;</italic>), the node dropout metrics (<italic>&#x3b2;</italic>), and the regularized dropout parameter (<italic>&#x3b3;</italic>).</p>
<p>To establish initial values for these parameters, we set <italic>L</italic>
<sub>
<italic>fc</italic>
</sub> &#x3d; 2, <italic>r</italic> &#x3d; 0.008, <italic>&#x3b1;</italic> &#x3d; 600, <italic>&#x3b2;</italic> &#x3d; 0.6, and <italic>&#x3b3;</italic> &#x3d; 0.4. Subsequently, we examine the effects of different values for parameters <italic>k</italic> and <italic>L</italic>
<sub>
<italic>conv</italic>
</sub> through experimental analysis.</p>
<p>To investigate the impact of different hyperparameter values on the model, this paper performed 5-fold cross-validation (5 cv) experiments on the aBiofilm and MDAD datasets. The results for the AUROC were plotted in <xref ref-type="fig" rid="F3">Figure 3</xref>, showcasing the outcomes for various combinations of the parameters <italic>L</italic>
<sub>
<italic>conv</italic>
</sub> and <italic>k</italic>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>
<bold>(A)</bold> Model hyperparameter analysis on the aBiofilm dataset. <bold>(B)</bold> Model hyperparameter analysis on the MDAD dataset.</p>
</caption>
<graphic xlink:href="fgene-15-1370013-g003.tif"/>
</fig>
<p>From <xref ref-type="fig" rid="F3">Figures 3A, B</xref>, it is evident that the optimal combination of <italic>L</italic>
<sub>
<italic>conv</italic>
</sub> and <italic>k</italic> is <italic>L</italic>
<sub>
<italic>conv</italic>
</sub> &#x3d; 12 and <italic>k</italic> &#x3d; 512. Therefore, this parameter setting will be utilized for OGNNMDA in subsequent experiments.</p>
</sec>
<sec id="s5-2">
<title>5.2 Comparison experiments</title>
<p>In this study, we replicate the code and data based on publicly accessible resources of these six methodologies, with all competing methods&#x2019; parameter configurations set according to their optimal values as reported in their respective publications. The 6 methods we compared OGNNMDA with are HMDAKATZ (<xref ref-type="bibr" rid="B48">Zhu et al., 2019a</xref>), GCNNMDA (<xref ref-type="bibr" rid="B23">Long et al., 2020</xref>), GSAMDA (<xref ref-type="bibr" rid="B41">Tan et al., 2022</xref>), SCSMDA (<xref ref-type="bibr" rid="B42">Tian et al., 2023</xref>), LAGCN (<xref ref-type="bibr" rid="B45">Yu et al., 2021</xref>), and NTSHMDA (<xref ref-type="bibr" rid="B25">Luo and Long, 2018</xref>), which are widely used in linkage prediction problems across various bioinformatics domains. However, due to GSAMDA not having performed experiments on DrugVirus in their paper nor specifying the construction process for the microbe-disease associations and drug-disease associations used to derive disease-based microbial and drug-Hamming similarities, comparative evaluations on DrugVirus are limited to the remaining five competing approaches.</p>
<p>To train and evaluate these methods, a 5-fold cross-validation experimental framework was employed. Performance evaluation was based on metrics such as AUC, AUPR, accuracy, and F1 score, chosen for their effectiveness in assessing performance. The experimental results, including the performance metrics, are presented in <xref ref-type="table" rid="T2">Tables 2</xref>&#x2013;<xref ref-type="table" rid="T4">4</xref>. Additionally, ROC curves (see <xref ref-type="fig" rid="F4">Figure 4A</xref>, <xref ref-type="fig" rid="F5">5A</xref>, <xref ref-type="fig" rid="F6">6A</xref>) and PR curves (see <xref ref-type="fig" rid="F4">Figure 4B</xref>, <xref ref-type="fig" rid="F5">5B</xref>, <xref ref-type="fig" rid="F6">6B</xref>) were plotted to facilitate comparison among the different methods on the respective datasets.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Comparison of AUC, AUPR, Acc, and F1-score obtained by each method based on aBiofilm dataset at 5-cv.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Methods</th>
<th align="left">AUC</th>
<th align="left">AUPR</th>
<th align="left">Accuracy</th>
<th align="left">F1-score</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">GCNMDA</td>
<td align="left">0.9465 &#xb1; 0.0001</td>
<td align="left">0.9376 &#xb1; 0.0001</td>
<td align="left">0.8772 &#xb1; 0.0004</td>
<td align="left">0.8819 &#xb1; 0.0002</td>
</tr>
<tr>
<td align="left">GSAMDA</td>
<td align="left">0.8955 &#xb1; 0.0051</td>
<td align="left">0.9073 &#xb1; 0.0053</td>
<td align="left">0.8345 &#xb1; 0.0058</td>
<td align="left">0.8295 &#xb1; 0.0055</td>
</tr>
<tr>
<td align="left">HMDAKATZ</td>
<td align="left">0.8982 &#xb1; 0.0027</td>
<td align="left">0.9018 &#xb1; 0.0026</td>
<td align="left">0.7811 &#xb1; 0.0112</td>
<td align="left">0.8088 &#xb1; 0.0040</td>
</tr>
<tr>
<td align="left">LAGCN</td>
<td align="left">0.8991 &#xb1; 0.0032</td>
<td align="left">0.9084 &#xb1; 0.0030</td>
<td align="left">0.8710 &#xb1; 0.0032</td>
<td align="left">0.8651 &#xb1; 0.0036</td>
</tr>
<tr>
<td align="left">NTSHMDA</td>
<td align="left">0.8633 &#xb1; 0.0050</td>
<td align="left">0.8204 &#xb1; 0.0076</td>
<td align="left">0.8073 &#xb1; 0.0082</td>
<td align="left">0.8117 &#xb1; 0.0045</td>
</tr>
<tr>
<td align="left">SCSMDA</td>
<td align="left">
<inline-formula id="inf64">
<mml:math id="m85">
<mml:mrow>
<mml:mn>0.9628</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0021</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf65">
<mml:math id="m86">
<mml:mrow>
<mml:mn>0.9504</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0035</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf66">
<mml:math id="m87">
<mml:mrow>
<mml:mn>0.9083</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0038</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf67">
<mml:math id="m88">
<mml:mrow>
<mml:mn>0.9121</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0035</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">OGNNMDA</td>
<td align="left">
<bold>
<italic>0.9693 &#xb1; 0.0008</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9690 &#xb1; 0.0009</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9141 &#xb1; 0.0031</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9152 &#xb1; 0.0026</italic>
</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>&#x2009;Bold values are the best performing of all these comparison methods, and the next best values are underlined.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Comparison of AUC, AUPR, Acc and F1-score obtained by each method based on MDAD dataset at 5-cv.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Methods</th>
<th align="left">AUC</th>
<th align="left">AUPR</th>
<th align="left">Accuracy</th>
<th align="left">F1-score</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">GCNMDA</td>
<td align="left">0.9365 &#xb1; 0.0001</td>
<td align="left">0.9300 &#xb1; 0.0002</td>
<td align="left">0.8617 &#xb1; 0.0011</td>
<td align="left">0.8675 &#xb1; 0.0004</td>
</tr>
<tr>
<td align="left">GSAMDA</td>
<td align="left">0.8760 &#xb1; 0.0197</td>
<td align="left">0.8823 &#xb1; 0.0164</td>
<td align="left">0.7979 &#xb1; 0.0279</td>
<td align="left">0.8028 &#xb1; 0.0176</td>
</tr>
<tr>
<td align="left">HMDAKATZ</td>
<td align="left">0.8717 &#xb1; 0.0039</td>
<td align="left">0.8798 &#xb1; 0.0045</td>
<td align="left">0.7691 &#xb1; 0.0167</td>
<td align="left">0.7856 &#xb1; 0.0046</td>
</tr>
<tr>
<td align="left">LAGCN</td>
<td align="left">0.8974 &#xb1; 0.0056</td>
<td align="left">0.9062 &#xb1; 0.0050</td>
<td align="left">0.8572 &#xb1; 0.0067</td>
<td align="left">0.8536 &#xb1; 0.0061</td>
</tr>
<tr>
<td align="left">NTSHMDA</td>
<td align="left">0.8512 &#xb1; 0.0043</td>
<td align="left">0.8094 &#xb1; 0.0055</td>
<td align="left">0.7820 &#xb1; 0.0137</td>
<td align="left">0.8028 &#xb1; 0.0044</td>
</tr>
<tr>
<td align="left">SCSMDA</td>
<td align="left">
<inline-formula id="inf68">
<mml:math id="m89">
<mml:mrow>
<mml:mn>0.9574</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0022</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf69">
<mml:math id="m90">
<mml:mrow>
<mml:mn>0.9478</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0036</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf70">
<mml:math id="m91">
<mml:mrow>
<mml:mn>0.8953</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0045</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf71">
<mml:math id="m92">
<mml:mrow>
<mml:mn>0.8996</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0038</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">OGNNMDA</td>
<td align="left">
<bold>
<italic>0.9616 &#xb1; 0.0021</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9645 &#xb1; 0.0024</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9048 &#xb1; 0.0032</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9047 &#xb1; 0.0026</italic>
</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>&#x2009;Bold values are the best performing of all these comparison methods, and the next best values are underlined.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Comparison of AUC, AUPR, Acc and F1-score obtained by each method based on DrugVirus dataset at 5-cv.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Methods</th>
<th align="left">AUC</th>
<th align="left">AUPR</th>
<th align="left">Accuracy</th>
<th align="left">F1-score</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">GCNMDA</td>
<td align="left">0.8541 &#xb1; 0.0004</td>
<td align="left">0.8441 &#xb1; 0.0006</td>
<td align="left">0.7732 &#xb1; 0.0045</td>
<td align="left">0.7912 &#xb1; 0.0007</td>
</tr>
<tr>
<td align="left">HMDAKATZ</td>
<td align="left">0.5356 &#xb1; 0.0080</td>
<td align="left">0.5669 &#xb1; 0.0057</td>
<td align="left">0.5397 &#xb1; 0.0054</td>
<td align="left">0.6835 &#xb1; 0.0022</td>
</tr>
<tr>
<td align="left">LAGCN</td>
<td align="left">0.8044 &#xb1; 0.0079</td>
<td align="left">0.8460 &#xb1; 0.0076</td>
<td align="left">0.7794 &#xb1; 0.0067</td>
<td align="left">0.7744 &#xb1; 0.0055</td>
</tr>
<tr>
<td align="left">NTSHMDA</td>
<td align="left">0.7482 &#xb1; 0.0087</td>
<td align="left">0.7039 &#xb1; 0.0092</td>
<td align="left">0.6789 &#xb1; 0.0130</td>
<td align="left">0.7395 &#xb1; 0.0070</td>
</tr>
<tr>
<td align="left">SCSMDA</td>
<td align="left">
<bold>
<italic>0.8810 &#xb1; 0.0053</italic>
</bold>
</td>
<td align="left">
<inline-formula id="inf72">
<mml:math id="m93">
<mml:mrow>
<mml:mn>0.8590</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0102</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<bold>
<italic>0.8098 &#xb1; 0.0071</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.8201 &#xb1; 0.0038</italic>
</bold>
</td>
</tr>
<tr>
<td align="left">OGNNMDA</td>
<td align="left">
<inline-formula id="inf73">
<mml:math id="m94">
<mml:mrow>
<mml:mn>0.8591</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0076</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<bold>
<italic>0.8633 &#xb1; 0.0078</italic>
</bold>
</td>
<td align="left">
<inline-formula id="inf74">
<mml:math id="m95">
<mml:mrow>
<mml:mn>0.7916</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0115</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="left">
<inline-formula id="inf75">
<mml:math id="m96">
<mml:mrow>
<mml:mn>0.7990</mml:mn>
<mml:mo>&#xb1;</mml:mo>
<mml:mn>0.0077</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>&#x2009;Bold values are the best performing of all these comparison methods, and the next best values are underlined.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>
<bold>(A)</bold> ROC curves for each modeling approach based on the aBiofilm dataset 5-cv. <bold>(B)</bold> PR curves for each modeling approach based on the aBiofilm dataset 5-cv.</p>
</caption>
<graphic xlink:href="fgene-15-1370013-g004.tif"/>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>
<bold>(A)</bold> ROC curves for each modeling approach based on the MDAD dataset 5-cv. <bold>(B)</bold> PR curves for each modeling approach based on the MDAD dataset 5-cv.</p>
</caption>
<graphic xlink:href="fgene-15-1370013-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>
<bold>(A)</bold> ROC curves for each modeling approach based on the DrugVirus dataset 5-cv. <bold>(B)</bold> PR curves for each modeling approach based on the DrugVirus dataset 5-cv.</p>
</caption>
<graphic xlink:href="fgene-15-1370013-g006.tif"/>
</fig>
<p>Based on the experimental results from <xref ref-type="table" rid="T2">Table 2</xref>, it is evident that OGNNMDA achieves the highest AUC values on the aBiofilm dataset, with an average AUC of 0.9693 &#xb1; 0.0008. This is 0.65% higher than the next highest AUC value of 0.9628 &#xb1; 0.0021 obtained by SCSMDA. OGNNMDA also outperforms other methods in terms of AUPR, Accuracy, and F1-Score, with values of 0.9690 &#xb1; 0.0009, 0.9141 &#xb1; 0.0031, and 0.9151 &#xb1; 0.0026, respectively.</p>
<p>Similarly, in <xref ref-type="table" rid="T3">Table 3</xref>, which presents the results on the MDAD dataset, OGNNMDA exhibits superior performance across all four evaluation metrics. The comparison between the two tables suggests that OGNNMDA performs better on the aBiofilm dataset compared to MDAD. This disparity can be attributed to the sparser nature of the data in MDAD, resulting in a smaller ratio of positive to negative samples and a more pronounced sample imbalance issue.</p>
<p>Finally, we examine the results from <xref ref-type="table" rid="T4">Table 4</xref>, which presents the performance of all methods on the DrugVirus dataset. OGNNMDA achieved the highest AUPR score with a mean value of 0.8633 &#xb1; 0.0078; however, SCS-MDA outperformed others in terms of the AUC (0.8810 &#xb1; 0.0053), Accuracy (0.8098 &#xb1; 0.0071), and F1-score (0.8201 &#xb1; 0.0038). Notably, OGNNMDA did not maintain its leading position on the DrugVirus dataset as it did on the aBiofilm and MDAD datasets. This relative underperformance may be attributed to the smaller scale of the DrugVirus dataset compared to aBiofilm and MDAD, potentially limiting OGNNMDA&#x2019;s ability to effectively train its more complex weighting parameters for optimal prediction.</p>
</sec>
<sec id="s5-3">
<title>5.3 Ablation experiment</title>
<p>To evaluate the efficacy of the ordered message-passing mechanism, this section presents ablation experiments, the results of which are presented in <xref ref-type="table" rid="T5">Table 5</xref>. In this context, GNN refers to a simple graph neural network model utilizing a mean aggregator as an encoder, while OGNN represents an enhanced ordered message-passing graph neural network model based on GNN, specifically the model proposed in this paper, OGNNMDA. The evaluation entails 5-fold cross-validation experiments on the aBiofilm and MDAD datasets, with specific parameter settings described in previous sections.</p>
<table-wrap id="T5" position="float">
<label>TABLE 5</label>
<caption>
<p>Results of ablation experiments.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Dataset</th>
<th align="left">Method</th>
<th align="left">AUC</th>
<th align="left">AUPR</th>
<th align="left">Accuracy</th>
<th align="left">F1-score</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">aBiofilm</td>
<td align="left">GNN</td>
<td align="left">0.8940 &#xb1; 0.0025</td>
<td align="left">0.9090 &#xb1; 0.0040</td>
<td align="left">0.8359 &#xb1; 0.0036</td>
<td align="left">0.8337 &#xb1; 0.0033</td>
</tr>
<tr>
<td align="left">aBiofilm</td>
<td align="left">OGNN</td>
<td align="left">
<bold>
<italic>0.9673 &#xb1; 0.0014</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9681 &#xb1; 0.0021</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9111 &#xb1; 0.0025</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9119 &#xb1; 0.0024</italic>
</bold>
</td>
</tr>
<tr>
<td align="left">MDAD</td>
<td align="left">GNN</td>
<td align="left">0.8872 &#xb1; 0.0026</td>
<td align="left">0.9027 &#xb1; 0.0037</td>
<td align="left">0.8333 &#xb1; 0.0043</td>
<td align="left">0.8334 &#xb1; 0.0035</td>
</tr>
<tr>
<td align="left">MDAD</td>
<td align="left">OGNN</td>
<td align="left">
<bold>
<italic>0.9595 &#xb1; 0.0020</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9616 &#xb1; 0.0022</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9014 &#xb1; 0.0025</italic>
</bold>
</td>
<td align="left">
<bold>
<italic>0.9013 &#xb1; 0.0027</italic>
</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>&#x2009;Bold values are the best performing on the same dataset.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>Based on the data presented in <xref ref-type="table" rid="T5">Table 5</xref>, the underlying GNN encoder exhibits poor performance on both datasets, showing a significant gap in all metrics compared to the OGNNMDA model utilizing OGNN as the encoder. Therefore, it is reasonable to conclude that the ordered message-passing mechanism effectively enhances the embedding performance of GNN, leading to improved prediction results in microbe drug association prediction.</p>
</sec>
<sec id="s5-4">
<title>5.4 Case study</title>
<p>To validate the prediction performance of OGNNMDA, case study experiments were conducted using two popular drugs and two microbes as targets. First, OGNNMDA was trained on the complete aBiofilm dataset to obtain the predicted association information neighbor matrix. Then, the top 20 most relevant objects for each target microbe and drug were filtered out. Finally, the relevant published PubMed literature was searched to validate the predicted microbe-drug association pairs against existing references. The first drug selected for the case study was ciprofloxacin, a fluorinated quinolone antibiotic, which has been extensively studied and shown to be associated with a wide range of human microbiome (<xref ref-type="bibr" rid="B44">Yayehrad et al., 2022</xref>). For instance, <xref ref-type="bibr" rid="B34">Rehman et al. (2019)</xref> demonstrated the effectiveness of amphotericin-B and 5% ciprofloxacin in blocking the growth mechanisms of <italic>Pseudomonas aeruginosa</italic> and <italic>Candida</italic> albicans. Ciprofloxacin has also shown susceptibility against <italic>Staphylococcus aureus</italic>, <italic>Staphylococcus</italic> epidermidis, <italic>Mycobacterium</italic> subspecies, <italic>Escherichia coli</italic>, and <italic>Mycobacterium tuberculosis</italic> (<xref ref-type="bibr" rid="B36">Smirnova and Oktyabrsky, 2018</xref>). The second drug chosen for the case study is moxifloxacin, a fluoroquinolone antibiotic (<xref ref-type="bibr" rid="B35">Rodr&#xed;guez-L&#xf3;pez et al., 2020</xref>), known to be associated with antibiotic-resistant bacteria (ARB) (<xref ref-type="bibr" rid="B24">Loyola-Rodriguez et al., 2018</xref>) and <italic>Listeria</italic> monocytogenes (<xref ref-type="bibr" rid="B35">Rodr&#xed;guez-L&#xf3;pez et al., 2020</xref>). The specific experimental results for the two drugs are presented in <xref ref-type="table" rid="T6">Tables 6</xref>, <xref ref-type="table" rid="T7">7</xref>, respectively. These tables provide supporting literature information for the top 20 predicted microbes associated with ciprofloxacin and moxifloxacin. Upon observing <xref ref-type="table" rid="T6">Tables 6</xref>, <xref ref-type="table" rid="T7">7</xref>, it is evident that 20 and 17 out of the top 20 predicted microbes associated with ciprofloxacin and moxifloxacin, respectively, have been validated by the available literature.</p>
<table-wrap id="T6" position="float">
<label>TABLE 6</label>
<caption>
<p>Top 20 related microbes to Ciprofloxacin predicted by OGNNMDA.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Rank</th>
<th align="left">Microbe name</th>
<th align="left">Evidence</th>
<th align="left">Rank</th>
<th align="left">Microbe name</th>
<th align="left">Evidence</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="left">
<italic>Proteus</italic> vulgaris</td>
<td align="left">PMID: 27303616</td>
<td align="left">11</td>
<td align="left">
<italic>Candida</italic> albicans</td>
<td align="left">PMID: 35404123</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">
<italic>Morganella morganii</italic>
</td>
<td align="left">PMID: 25107625</td>
<td align="left">12</td>
<td align="left">Burkholderia thailandensis</td>
<td align="left">PMID: 31404671</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">Providencia stuartii</td>
<td align="left">PMID: 23029216</td>
<td align="left">13</td>
<td align="left">
<italic>Serratia marcescens</italic>
</td>
<td align="left">PMID: 27085794</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">
<italic>Pseudomonas aeruginosa</italic>
</td>
<td align="left">PMID: 30605076</td>
<td align="left">14</td>
<td align="left">
<italic>Streptococcus</italic> mutans</td>
<td align="left">PMID: 33402618</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">Stenotrophomonas maltophilia</td>
<td align="left">PMID: 30448331</td>
<td align="left">15</td>
<td align="left">
<italic>Vibrio cholerae</italic>
</td>
<td align="left">PMID: 28270803</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">
<italic>Escherichia coli</italic>
</td>
<td align="left">PMID: 29228224</td>
<td align="left">16</td>
<td align="left">
<italic>Vibrio</italic> harveyi</td>
<td align="left">PMID: 32019500</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">
<italic>Staphylococcus aureus</italic>
</td>
<td align="left">PMID: 36499677</td>
<td align="left">17</td>
<td align="left">
<italic>Pseudomonas</italic> putida</td>
<td align="left">PMID: 19280293</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">Burkholderia pseudomallei</td>
<td align="left">PMID: 27936915</td>
<td align="left">18</td>
<td align="left">
<italic>Bacillus subtilis</italic>
</td>
<td align="left">PMID: 33218776</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">
<italic>Klebsiella pneumoniae</italic>
</td>
<td align="left">PMID: 28223459</td>
<td align="left">19</td>
<td align="left">
<italic>Staphylococcus</italic> epidermidis</td>
<td align="left">PMID: 9111541</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">
<italic>Proteus mirabilis</italic>
</td>
<td align="left">PMID: 27303616</td>
<td align="left">20</td>
<td align="left">Burkholderia cenocepacia</td>
<td align="left">PMID: 34116184</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T7" position="float">
<label>TABLE 7</label>
<caption>
<p>Top 20 related microbes to Moxifloxacin predicted by OGNNMDA.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Rank</th>
<th align="left">Microbe name</th>
<th align="left">Evidence</th>
<th align="left">Rank</th>
<th align="left">Microbe name</th>
<th align="left">Evidence</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="left">
<italic>Candida</italic> albicans</td>
<td align="left">PMID: 12121916</td>
<td align="left">11</td>
<td align="left">
<italic>Streptococcus</italic> mutans</td>
<td align="left">PMID: 29392681</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">Stenotrophomonas maltophilia</td>
<td align="left">PMID: 31748318</td>
<td align="left">12</td>
<td align="left">
<italic>Candida</italic> dubliniensis</td>
<td align="left">PMID: 30237975</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">
<italic>Pseudomonas aeruginosa</italic>
</td>
<td align="left">PMID: 31643179</td>
<td align="left">13</td>
<td align="left">
<italic>Candida</italic> parapsilosis</td>
<td align="left">PMID: 20455400</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">
<italic>Mycobacterium avium</italic>
</td>
<td align="left">PMID: 31239192</td>
<td align="left">14</td>
<td align="left">Mixed Culture of bacteria and fungus</td>
<td align="left">PMID: 31732485</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">
<italic>Candida</italic> glabrata</td>
<td align="left">PMID: 30768071</td>
<td align="left">15</td>
<td align="left">
<italic>Staphylococcus</italic> epidermidis</td>
<td align="left">PMID: 35214102</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">
<italic>Staphylococcus aureus</italic>
</td>
<td align="left">PMID: 33512346</td>
<td align="left">16</td>
<td align="left">Eikenella corrodens</td>
<td align="left">PMID: 35023367</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">
<italic>Candida tropicalis</italic>
</td>
<td align="left">PMID: 20455400</td>
<td align="left">17</td>
<td align="left">
<italic>Escherichia coli</italic>
</td>
<td align="left">PMID: 36250047</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">Burkholderia multivorans</td>
<td align="left">Unconfirmed</td>
<td align="left">18</td>
<td align="left">Burkholderia thailandensis</td>
<td align="left">Unconfirmed</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">Burkholderia cenocepacia</td>
<td align="left">PMID: 33120688</td>
<td align="left">19</td>
<td align="left">
<italic>Candida</italic> guiliermondi</td>
<td align="left">Unconfirmed</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">
<italic>Candida</italic> krusei</td>
<td align="left">PMID: 22993935</td>
<td align="left">20</td>
<td align="left">
<italic>Acinetobacter</italic> baumannii</td>
<td align="left">PMID: 12951327</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Furthermore, the first microbe selected for the case study was Aggregate Actinobacteria Accompanying Bacteria, a Gram-negative bacterium belonging to the family Pasteuriaceae (<xref ref-type="bibr" rid="B19">Krueger and Brown, 2020</xref>). It is primarily found in the oral cavity and is associated with various oral diseases and systemic infections (<xref ref-type="bibr" rid="B16">Jensen et al., 2019</xref>). In terms of its impact on human health, aggregates of Actinobacillus companionis are commonly linked to periodontal diseases, particularly aggressive forms of periodontitis. This bacterium has the ability to invade and colonize periodontal tissues, leading to inflammation, destruction of the periodontal ligament, and bone loss. Consequently, it is often found at a higher rate in individuals with severe periodontal disease. Sol et al. demonstrated that sub-killer concentrations of LL-37, Cathelicidin, and Scrambled LL-37 inhibit the biofilm formation of Actinobacillus actinomycetemcomitans and act as conditioning agents and lectins, greatly enhancing clearance by neutrophils and macrophages (<xref ref-type="bibr" rid="B37">Sol et al., 2013</xref>). Basavaraju et al. found that AHL lactonase hydrolyzes the lactone ring in the high serine portion of AHL, without affecting the rest of the signaling molecular structure. This inhibitory effect of AHL lactonase on group sensing of actinomycete aggregates has been observed (<xref ref-type="bibr" rid="B3">Basavaraju et al., 2016</xref>). The second microbe chosen for the case study was <italic>Clostridium</italic> nucleatum, a bacterium known for causing opportunistic infections and recently associated with colorectal cancer (<xref ref-type="bibr" rid="B5">Brennan and Garrett, 2019</xref>). In this study, <xref ref-type="table" rid="T8">Tables 8</xref>, <xref ref-type="table" rid="T9">9</xref> present the top 20 predicted drugs that are most relevant to Aggregate Actinobacteria Accompanying Bacteria and <italic>Clostridium</italic> nucleatum, respectively. Based on the information in the tables, 17 out of the top 20 predicted drugs for Aggregate Actinobacteria Accompanying Bacteria and 18 out of the top 20 predicted drugs for <italic>Clostridium</italic> nucleatum have been validated in the existing literature. Therefore, it can be concluded that OGNNMDA achieves satisfactory predictive performance in both microbe and drug case studies.</p>
<table-wrap id="T8" position="float">
<label>TABLE 8</label>
<caption>
<p>Top 20 drugs associated with the microbe Aggregatibacter actinomycetemcomitans predicted by OGNNMDA.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Rank</th>
<th align="left">Drug name</th>
<th align="left">Evidence</th>
<th align="left">Rank</th>
<th align="left">Drug name</th>
<th align="left">Evidence</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="left">LL-37</td>
<td align="left">PMID: 23836819</td>
<td align="left">11</td>
<td align="left">N-Acetylcysteine</td>
<td align="left">PMID: 18038907</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">Cathelicidin</td>
<td align="left">PMID: 23836819</td>
<td align="left">12</td>
<td align="left">L-Aspartate</td>
<td align="left">PMID: 10769165</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">Hamamelitannin</td>
<td align="left">PMID: 26561076</td>
<td align="left">13</td>
<td align="left">3-(2-Furylmethyl)-2-{[(5-hydroxy-1H-pyrazol-3-yl)methyl]sulfanyl}-3,5,6,7-tetrahydro-4H-cyclopenta [4,5]thieno [2,3-d]pyrimidin-4-one</td>
<td align="left">Unconfirmed</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">Scrambled LL-37</td>
<td align="left">PMID: 23836819</td>
<td align="left">14</td>
<td align="left">Curcumin</td>
<td align="left">PMID: 33065303</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">Culture supernatant of <italic>Bacillus</italic> licheniformis sp. SP1&#xa0;</td>
<td align="left">Unconfirmed</td>
<td align="left">15</td>
<td align="left">SMAP-29</td>
<td align="left">PMID: 26196513</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">Vancomycin</td>
<td align="left">PMID: 31516229</td>
<td align="left">16</td>
<td align="left">Toremifene</td>
<td align="left">PMID: 26426681</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">AHL lactonase</td>
<td align="left">PMID: 30894996</td>
<td align="left">17</td>
<td align="left">Stem extract of Acacia arabica</td>
<td align="left">PMID: 25114940</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">DispersinB-KSL-W wound gel</td>
<td align="left">Unconfirmed</td>
<td align="left">18</td>
<td align="left">Bark extract of Tamarix aphylla L</td>
<td align="left">PMID: 22963838</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">Epigallocatechin Gallate</td>
<td align="left">PMID: 33793838</td>
<td align="left">19</td>
<td align="left">Magainin-I</td>
<td align="left">PMID: 32104827</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">Farnesol</td>
<td align="left">PMID: 32808302</td>
<td align="left">20</td>
<td align="left">Patulin</td>
<td align="left">PMID: 34271147</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T9" position="float">
<label>TABLE 9</label>
<caption>
<p>Top 20 drugs associated with the microbe <italic>Fusobacterium</italic> nucleatum as predicted by OGNNMDA.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Rank</th>
<th align="left">Drug name</th>
<th align="left">Evidence</th>
<th align="left">Rank</th>
<th align="left">Drug name</th>
<th align="left">Evidence</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="left">Green tea polyphenols</td>
<td align="left">PMID: 28322293</td>
<td align="left">11</td>
<td align="left">Lactoferricin B</td>
<td align="left">PMID: 33249255</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">Bark extract of Tamarix aphylla L</td>
<td align="left">Unconfirmed</td>
<td align="left">12</td>
<td align="left">Vancomycin</td>
<td align="left">PMID: 30349083</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">Stem extract of Acacia arabica&#xa0;</td>
<td align="left">PMID: 25654035</td>
<td align="left">13</td>
<td align="left">Penicillic acid</td>
<td align="left">PMID: 10223950</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">AHL lactonase</td>
<td align="left">PMID: 32555242</td>
<td align="left">14</td>
<td align="left">LL-37</td>
<td align="left">PMID: 21220789</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">Patulin</td>
<td align="left">PMID: 26574491</td>
<td align="left">15</td>
<td align="left">Hamamelitannin&#xa0;</td>
<td align="left">PMID: 27983597</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">L-Aspartate</td>
<td align="left">PMID: 3875311</td>
<td align="left">16</td>
<td align="left">Competence Stimulating Peptide</td>
<td align="left">PMID: 36371909</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">Culture supernatant of <italic>Bacillus</italic> licheniformis sp. SP1&#xa0;</td>
<td align="left">PMID: 22730907</td>
<td align="left">17</td>
<td align="left">Cell-free supernatant of <italic>Pseudomonas</italic> fluorescens</td>
<td align="left">PMID: 36891385</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">Lys-a1</td>
<td align="left">Unconfirmed</td>
<td align="left">18</td>
<td align="left">C6-HSL</td>
<td align="left">PMID: 32555242</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">Curcumin</td>
<td align="left">PMID: 26246690</td>
<td align="left">19</td>
<td align="left">G H12</td>
<td align="left">PMID: 31389653</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">Epigallocatechin Gallate&#xa0;</td>
<td align="left">PMID: 34402021</td>
<td align="left">20</td>
<td align="left">N-Acetylcysteine</td>
<td align="left">PMID: 25568806</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s6">
<title>6 Conclusion and discussion</title>
<p>This paper proposes OGNNMDA, a novel deep learning model for predicting potential microbe-drug associations, based on graph neural networks (GNNs) with an ordered message-passing mechanism. OGNNMDA utilizes multiple sources of biological data to construct similarity features for drugs and microbes, which are combined to form a heterogeneous network containing association and similarity information. To obtain drug and microbe embeddings, a multilayer GNN with ordered message passing is employed to differentiate node neighborhood messages during the message passing stage. A bilinear decoder is then used to generate association prediction scores. The OGNNMDA methodology was subjected to a rigorous evaluation regimen, encompassing comparative experiments on the aBiofilm and MDAD datasets as well as the DrugVirus dataset, where it utilized a 5-fold cross-validation scheme. The empirical outcomes revealed that OGNNMDA surpassed the current state-of-the-art performance benchmarks on both the aBiofilm and MDAD datasets. However, in the context of the DrugVirus dataset, OGNNMDA demonstrated a commendable yet second-best performance compared to existing methods. For clarity, while comprehensive experimental evaluations including comparative analyses were conducted for the DrugVirus dataset, the ablation experiments and case studies were confined to the aBiofilm and MDAD datasets alone. Despite this, the overall results affirm OGNNMDA&#x2019;s robustness and competitive advantage in predicting potential microbe-drug associations across different datasets. The main contributions of this model can be summarized as follows.<list list-type="simple">
<list-item>
<p>1. It fully leverages additional biomedical data, such as microbe functional similarity based on microbial genomic information and drug molecular structural phase-based feature similarity.</p>
</list-item>
<list-item>
<p>2. It introduces an improved GNN model with an ordered message-passing mechanism, which achieves better embedding performance by distinguishing node neighbor messages.</p>
</list-item>
<list-item>
<p>3. The overall model outperforms existing state-of-the-art methods for predicting potential microbe-drug associations.</p>
</list-item>
</list>
</p>
<p>However, OGNNMDA is not without its limitations. The model&#x2019;s performance is contingent upon the scale of the accessible dataset; with a relatively modest-sized corpus, the inherent sparsity in the microbial-drug association adjacency matrix can potentially impede the exhaustive exploitation of the graph&#x2019;s structural information and limit the expressiveness of the learned embeddings. Furthermore, OGNNMDA homogenously handles microbial and drug nodes within the network without explicitly accounting for their distinctive patterns of interaction. In light of these challenges, future research directions can be directed towards:<list list-type="simple">
<list-item>
<p>1. Expanding Feature Representation: Augmenting the existing feature space by integrating supplementary biomedical data such as genomic sequences of microbes (<xref ref-type="bibr" rid="B11">Deng et al., 2022</xref>) and pharmacological similarity based on side effect profiles (<xref ref-type="bibr" rid="B47">Zheng et al., 2019</xref>). This enrichment could provide deeper insights into the intrinsic properties of both microorganisms and drugs, thereby enhancing the quality of the representations learned.</p>
</list-item>
<list-item>
<p>2. Addressing Sparsity Issues: Investigating innovative techniques to tackle the issue of sparse associations, which might involve adopting advanced link prediction strategies or devising specialized regularization methods that are tailored for sparse graphs. These approaches could ensure more efficient utilization of available relational information.</p>
</list-item>
<list-item>
<p>3. Adaptation of Graph Contrastive Learning: Exploring the potential benefits of incorporating graph contrastive learning (GCL) paradigms to improve the robustness and generalizability of the learned embeddings. GCL has shown promise in other domains by extracting meaningful node or graph representations from limited or unlabeled data, hence it could be a viable avenue to mitigate the impact of small datasets on OGNNMDA&#x2019;s performance (<xref ref-type="bibr" rid="B6">Cai et al., 2023</xref>).</p>
</list-item>
<list-item>
<p>4. Refinement of Message-Passing Mechanisms: Examining alternative graph neural network architectures like Graph Attention Networks (GATs) and Graph Convolutional Networks (GCNs), and refining their message-passing processes to better suit the unique characteristics of the microbial-drug association problem.</p>
</list-item>
</list>
</p>
<p>By systematically addressing these limitations and venturing into new methodological frontiers, future iterations of OGNNMDA and similar models are poised to achieve heightened accuracy and resilience in predicting microbe-drug associations, thus contributing significantly to this burgeoning research domain.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s7">
<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 id="s8">
<title>Author contributions</title>
<p>JZ: Data curation, Software, Writing&#x2013;original draft, Writing&#x2013;review and editing. LK: Writing&#x2013;review and editing. AH: Writing&#x2013;review and editing. QZ: Writing&#x2013;review and editing. DY: Writing&#x2013;review and editing. CW: Data curation, Writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This work was partly sponsored by the National Natural Science Foundation of China (No. 62272064). This work was carried out in part using computing resources at the High Performance Computing Platform of Xiangtan University.</p>
</sec>
<sec sec-type="COI-statement" id="s10">
<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="s11">
<title>Publisher&#x2019;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>Amato</surname>
<given-names>K. R.</given-names>
</name>
<name>
<surname>Mallott</surname>
<given-names>E. K.</given-names>
</name>
<name>
<surname>McDonald</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Dominy</surname>
<given-names>N. J.</given-names>
</name>
<name>
<surname>Goldberg</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Lambert</surname>
<given-names>J. E.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Convergence of human and old world monkey gut microbiomes demonstrates the importance of human ecology over phylogeny</article-title>. <source>Genome Biol.</source> <volume>20</volume>, <fpage>201</fpage>&#x2013;<lpage>212</lpage>. <pub-id pub-id-type="doi">10.1186/s13059-019-1807-z</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Andersen</surname>
<given-names>P. I.</given-names>
</name>
<name>
<surname>Ianevski</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Lysvand</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Vitkauskiene</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Oksenych</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Bj&#xf8;r&#xe5;s</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Discovery and development of safe-in-man broad-spectrum antiviral agents</article-title>. <source>Int. J. Infect. Dis.</source> <volume>93</volume>, <fpage>268</fpage>&#x2013;<lpage>276</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijid.2020.02.018</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Basavaraju</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Sisnity</surname>
<given-names>V. S.</given-names>
</name>
<name>
<surname>Palaparthy</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Addanki</surname>
<given-names>P. K.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>
<italic>Quorum</italic> quenching: signal jamming in dental plaque biofilms</article-title>. <source>J. Dent. Sci.</source> <volume>11</volume>, <fpage>349</fpage>&#x2013;<lpage>352</lpage>. <pub-id pub-id-type="doi">10.1016/j.jds.2016.02.002</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Berg</surname>
<given-names>R. V. D.</given-names>
</name>
<name>
<surname>Kipf</surname>
<given-names>T. N.</given-names>
</name>
<name>
<surname>Welling</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Graph convolutional matrix completion</article-title>. <comment>arXiv preprint arXiv:1706.02263</comment>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brennan</surname>
<given-names>C. A.</given-names>
</name>
<name>
<surname>Garrett</surname>
<given-names>W. S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Fusobacterium nucleatum&#x2014;symbiont, opportunist and oncobacterium</article-title>. <source>Nat. Rev. Microbiol.</source> <volume>17</volume>, <fpage>156</fpage>&#x2013;<lpage>166</lpage>. <pub-id pub-id-type="doi">10.1038/s41579-018-0129-6</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cai</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Ren</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Lightgcl: simple yet effective graph contrastive learning for recommendation</article-title>. <comment>arXiv preprint arXiv:2302.08191</comment>.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Catinean</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Neag</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Muntean</surname>
<given-names>D. M.</given-names>
</name>
<name>
<surname>Bocsan</surname>
<given-names>I. C.</given-names>
</name>
<name>
<surname>Buzoianu</surname>
<given-names>A. D.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>An overview on the interplay between nutraceuticals and gut microbiota</article-title>. <source>PeerJ</source> <volume>6</volume>, <fpage>e4465</fpage>. <pub-id pub-id-type="doi">10.7717/peerj.4465</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Qi</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.-G.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Learning graph normalization for graph neural networks</article-title>. <source>Neurocomputing</source> <volume>493</volume>, <fpage>613</fpage>&#x2013;<lpage>625</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2022.01.003</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Qu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Bian</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Neighborhood-based inference and restricted Boltzmann machine for microbe and drug associations prediction</article-title>. <source>PeerJ</source> <volume>10</volume>, <fpage>e13848</fpage>. <pub-id pub-id-type="doi">10.7717/peerj.13848</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cullin</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Antunes</surname>
<given-names>C. A.</given-names>
</name>
<name>
<surname>Straussman</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Stein-Thoeringer</surname>
<given-names>C. K.</given-names>
</name>
<name>
<surname>Elinav</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Microbiome and cancer</article-title>. <source>Cancer Cell</source> <volume>39</volume>, <fpage>1317</fpage>&#x2013;<lpage>1341</lpage>. <pub-id pub-id-type="doi">10.1016/j.ccell.2021.08.006</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Deng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Graph2mda: a multi-modal variational graph embedding model for predicting microbe&#x2013;drug associations</article-title>. <source>Bioinformatics</source> <volume>38</volume>, <fpage>1118</fpage>&#x2013;<lpage>1125</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btab792</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Duong</surname>
<given-names>C. T.</given-names>
</name>
<name>
<surname>Hoang</surname>
<given-names>T. D.</given-names>
</name>
<name>
<surname>Dang</surname>
<given-names>H. T. H.</given-names>
</name>
<name>
<surname>Nguyen</surname>
<given-names>Q. V. H.</given-names>
</name>
<name>
<surname>Aberer</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>On node features for graph neural networks</article-title>. <comment>
<italic>arXiv preprint arXiv:1911.08795</italic>
</comment>.</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hajiagha</surname>
<given-names>M. N.</given-names>
</name>
<name>
<surname>Taghizadeh</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Asgharzadeh</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Dao</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ganbarov</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>K&#xf6;se</surname>
<given-names>&#x15e;.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Gut microbiota and human body interactions; its impact on health: a review</article-title>. <source>Curr. Pharm. Biotechnol.</source> <volume>23</volume>, <fpage>4</fpage>&#x2013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.2174/1389201022666210104115836</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hattori</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Tanaka</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Kanehisa</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Goto</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Simcomp/subcomp: chemical structure search servers for network analyses</article-title>. <source>Nucleic acids Res.</source> <volume>38</volume>, <fpage>W652</fpage>&#x2013;<lpage>W656</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkq367</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Huan</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Quanming</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Weiwei</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Search to aggregate neighborhood for graph neural network</article-title>,&#x201d; in <conf-name>2021 IEEE 37th International Conference on Data Engineering (ICDE)</conf-name> (<publisher-name>IEEE</publisher-name>), <fpage>552</fpage>&#x2013;<lpage>563</lpage>.</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jensen</surname>
<given-names>A. B.</given-names>
</name>
<name>
<surname>Haubek</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Claesson</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Johansson</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>N&#xf8;rskov-Lauritsen</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Comprehensive antimicrobial susceptibility testing of a large collection of clinical strains of aggregatibacter actinomycetemcomitans does not identify resistance to amoxicillin</article-title>. <source>J. Clin. Periodontology</source> <volume>46</volume>, <fpage>846</fpage>&#x2013;<lpage>854</lpage>. <pub-id pub-id-type="doi">10.1111/jcpe.13148</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kamneva</surname>
<given-names>O. K.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Genome composition and phylogeny of microbes predict their co-occurrence in the environment</article-title>. <source>PLoS Comput. Biol.</source> <volume>13</volume>, <fpage>e1005366</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1005366</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Yun</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Oh</surname>
<given-names>Y. J.</given-names>
</name>
<name>
<surname>Choi</surname>
<given-names>H.-J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Mind-altering with the gut: modulation of the gut-brain axis with probiotics</article-title>. <source>J. Microbiol.</source> <volume>56</volume>, <fpage>172</fpage>&#x2013;<lpage>182</lpage>. <pub-id pub-id-type="doi">10.1007/s12275-018-8032-4</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Krueger</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Brown</surname>
<given-names>A. C.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Aggregatibacter actinomycetemcomitans leukotoxin: from mechanism to targeted anti-toxin therapeutics</article-title>. <source>Mol. oral Microbiol.</source> <volume>35</volume>, <fpage>85</fpage>&#x2013;<lpage>105</lpage>. <pub-id pub-id-type="doi">10.1111/omi.12284</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X.-M.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Deeper insights into graph convolutional networks for semi-supervised learning</article-title>. <source>Proc. AAAI Conf. Artif. Intell.</source> <volume>32</volume>. <pub-id pub-id-type="doi">10.1609/aaai.v32i1.11604</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Ji</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Towards deeper graph neural networks</article-title>,&#x201d; in <conf-name>Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery and data mining</conf-name>, <fpage>338</fpage>&#x2013;<lpage>348</lpage>.</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Long</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Predicting human microbe&#x2013;disease associations via graph attention networks with inductive matrix completion</article-title>. <source>Briefings Bioinforma.</source> <volume>22</volume>, <fpage>bbaa146</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbaa146</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Long</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kwoh</surname>
<given-names>C. K.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Predicting human microbe&#x2013;drug associations via graph convolutional network with conditional random field</article-title>. <source>Bioinformatics</source> <volume>36</volume>, <fpage>4918</fpage>&#x2013;<lpage>4927</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btaa598</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Loyola-Rodriguez</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Ponce-Diaz</surname>
<given-names>M. E.</given-names>
</name>
<name>
<surname>Loyola-Leyva</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Garcia-Cortes</surname>
<given-names>J. O.</given-names>
</name>
<name>
<surname>Medina-Solis</surname>
<given-names>C. E.</given-names>
</name>
<name>
<surname>Contreras-Ramire</surname>
<given-names>A. A.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>Determination and identification of antibiotic-resistant oral streptococci isolated from active dental infections in adults</article-title>. <source>Acta Odontol. Scand.</source> <volume>76</volume>, <fpage>229</fpage>&#x2013;<lpage>235</lpage>. <pub-id pub-id-type="doi">10.1080/00016357.2017.1405463</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Long</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Ntshmda: prediction of human microbe-disease association based on random walk by integrating network topological similarity</article-title>. <source>IEEE/ACM Trans. Comput. Biol. Bioinforma.</source> <volume>17</volume>, <fpage>1341</fpage>&#x2013;<lpage>1351</lpage>. <pub-id pub-id-type="doi">10.1109/TCBB.2018.2883041</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Gacnnmda: a computational model for predicting potential human microbe-drug associations based on graph attention network and cnn-based classifier</article-title>. <source>BMC Bioinforma.</source> <volume>24</volume>, <fpage>35</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-023-05158-7</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ogunrinola</surname>
<given-names>G. A.</given-names>
</name>
<name>
<surname>Oyewale</surname>
<given-names>J. O.</given-names>
</name>
<name>
<surname>Oshamika</surname>
<given-names>O. O.</given-names>
</name>
<name>
<surname>Olasehinde</surname>
<given-names>G. I.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>The human microbiome and its impacts on health</article-title>. <source>Int. J. Microbiol.</source> <volume>2020</volume>, <fpage>8045646</fpage>. <pub-id pub-id-type="doi">10.1155/2020/8045646</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Partula</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Mondot</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Torres</surname>
<given-names>M. J.</given-names>
</name>
<name>
<surname>Kesse-Guyot</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Deschasaux</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Assmann</surname>
<given-names>K.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Associations between usual diet and gut microbiota composition: results from the milieu int&#xe9;rieur cross-sectional study</article-title>. <source>Am. J. Clin. Nutr.</source> <volume>109</volume>, <fpage>1472</fpage>&#x2013;<lpage>1483</lpage>. <pub-id pub-id-type="doi">10.1093/ajcn/nqz029</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Paul</surname>
<given-names>S. M.</given-names>
</name>
<name>
<surname>Mytelka</surname>
<given-names>D. S.</given-names>
</name>
<name>
<surname>Dunwiddie</surname>
<given-names>C. T.</given-names>
</name>
<name>
<surname>Persinger</surname>
<given-names>C. C.</given-names>
</name>
<name>
<surname>Munos</surname>
<given-names>B. H.</given-names>
</name>
<name>
<surname>Lindborg</surname>
<given-names>S. R.</given-names>
</name>
<etal/>
</person-group> (<year>2010</year>). <article-title>How to improve R&#x26;D productivity: the pharmaceutical industry&#x27;s grand challenge</article-title>. <source>Nat. Rev. Drug Discov.</source> <volume>9</volume>, <fpage>203</fpage>&#x2013;<lpage>214</lpage>. <pub-id pub-id-type="doi">10.1038/nrd3078</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Piotrowski</surname>
<given-names>A. P.</given-names>
</name>
<name>
<surname>Napiorkowski</surname>
<given-names>J. J.</given-names>
</name>
<name>
<surname>Piotrowska</surname>
<given-names>A. E.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Impact of deep learning-based dropout on shallow neural networks applied to stream temperature modelling</article-title>. <source>Earth-Science Rev.</source> <volume>201</volume>, <fpage>103076</fpage>. <pub-id pub-id-type="doi">10.1016/j.earscirev.2019.103076</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pugazhendhi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Michael</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Prakash</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Krishnamaurthy</surname>
<given-names>P. P.</given-names>
</name>
<name>
<surname>Shanmuganathan</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Al-Dhabi</surname>
<given-names>N. A.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Antibiogram and plasmid profiling of beta-lactamase producing multi drug resistant staphylococcus aureus isolated from poultry litter</article-title>. <source>J. King Saud University-Science</source> <volume>32</volume>, <fpage>2723</fpage>&#x2013;<lpage>2727</lpage>. <pub-id pub-id-type="doi">10.1016/j.jksus.2020.06.007</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Qu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A new integrated framework for the identification of potential virus&#x2013;drug associations</article-title>. <source>Front. Microbiol.</source> <volume>14</volume>, <fpage>1179414</fpage>. <pub-id pub-id-type="doi">10.3389/fmicb.2023.1179414</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rajput</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Thakur</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sharma</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>abiofilm: a resource of anti-biofilm agents and their potential implications in targeting antibiotic drug resistance</article-title>. <source>Nucleic acids Res.</source> <volume>46</volume>, <fpage>D894</fpage>&#x2013;<lpage>D900</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkx1157</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rehman</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Patrick</surname>
<given-names>W. M.</given-names>
</name>
<name>
<surname>Lamont</surname>
<given-names>I. L.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Mechanisms of ciprofloxacin resistance in pseudomonas aeruginosa: new approaches to an old problem</article-title>. <source>J. Med. Microbiol.</source> <volume>68</volume>, <fpage>1</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1099/jmm.0.000873</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rodr&#xed;guez-L&#xf3;pez</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Rodr&#xed;guez-Herrera</surname>
<given-names>J. J.</given-names>
</name>
<name>
<surname>Cabo</surname>
<given-names>M. L.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Tracking bacteriome variation over time in listeria monocytogenes-positive foci in food industry</article-title>. <source>Int. J. food Microbiol.</source> <volume>315</volume>, <fpage>108439</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijfoodmicro.2019.108439</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Smirnova</surname>
<given-names>G. V.</given-names>
</name>
<name>
<surname>Oktyabrsky</surname>
<given-names>O. N.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Relationship between escherichia coli growth rate and bacterial susceptibility to ciprofloxacin</article-title>. <source>FEMS Microbiol. Lett.</source> <volume>365</volume>, <fpage>fnx254</fpage>. <pub-id pub-id-type="doi">10.1093/femsle/fnx254</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sol</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ginesin</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>Chaushu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Karra</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Coppenhagen-Glazer</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ginsburg</surname>
<given-names>I.</given-names>
</name>
<etal/>
</person-group> (<year>2013</year>). <article-title>Ll-37 opsonizes and inhibits biofilm formation of aggregatibacter actinomycetemcomitans at subbactericidal concentrations</article-title>. <source>Infect. Immun.</source> <volume>81</volume>, <fpage>3577</fpage>&#x2013;<lpage>3585</lpage>. <pub-id pub-id-type="doi">10.1128/IAI.01288-12</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Ordered gnn: ordering message passing to deal with heterophily and over-smoothing</article-title>. <comment>arXiv preprint arXiv:2302.01524</comment>.</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sun</surname>
<given-names>Y.-Z.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>D.-H.</given-names>
</name>
<name>
<surname>Cai</surname>
<given-names>S.-B.</given-names>
</name>
<name>
<surname>Ming</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.-Q.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Mdad: a special resource for microbe-drug associations</article-title>. <source>Front. Cell. Infect. Microbiol.</source> <volume>8</volume>, <fpage>424</fpage>. <pub-id pub-id-type="doi">10.3389/fcimb.2018.00424</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tan</surname>
<given-names>S. Z. K.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Perucho</surname>
<given-names>J. A. U.</given-names>
</name>
<name>
<surname>Chopra</surname>
<given-names>S. S.</given-names>
</name>
<name>
<surname>Vardhanabhuti</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Lim</surname>
<given-names>L. W.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Dropout in neural networks simulates the paradoxical effects of deep brain stimulation on memory</article-title>. <source>Front. Aging Neurosci.</source> <volume>12</volume>, <fpage>273</fpage>. <pub-id pub-id-type="doi">10.3389/fnagi.2020.00273</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tan</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Kuang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zeng</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Gsamda: a computational model for predicting potential microbe&#x2013;drug associations based on graph attention network and sparse autoencoder</article-title>. <source>BMC Bioinforma.</source> <volume>23</volume>, <fpage>492</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-022-05053-7</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tian</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Predicting microbe&#x2013;drug associations with structure-enhanced contrastive learning and self-paced negative sampling strategy</article-title>. <source>Briefings Bioinforma.</source> <volume>24</volume>, <fpage>bbac634</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbac634</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Kuang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zeng</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Graph convolutional neural network with multi-layer attention mechanism for predicting potential microbe-disease associations</article-title>. <source>Curr. Bioinforma.</source> <volume>18</volume>, <fpage>497</fpage>&#x2013;<lpage>508</lpage>. <pub-id pub-id-type="doi">10.2174/1574893618666230316113621</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yayehrad</surname>
<given-names>A. T.</given-names>
</name>
<name>
<surname>Wondie</surname>
<given-names>G. B.</given-names>
</name>
<name>
<surname>Marew</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Different nanotechnology approaches for ciprofloxacin delivery against multidrug-resistant microbes</article-title>. <source>Infect. Drug Resist.</source> <volume>15</volume>, <fpage>413</fpage>&#x2013;<lpage>426</lpage>. <pub-id pub-id-type="doi">10.2147/IDR.S348643</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Predicting drug&#x2013;disease associations through layer attention graph convolutional network</article-title>. <source>Briefings Bioinforma.</source> <volume>22</volume>, <fpage>bbaa243</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbaa243</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Link prediction based on graph neural networks</article-title>. <source>Adv. neural Inf. Process. Syst.</source> <volume>31</volume>. <pub-id pub-id-type="doi">10.48550/arXiv.1802.09691</pub-id>
</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Ghosh</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lan</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Inverse similarity and reliable negative samples for drug side-effect prediction</article-title>. <source>BMC Bioinforma.</source> <volume>19</volume>, <fpage>554</fpage>&#x2013;<lpage>104</lpage>. <pub-id pub-id-type="doi">10.1186/s12859-018-2563-x</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Duan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Yan</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019a</year>). &#x201c;<article-title>Prediction of microbe-drug associations based on katz measure</article-title>,&#x201d; in <conf-name>2019 IEEE international conference on bioinformatics and biomedicine (BIBM)</conf-name> (<publisher-name>IEEE</publisher-name>), <fpage>183</fpage>&#x2013;<lpage>187</lpage>.</citation>
</ref>
<ref id="B49">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Hong</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2019b</year>). &#x201c;<article-title>Predicting gene-disease associations via graph embedding and graph convolutional networks</article-title>,&#x201d; in <conf-name>2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)</conf-name> (<publisher-name>IEEE</publisher-name>), <fpage>382</fpage>&#x2013;<lpage>389</lpage>.</citation>
</ref>
</ref-list>
</back>
</article>