Skip to main content

ORIGINAL RESEARCH article

Front. Microbiol.
Sec. Systems Microbiology
Volume 15 - 2024 | doi: 10.3389/fmicb.2024.1438942

Predicting Microbe-Disease Association Based on Graph Autoencoder and Inductive Matrix Completion with Multi-Similarities Fusion

Provisionally accepted
  • Guilin University of Technology, Guilin, China

The final, formatted version of the article will be published soon.

    Clinical studies have demonstrated that microbes play a crucial role in human health and disease. The identification of microbe-disease interactions can provide insights into the pathogenesis and promote the diagnosis, treatment, and prevention of disease. Although a large number of computational methods are designed to screen novel microbe-disease associations, the accurate and efficient methods are still lacking due to data inconsistence, underutilization of prior information, and model performance. In this study, we proposed an improved deep learning-based framework, named GIMMDA, to identify latent microbe-disease associations, which is based on graph autoencoder and inductive matrix completion. By co-training the information from microbe and disease space, the new representations of microbes and diseases are used to reconstruct microbe-disease association in the end-to-end framework. In particular, a similarity fusion strategy is conducted to improve prediction performance. The experimental results show that the performance of GIMMDA is competitive with that of existing state-of-the-art methods on 3 datasets (i.e., HMDAD, Disbiome, and multiMDA). In particular, it performs best with the area under the receiver operating characteristic curve (AUC) of 0.9735, 0.9156, 0.9396 on abovementioned 3 datasets, respectively. And the result also confirms that different similarity fusions can improve the prediction performance. Furthermore, case studies on two diseases, i.e., asthma and obesity, validate the effectiveness and reliability of our proposed model.

    Keywords: microbe-disease associations, network similarities, Similarity fusion, Inductive matrix completion, Graph autoencoder

    Received: 27 May 2024; Accepted: 02 Aug 2024.

    Copyright: © 2024 Shi, Huang, Lin, liu, zhang and ZHENG. 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) or licensor 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.

    * Correspondence: HUILIN ZHENG, Guilin University of Technology, Guilin, China

    Disclaimer: 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.