ABSTRACT
Recent studies have revealed that long noncoding RNAs (lncRNAs) are closely linked to several human diseases, providing new opportunities for their use in detection and therapy. Many graph propagation and similarity fusion approaches can be used for predicting potential lncRNA-disease associations. However, existing similarity fusion approaches suffer from noise and self-similarity loss in the fusion process. To address these problems, a new prediction approach, termed SSMF-BLNP, based on organically combining selective similarity matrix fusion (SSMF) and bidirectional linear neighborhood label propagation (BLNP), is proposed in this paper to predict lncRNA-disease associations. In SSMF, self-similarity networks of lncRNAs and diseases are obtained by selective preprocessing and nonlinear iterative fusion. The fusion process assigns weights to each initial similarity network and introduces a unit matrix that can reduce noise and compensate for the loss of self-similarity. In BLNP, the initial lncRNA-disease associations are employed in both lncRNA and disease directions as label information for linear neighborhood label propagation. The propagation was then performed on the self-similarity network obtained from SSMF to derive the scoring matrix for predicting the relationships between lncRNAs and diseases. Experimental results showed that SSMF-BLNP performed better than seven other state of-the-art approaches. Furthermore, a case study demonstrated up to 100% and 80% accuracy in 10 lncRNAs associated with hepatocellular carcinoma and 10 lncRNAs associated with renal cell carcinoma, respectively. The source code and datasets used in this paper are available at: https://github.com/RuiBingo/SSMF-BLNP.
Subject(s)
RNA, Long Noncoding , Humans , Algorithms , Computational Biology/methods , RNA, Long Noncoding/genetics , Software , Carcinoma, Hepatocellular/genetics , Carcinoma, Renal Cell/genetics , Liver Neoplasms/genetics , Kidney Neoplasms/geneticsABSTRACT
Accumulating evidence suggests that long non-coding RNAs (lncRNAs) are associated with various complex human diseases. They can serve as disease biomarkers and hold considerable promise for the prevention and treatment of various diseases. The traditional random walk algorithms generally exclude the effect of non-neighboring nodes on random walking. In order to overcome the issue, the neighborhood constraint (NC) approach is proposed in this study for regulating the direction of the random walk by computing the effects of both neighboring nodes and non-neighboring nodes. Then the association matrix is updated by matrix multiplication for minimizing the effect of the false negative data. The heterogeneous lncRNA-disease network is finally analyzed using an unbalanced random walk method for predicting the potential lncRNA-disease associations. The LUNCRW model is therefore developed for predicting potential lncRNA-disease associations. The area under the curve (AUC) values of the LUNCRW model in leave-one-out cross-validation and five-fold cross-validation were 0.951 and 0.9486 ± 0.0011, respectively. Data from published case studies on three diseases, including squamous cell carcinoma, hepatocellular carcinoma, and renal cell carcinoma, confirmed the predictive potential of the LUNCRW model. Altogether, the findings indicated that the performance of the LUNCRW method is superior to that of existing methods in predicting potential lncRNA-disease associations.
Subject(s)
Kidney Neoplasms , RNA, Long Noncoding , Humans , RNA, Long Noncoding/genetics , Algorithms , Area Under Curve , WalkingABSTRACT
Most existing graph neural network-based methods for predicting miRNA-disease associations rely on initial association matrices to pass messages, but the sparsity of these matrices greatly limits performance. To address this issue and predict potential associations between miRNAs and diseases, we propose a method called strengthened hypergraph convolutional autoencoder (SHGAE). SHGAE leverages multiple layers of strengthened hypergraph neural networks (SHGNN) to obtain robust node embeddings. Within SHGNN, we design a strengthened hypergraph convolutional network module (SHGCN) that enhances original graph associations and reduces matrix sparsity. Additionally, SHGCN expands node receptive fields by utilizing hyperedge features as intermediaries to obtain high-order neighbor embeddings. To improve performance, we also incorporate attention-based fusion of self-embeddings and SHGCN embeddings. SHGAE predicts potential miRNA-disease associations using a multilayer perceptron as the decoder. Across multiple metrics, SHGAE outperforms other state-of-the-art methods in five-fold cross-validation. Furthermore, we evaluate SHGAE on colon and lung neoplasms cases to demonstrate its ability to predict potential associations. Notably, SHGAE also performs well in the analysis of gastric neoplasms without miRNA associations.