Predicting multiple types of miRNA-disease associations using adaptive weighted nonnegative tensor factorization with self-paced learning and hypergraph regularization

HPTRMF: Collaborative Matrix Factorization-Based Prediction Method for LncRNA-Disease Associations Using High-Order Perturbation and Flexible Trifactor Regularization

Existing matrix factorization methods face challenges, including the cold start problem and global nonlinear data loss during similarity learning, particularly in predicting associations between long noncoding RNAs (LncRNAs) and diseases. To overcome these issues, we introduce HPTRMF, a matrix factorization approach incorporating high-order perturbation and flexible trifactor regularization. HPTRMF constructs a high-order correlation matrix utilizing the known association matrix, leveraging high-order perturbation to effectively address the cold start problem caused by data sparsity. Additionally, HPTRMF incorporates a flexible trifactor regularization term to capture similarity information on LncRNAs and diseases, enabling the effective handling of global nonlinear data loss by capturing such data in the similarity matrix. Experimental results demonstrate the superiority of HPTRMF over nine state-of-the-art algorithms in Leave-One-Out Cross-Validation (LOOCV) and Five-Fold Cross-Validation (5-Fold CV) on three data sets.HPTRMF and data sets are available in https://github.com/Llvvvv/HPTRMF.

Kernel Bayesian logistic tensor decomposition with automatic rank determination for predicting multiple types of miRNA-disease associations

Identifying the association and corresponding types of miRNAs and diseases is crucial for studying the molecular mechanisms of disease-related miRNAs. Compared to traditional biological experiments, computational models can not only save time and reduce costs, but also discover potential associations on a large scale. Although some computational models based on tensor decomposition have been proposed, these models usually require manual specification of numerous hyperparameters, leading to a decrease in computational efficiency and generalization ability. Additionally, these linear models struggle to analyze complex, higher-order nonlinear relationships. Based on this, we propose a novel framework, KBLTDARD, to identify potential multiple types of miRNA-disease associations. Firstly, KBLTDARD extracts information from biological networks and high-order association network, and then fuses them to obtain more precise similarities of miRNAs (diseases). Secondly, we combine logistic tensor decomposition and Bayesian methods to achieve automatic hyperparameter search by introducing sparse-induced priors of multiple latent variables, and incorporate auxiliary information to improve prediction capabilities. Finally, an efficient deterministic Bayesian inference algorithm is developed to ensure computational efficiency. Experimental results on two benchmark datasets show that KBLTDARD has better Top-1 precision, Top-1 recall, and Top-1 F1 for new type predictions, and higher AUPR, AUC, and F1 values for new triplet predictions, compared to other state-of-the-art methods. Furthermore, case studies demonstrate the efficiency of KBLTDARD in predicting multiple types of miRNA-disease associations.

KDGene: knowledge graph completion for disease gene prediction using interactional tensor decomposition

The accurate identification of disease-associated genes is crucial for understanding the molecular mechanisms underlying various diseases. Most current methods focus on constructing biological networks and utilizing machine learning, particularly deep learning, to identify disease genes. However, these methods overlook complex relations among entities in biological knowledge graphs. Such information has been successfully applied in other areas of life science research, demonstrating their effectiveness. Knowledge graph embedding methods can learn the semantic information of different relations within the knowledge graphs. Nonetheless, the performance of existing representation learning techniques, when applied to domain-specific biological data, remains suboptimal. To solve these problems, we construct a biological knowledge graph centered on diseases and genes, and develop an end-to-end knowledge graph completion framework for disease gene prediction using interactional tensor decomposition named KDGene. KDGene incorporates an interaction module that bridges entity and relation embeddings within tensor decomposition, aiming to improve the representation of semantically similar concepts in specific domains and enhance the ability to accurately predict disease genes. Experimental results show that KDGene significantly outperforms state-of-the-art algorithms, whether existing disease gene prediction methods or knowledge graph embedding methods for general domains. Moreover, the comprehensive biological analysis of the predicted results further validates KDGene's capability to accurately identify new candidate genes. This work proposes a scalable knowledge graph completion framework to identify disease candidate genes, from which the results are promising to provide valuable references for further wet experiments. Data and source codes are available at https://github.com/2020MEAI/KDGene.

HGCLMDA: Predicting mRNA-Drug Sensitivity Associations via Hypergraph Contrastive Learning

The identification of drug sensitivity to mRNA interactions is crucial for drug development and disease treatment, but traditional experimental methods for verifying mRNA-drug sensitivity associations are labor-intensive and time-consuming. In this study, we present a hypergraph contrastive learning approach, HGCLMDA, to predict potential mRNA-drug sensitivity associations. HGCLMDA integrates a graph convolutional network-based method with a hypergraph convolutional network to mine high-order relationships between mRNA-drug association pairs. The proposed cross-view contrastive learning architecture improves the model's learning ability, and the inner product is used to obtain the mRNA-drug sensitivity association score. Our experiments on three mRNA-drug sensitivity association data sets show that HGCLMDA outperforms traditional graph convolutional network-based methods, graph augmentation-based contrastive learning methods, and state-of-the-art association prediction methods. The visualization experiment demonstrates the strong discrimination ability of the mRNA and drug embeddings learned by HGCLMDA, and experiments on sparse data sets showcase the performance and robustness of the method. In-depth analysis of hypergraph structures reveals a crucial role that hypergraphs play in enhancing the performance of models. The case study highlights the potential of HGCLMDA as a valuable tool for predicting mRNA-drug sensitivity associations. The interpretive analysis reveals that HGCLMDA effectively models the similarity between mRNA-mRNA and drug-drug interactions.