Predicting miRNA-Disease Associations via Combining Probability Matrix Feature Decomposition With Neighbor Learning

Multiple Heterogeneous Networks Representation With Latent Space for Synthetic Lethality Prediction

Computational synthetic lethality (SL) method has become a promising strategy to identify SL gene pairs for targeted cancer therapy and cancer medicine development. Feature representation for integrating various biological networks is crutial to improve the identification performance. However, previous feature representation, such as matrix factorization and graph neural network, projects gene features onto latent variables by keeping a specific geometric metric. There is a lack of models of gene representational latent space with considerating multiple dimentionalities correlation and preserving latent geometric structures in both sample and feature spaces. Therefore, we propose a novel method to model gene Latent Space using matrix Tri-Factorization (LSTF) to obtain gene representation with embedding variables resulting from the potential interpretation of synthetic lethality. Meanwhile, manifold subspace regularization is applied to the tri-factorization to capture the geometrical manifold structure in the latent space with gene PPI functional and GO semantic embeddings. Then, SL gene pairs are identified by the reconstruction of the associations with gene representations in the latent space. The experimental results illustrate that LSTF is superior to other state-of-the-art methods. Case study demonstrate the effectiveness of the predicted SL associations.

Hybrid disease prediction approach leveraging digital twin and metaverse technologies for health consumer

Emerging from the convergence of digital twin technology and the metaverse, consumer health (MCH) is witnessing a transformative shift. The amalgamation of bioinformatics with healthcare Big Data has ushered in a new era of disease prediction models that harness comprehensive medical data, enabling the anticipation of illnesses even before the onset of symptoms. In this model, deep neural networks stand out because they improve accuracy remarkably by increasing network depth and making weight changes using gradient descent. Nonetheless, traditional methods face their own set of challenges, including the issues of gradient instability and slow training. In this case, the Broad Learning System (BLS) stands out as a good alternative. It gets around the problems with gradient descent and lets you quickly rebuild a model through incremental learning. One problem with BLS is that it has trouble extracting complex features from complex medical data. This makes it less useful in a wide range of healthcare situations. In response to these challenges, we introduce DAE-BLS, a novel hybrid model that marries Denoising AutoEncoder (DAE) noise reduction with the efficiency of BLS. This hybrid approach excels in robust feature extraction, particularly within the intricate and multifaceted world of medical data. Validation using diverse datasets yields impressive results, with accuracies reaching as high as 98.50%. DAE-BLS's ability to rapidly adapt through incremental learning holds great promise for accurate and agile disease prediction, especially within the complex and dynamic healthcare scenarios of today.

MSHGANMDA: Meta-Subgraphs Heterogeneous Graph Attention Network for miRNA-Disease Association Prediction

MicroRNAs (miRNAs) influence several biological processes involved in human disease. Biological experiments for verifying the association between miRNA and disease are always costly in terms of both money and time. Although numerous biological experiments have identified multi-types of associations between miRNAs and diseases, existing computational methods are unable to sufficiently mine the knowledge in these associations to predict unknown associations. In this study, we innovatively propose a heterogeneous graph attention network model based on meta-subgraphs (MSHGANMDA) to predict the potential miRNA-disease associations. Firstly, we define five types of meta-subgraph from the known miRNA-disease associations. Then, we use meta-subgraph attention and meta-subgraph semantic attention to extract features of miRNA-disease pairs within and between these five meta-subgraphs, respectively. Finally, we apply a fully-connected layer (FCL) to predict the scores of unknown miRNA-disease associations and cross-entropy loss to train our model end-to-end. To evaluate the effectiveness of MSHGANMDA, we apply five-fold cross-validation to calculate the mean values of evaluation metrics Accuracy, Precision, Recall, and F1-score as 0.8595, 0.8601, 0.8596, and 0.8595, respectively. Experiments show that our model, which primarily utilizes multi-types of miRNA-disease association data, gets the greatest ROC-AUC value of 0.934 when compared to other state-of-the-art approaches. Furthermore, through case studies, we further confirm the effectiveness of MSHGANMDA in predicting unknown diseases.

MAGCN: A Multiple Attention Graph Convolution Networks for Predicting Synthetic Lethality

Synthetic lethality (SL) is a potential cancer therapeutic strategy and drug discovery. Computational approaches to identify synthetic lethality genes have become an effective complement to wet experiments which are time consuming and costly. Graph convolutional networks (GCN) has been utilized to such prediction task as be good at capturing the neighborhood dependency in a graph. However, it is still a lack of the mechanism of aggregating the complementary neighboring information from various heterogeneous graphs. Here, we propose the Multiple Attention Graph Convolution Networks for predicting synthetic lethality (MAGCN). First, we obtain the functional similarity features and topological structure features of genes from different data sources respectively, such as Gene Ontology data and Protein-Protein Interaction. Then, graph convolutional network is utilized to accumulate the knowledge from neighbor nodes according to synthetic lethal associations. Meanwhile, we propose a multiple graphs attention model and construct a multiple graphs attention network to learn the contribution factors of different graphs to generate embedded representation by aggregating these graphs. Finally, the generated feature matrix is decoded to predict potential synthetic lethal interaction. Experimental results show that MAGCN is superior to other baseline methods. Case study demonstrates the ability of MAGCN to predict human SL gene pairs.

GCNPCA: miRNA-Disease Associations Prediction Algorithm Based on Graph Convolutional Neural Networks

A growing number of studies have confirmed the important role of microRNAs (miRNAs) in human diseases and the aberrant expression of miRNAs affects the onset and progression of human diseases. The discovery of disease-associated miRNAs as new biomarkers promote the progress of disease pathology and clinical medicine. However, only a small proportion of miRNA-disease correlations have been validated by biological experiments. And identifying miRNA-disease associations through biological experiments is both expensive and inefficient. Therefore, it is important to develop efficient and highly accurate computational methods to predict miRNA-disease associations. A miRNA-disease associations prediction algorithm based on Graph Convolutional neural Networks and Principal Component Analysis (GCNPCA) is proposed in this paper. Specifically, the deep topological structure information is extracted from the heterogeneous network composed of miRNA and disease nodes by a Graph Convolutional neural Network (GCN) with an additional attention mechanism. The internal attribute information of the nodes is obtained by the Principal Component Analysis (PCA). Then, the topological structure information and the node attribute information are combined to construct comprehensive feature descriptors. Finally, the Random Forest (RF) is used to train and classify these feature descriptors. In the five-fold cross-validation experiment, the AUC and AUPR for the GCNPCA algorithm are 0.983 and 0.988 respectively.

ISFMDA: Learning Interactions of Selected Features-Based Method for Predicting Potential MicroRNA-Disease Associations

Prediction of potential microRNA-disease associations is one of the important tasks in computational biology fields. Mining more sophisticated features can improve the performance of the prediction methods. This article proposes a novel algorithm (ISFMDA) that can effectively learn low- or high-order interactions of recursive feature elimination selected features by an extreme gradient boosting, a factorization machine, and a deep neural network. As a result, ISFMDA can obtain an area under receiver operating characteristic curve (AUROC) of 0.9342 ± 0.0007 in fivefold cross-validation tests with 51.25% of original features, which verifies the effectiveness of the methods.