scholarly journals Predicting miRNA–disease associations using improved random walk with restart and integrating multiple similarities

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Van Tinh Nguyen ◽  
Thi Tu Kien Le ◽  
Khoat Than ◽  
Dang Hung Tran
Keyword(s):  
Random Walk ◽  
Heterogeneous Networks ◽  
Negative Impact ◽  
Statistical Tests ◽  
Computational Method ◽  
Random Walk With Restart ◽  
New Associations ◽  
Computer Scientists ◽  
Disease Associations ◽  
Top 40

AbstractPredicting beneficial and valuable miRNA–disease associations (MDAs) by doing biological laboratory experiments is costly and time-consuming. Proposing a forceful and meaningful computational method for predicting MDAs is essential and captivated many computer scientists in recent years. In this paper, we proposed a new computational method to predict miRNA–disease associations using improved random walk with restart and integrating multiple similarities (RWRMMDA). We used a WKNKN algorithm as a pre-processing step to solve the problem of sparsity and incompletion of data to reduce the negative impact of a large number of missing associations. Two heterogeneous networks in disease and miRNA spaces were built by integrating multiple similarity networks, respectively, and different walk probabilities could be designated to each linked neighbor node of the disease or miRNA node in line with its degree in respective networks. Finally, an improve extended random walk with restart algorithm based on miRNA similarity-based and disease similarity-based heterogeneous networks was used to calculate miRNA–disease association prediction probabilities. The experiments showed that our proposed method achieved a momentous performance with Global LOOCV AUC (Area Under Roc Curve) and AUPR (Area Under Precision-Recall Curve) values of 0.9882 and 0.9066, respectively. And the best AUC and AUPR values under fivefold cross-validation of 0.9855 and 0.8642 which are proven by statistical tests, respectively. In comparison with other previous related methods, it outperformed than NTSHMDA, PMFMDA, IMCMDA and MCLPMDA methods in both AUC and AUPR values. In case studies of Breast Neoplasms, Carcinoma Hepatocellular and Stomach Neoplasms diseases, it inferred 1, 12 and 7 new associations out of top 40 predicted associated miRNAs for each disease, respectively. All of these new inferred associations have been confirmed in different databases or literatures.

scholarly journals Inferring miRNA-disease associations using collaborative filtering and resource allocation on a tripartite graph

2021 ◽  
Vol 14 (S3) ◽  
Author(s):  
Van Tinh Nguyen ◽  
Thi Tu Kien Le ◽  
Tran Quoc Vinh Nguyen ◽  
Dang Hung Tran
Keyword(s):  
Resource Allocation ◽  
Collaborative Filtering ◽  
Open Angle Glaucoma ◽  
Imbalanced Data ◽  
New Associations ◽  
Tripartite Graph ◽  
Computer Scientists ◽  
Disease Associations ◽  
Reliable Performance ◽  
Top 40

Abstract Background Developing efficient and successful computational methods to infer potential miRNA-disease associations is urgently needed and is attracting many computer scientists in recent years. The reason is that miRNAs are involved in many important biological processes and it is tremendously expensive and time-consuming to do biological experiments to verify miRNA-disease associations. Methods In this paper, we proposed a new method to infer miRNA-disease associations using collaborative filtering and resource allocation algorithms on a miRNA-disease-lncRNA tripartite graph. It combined the collaborative filtering algorithm in CFNBC model to solve the problem of imbalanced data and the method for association prediction established multiple types of known associations among multiple objects presented in TPGLDA model. Results The experimental results showed that our proposed method achieved a reliable performance with Area Under Roc Curve (AUC) and Area Under Precision-Recall Curve (AUPR) values of 0.9788 and 0.9373, respectively, under fivefold-cross-validation experiments. It outperformed than some other previous methods such as DCSMDA and TPGLDA. Furthermore, it demonstrated the ability to derive new associations between miRNAs and diseases among 8, 19 and 14 new associations out of top 40 predicted associations in case studies of Prostatic Neoplasms, Heart Failure, and Glioma diseases, respectively. All of these new predicted associations have been confirmed by recent literatures. Besides, it could discover new associations for new diseases (or miRNAs) without any known associations as demonstrated in the case study of Open-angle glaucoma disease. Conclusion With the reliable performance to infer new associations between miRNAs and diseases as well as to discover new associations for new diseases (or miRNAs) without any known associations, our proposed method can be considered as a powerful tool to infer miRNA-disease associations.

scholarly journals Prediction of lncRNA-disease association based on a Laplace normalized random walk with restart algorithm on heterogeneous networks

2022 ◽  
Vol 23 (1) ◽  
Author(s):  
Liugen Wang ◽  
Min Shang ◽  
Qi Dai ◽  
Ping-an He
Keyword(s):  
Random Walk ◽  
Heterogeneous Networks ◽  
Global Network ◽  
Random Walk With Restart ◽  
Lncrna Gene ◽  
Similarity Network ◽  
Disease Similarity ◽  
Disease Associations ◽  
Universal Network ◽  
Gene Similarity

Abstract Background More and more evidence showed that long non-coding RNAs (lncRNAs) play important roles in the development and progression of human sophisticated diseases. Therefore, predicting human lncRNA-disease associations is a challenging and urgently task in bioinformatics to research of human sophisticated diseases. Results In the work, a global network-based computational framework called as LRWRHLDA were proposed which is a universal network-based method. Firstly, four isomorphic networks include lncRNA similarity network, disease similarity network, gene similarity network and miRNA similarity network were constructed. And then, six heterogeneous networks include known lncRNA-disease, lncRNA-gene, lncRNA-miRNA, disease-gene, disease-miRNA, and gene-miRNA associations network were applied to design a multi-layer network. Finally, the Laplace normalized random walk with restart algorithm in this global network is suggested to predict the relationship between lncRNAs and diseases. Conclusions The ten-fold cross validation is used to evaluate the performance of LRWRHLDA. As a result, LRWRHLDA achieves an AUC of 0.98402, which is higher than other compared methods. Furthermore, LRWRHLDA can predict isolated disease-related lnRNA (isolated lnRNA related disease). The results for colorectal cancer, lung adenocarcinoma, stomach cancer and breast cancer have been verified by other researches. The case studies indicated that our method is effective.

scholarly journals Biased Random Walk With Restart on Multilayer Heterogeneous Networks for MiRNA–Disease Association Prediction

2021 ◽  
Vol 12 ◽  
Author(s):  
Jia Qu ◽  
Chun-Chun Wang ◽  
Shu-Bin Cai ◽  
Wen-Di Zhao ◽  
Xiao-Long Cheng ◽  
...  
Keyword(s):  
Random Walk ◽  
Heterogeneous Networks ◽  
Disease Association ◽  
Random Walk With Restart ◽  
Candidate Mirnas ◽  
Biased Random Walk ◽  
Disease Associations ◽  
And Performance ◽  
Function Similarity ◽  
Leave One Out

Numerous experiments have proved that microRNAs (miRNAs) could be used as diagnostic biomarkers for many complex diseases. Thus, it is conceivable that predicting the unobserved associations between miRNAs and diseases is extremely significant for the medical field. Here, based on heterogeneous networks built on the information of known miRNA–disease associations, miRNA function similarity, disease semantic similarity, and Gaussian interaction profile kernel similarity for miRNAs and diseases, we developed a computing model of biased random walk with restart on multilayer heterogeneous networks for miRNA–disease association prediction (BRWRMHMDA) through enforcing degree-based biased random walk with restart (BRWR). Assessment results reflected that an AUC of 0.8310 was gained in local leave-one-out cross-validation (LOOCV), which proved the calculation algorithm’s good performance. Besides, we carried out BRWRMHMDA to prioritize candidate miRNAs for esophageal neoplasms based on HMDD v2.0. We further prioritize candidate miRNAs for breast neoplasms based on HMDD v1.0. The local LOOCV results and performance analysis of the case study all showed that the proposed model has good and stable performance.

scholarly journals Predicting LncRNA–Disease Association by a Random Walk With Restart on Multiplex and Heterogeneous Networks

2021 ◽  
Vol 12 ◽  
Author(s):  
Yuhua Yao ◽  
Binbin Ji ◽  
Yaping Lv ◽  
Ling Li ◽  
Ju Xiang ◽  
...  
Keyword(s):  
Random Walk ◽  
Heterogeneous Networks ◽  
Heterogeneous Network ◽  
Computational Models ◽  
Literature Mining ◽  
Random Walk With Restart ◽  
Disease Similarity ◽  
Disease Associations ◽  
Similarity Networks ◽  
Similarity Scores

Studies have found that long non-coding RNAs (lncRNAs) play important roles in many human biological processes, and it is critical to explore potential lncRNA–disease associations, especially cancer-associated lncRNAs. However, traditional biological experiments are costly and time-consuming, so it is of great significance to develop effective computational models. We developed a random walk algorithm with restart on multiplex and heterogeneous networks of lncRNAs and diseases to predict lncRNA–disease associations (MHRWRLDA). First, multiple disease similarity networks are constructed by using different approaches to calculate similarity scores between diseases, and multiple lncRNA similarity networks are also constructed by using different approaches to calculate similarity scores between lncRNAs. Then, a multiplex and heterogeneous network was constructed by integrating multiple disease similarity networks and multiple lncRNA similarity networks with the lncRNA–disease associations, and a random walk with restart on the multiplex and heterogeneous network was performed to predict lncRNA–disease associations. The results of Leave-One-Out cross-validation (LOOCV) showed that the value of Area under the curve (AUC) was 0.68736, which was improved compared with the classical algorithm in recent years. Finally, we confirmed a few novel predicted lncRNAs associated with specific diseases like colon cancer by literature mining. In summary, MHRWRLDA contributes to predict lncRNA–disease associations.

scholarly journals A novel target convergence set based random walk with restart for prediction of potential LncRNA-disease associations

2019 ◽  
Vol 20 (1) ◽  
Author(s):  
Jiechen Li ◽  
Xueyong Li ◽  
Xiang Feng ◽  
Bing Wang ◽  
Bihai Zhao ◽  
...  
Keyword(s):  
Random Walk ◽  
Case Studies ◽  
Computational Models ◽  
Stable State ◽  
Random Walk With Restart ◽  
Disease Network ◽  
Disease Associations ◽  
Novel Target ◽  
Comparative Results ◽  
Leave One Out

Abstract Background In recent years, lncRNAs (long-non-coding RNAs) have been proved to be closely related to the occurrence and development of many serious diseases that are seriously harmful to human health. However, most of the lncRNA-disease associations have not been found yet due to high costs and time complexity of traditional bio-experiments. Hence, it is quite urgent and necessary to establish efficient and reasonable computational models to predict potential associations between lncRNAs and diseases. Results In this manuscript, a novel prediction model called TCSRWRLD is proposed to predict potential lncRNA-disease associations based on improved random walk with restart. In TCSRWRLD, a heterogeneous lncRNA-disease network is constructed first by combining the integrated similarity of lncRNAs and the integrated similarity of diseases. And then, for each lncRNA/disease node in the newly constructed heterogeneous lncRNA-disease network, it will establish a node set called TCS (Target Convergence Set) consisting of top 100 disease/lncRNA nodes with minimum average network distances to these disease/lncRNA nodes having known associations with itself. Finally, an improved random walk with restart is implemented on the heterogeneous lncRNA-disease network to infer potential lncRNA-disease associations. The major contribution of this manuscript lies in the introduction of the concept of TCS, based on which, the velocity of convergence of TCSRWRLD can be quicken effectively, since the walker can stop its random walk while the walking probability vectors obtained by it at the nodes in TCS instead of all nodes in the whole network have reached stable state. And Simulation results show that TCSRWRLD can achieve a reliable AUC of 0.8712 in the Leave-One-Out Cross Validation (LOOCV), which outperforms previous state-of-the-art results apparently. Moreover, case studies of lung cancer and leukemia demonstrate the satisfactory prediction performance of TCSRWRLD as well. Conclusions Both comparative results and case studies have demonstrated that TCSRWRLD can achieve excellent performances in prediction of potential lncRNA-disease associations, which imply as well that TCSRWRLD may be a good addition to the research of bioinformatics in the future.

scholarly journals A scalable random walk with restart on heterogeneous networks with Apache Spark for ranking disease-causing genes using type-2 fuzzy data fusion

2019 ◽  
Author(s):  
Mehdi Joodaki ◽  
Nasser Ghadiri ◽  
Zeinab Maleki ◽  
Maryam Lotfi Shahreza
Keyword(s):  
Random Walk ◽  
Heterogeneous Networks ◽  
Heterogeneous Network ◽  
Gene Network ◽  
Parallel Execution ◽  
Apache Spark ◽  
Random Walk With Restart ◽  
Integrated Network ◽  
New Genes ◽  
Gene Similarity

AbstractPrediction and discovery of disease-causing genes are among the main missions of biology and medicine. In recent years, researchers have developed several methods based on gene/protein networks for the detection of causative genes. However, because of the presence of false positives in these networks, the results of these methods often lack accuracy and reliability. This problem can be solved by using multiple genomic sources to reduce noise in data. However, network integration can also affect the quality of the integrated network. In this paper, we present a method named RWRHN (random walk with restart on a heterogeneous network) with fuzzy fusion or RWRHN-FF. In this method, first, four gene-gene similarity networks are constructed based on different genomic sources and then integrated using the type-II fuzzy voter scheme. The resulting gene-gene network is then linked to a disease-disease similarity network, which itself is constructed by the integration of four sources, through a two-part disease-gene network. The product of this process is a reliable heterogeneous network, which is analyzed by the RWRHN algorithm. The results of the analysis with the leave-one-out cross-validation method show that RWRHN-FF outperforms both RWRHN and RWRH. The proposed method is used to predict new genes for prostate, breast, gastric and colon cancers. To reduce the algorithm run time, Apache Spark is used as a platform for parallel execution of the RWRHN algorithm on heterogeneous networks. In the test conducted on heterogeneous networks of different sizes, this solution results in faster convergence than other non-distributed modes of implementations.

scholarly journals Random Walk With Restart on Multiplex and Heterogeneous Biological Networks

2017 ◽  
Author(s):  
Alberto Valdeolivas ◽  
Laurent Tichit ◽  
Claire Navarro ◽  
Sophie Perrin ◽  
Gaëlle Odelin ◽  
...  
Keyword(s):  
Random Walk ◽  
Heterogeneous Networks ◽  
Protein Interactions ◽  
Biological Networks ◽  
Biological Molecules ◽  
Random Walk With Restart ◽  
Protein Protein Interactions ◽  
Guilt By Association ◽  
Disease Associated Genes ◽  
Leave One Out

ABSTRACTRecent years have witnessed an exponential growth in the number of identified interactions between biological molecules. These interactions are usually represented as large and complex networks, calling for the development of appropriated tools to exploit the functional information they contain. Random walk with restart is the state-of-the-art guilt-by-association approach. It explores the network vicinity of gene/protein seeds to study their functions, based on the premise that nodes related to similar functions tend to lie close to each others in the networks.In the present study, we extended the random walk with restart algorithm to multiplex and heterogeneous networks. The walk can now explore different layers of physical and functional interactions between genes and proteins, such as protein-protein interactions and co-expression associations. In addition, the walk can also jump to a network containing different sets of edges and nodes, such as phenotype similarities between diseases.We devised a leave-one-out cross-validation strategy to evaluate the algorithms abilities to predict disease-associated genes. We demonstrate the increased performances of the multiplex-heterogeneous random walk with restart as compared to several random walks on monoplex or heterogeneous networks. Overall, our framework is able to leverage the different interaction sources to outperform current approaches.Finally, we applied the algorithm to predict genes candidate for being involved in the Wiedemann-Rautenstrauch syndrome, and to explore the network vicinity of the SHORT syndrome.The source code and the software are freely available at: https://github.com/alberto-valdeolivas/RWR-MH.

scholarly journals RWRDC: Predicting Efficacious Drug Combinations in Cancer Based on Random Walk with Restart

2020 ◽  
Author(s):  
Qi Wang ◽  
Guiying Yan
Keyword(s):  
Breast Cancer ◽  
Random Walk ◽  
Complex Diseases ◽  
Drug Combinations ◽  
Computational Method ◽  
Data Sets ◽  
Random Walk With Restart ◽  
Learning Framework ◽  
Leave One Out ◽  
Efficacious Drug

Abstract(1)BackgroundCompared with monotherapy, efficacious drug combinations can increase the therapeutic effect, decrease drug resistance of experimental subjects and the side effects of drugs. Therefore, efficacious drug combinations are widely used in the treatment of complex diseases, such as various cancers. However, compared with the mathematical model and computational method, experimental screening efficacious drug combinations is time-consuming, costly, laborious, and inefficient;(2)Methodswe predicted efficacious drug combinations in cancer based on random walk with restart (RWRDC). An efficacious score can be obtained between any two individual drugs by RWRDC;(3)ResultsAs a result, we analyzed the rationality of the efficacious score first. Besides, compared with the other methods by leave-one-out cross-validation, all the Area Under Receiver Operating Characteristic Curves (AUROCs) of RWRDC were higher for data sets of breast cancer, colorectal cancer, and lung cancer. Moreover, the case study of breast cancer showed that RWRDC could discover potential efficacious drug combinations;(4)ConclusionsThese results suggest that RWRDC is a novel way to discover efficacious drug combinations in cancer, which provides new prospects for cancer treatment. Furthermore, RWRDC is a semi-supervised learning framework that can be used to predict combinations of drugs for other complex diseases.

Sign in / Sign up

Export Citation Format

Share Document