KATZNCP: a miRNA-disease association prediction model integrating KATZ algorithm and network consistency projection

被引:7
作者
Chen, Min [1 ]
Deng, Yingwei [1 ]
Li, Zejun [1 ]
Ye, Yifan [1 ]
He, Ziyi [1 ]
机构
[1] Hunan Inst Technol, Sch Comp Sci & Technol, Hengyang 421002, Peoples R China
基金
中国国家自然科学基金;
关键词
miRNA-disease associations; KATZ algorithm; Network consistency projection; DATABASE; SIMILARITY; MICRORNAS;
D O I
10.1186/s12859-023-05365-2
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
BackgroundClinical studies have shown that miRNAs are closely related to human health. The study of potential associations between miRNAs and diseases will contribute to a profound understanding of the mechanism of disease development, as well as human disease prevention and treatment. MiRNA-disease associations predicted by computational methods are the best complement to biological experiments.ResultsIn this research, a federated computational model KATZNCP was proposed on the basis of the KATZ algorithm and network consistency projection to infer the potential miRNA-disease associations. In KATZNCP, a heterogeneous network was initially constructed by integrating the known miRNA-disease association, integrated miRNA similarities, and integrated disease similarities; then, the KATZ algorithm was implemented in the heterogeneous network to obtain the estimated miRNA-disease prediction scores. Finally, the precise scores were obtained by the network consistency projection method as the final prediction results. KATZNCP achieved the reliable predictive performance in leave-one-out cross-validation (LOOCV) with an AUC value of 0.9325, which was better than the state-of-the-art comparable algorithms. Furthermore, case studies of lung neoplasms and esophageal neoplasms demonstrated the excellent predictive performance of KATZNCP.ConclusionA new computational model KATZNCP was proposed for predicting potential miRNA-drug associations based on KATZ and network consistency projections, which can effectively predict the potential miRNA-disease interactions. Therefore, KATZNCP can be used to provide guidance for future experiments.
引用
收藏
页数:20
相关论文
共 81 条
[1]   Lung cancer: some progress, but still a lot more to do [J].
不详 .
LANCET, 2019, 394 (10212) :1880-1880
[2]   Prediction of new associations between ncRNAs and diseases exploiting multi-type hierarchical clustering [J].
Barracchia, Emanuele Pio ;
Pio, Gianvito ;
D'Elia, Domenica ;
Ceci, Michelangelo .
BMC BIOINFORMATICS, 2020, 21 (01)
[3]   Similarity-based methods for potential human microRNA-disease association prediction [J].
Chen, Hailin ;
Zhang, Zuping .
BMC MEDICAL GENOMICS, 2013, 6
[4]   Bipartite Heterogeneous Network Method Based on Co-neighbor for MiRNA-Disease Association Prediction [J].
Chen, Min ;
Zhang, Yi ;
Li, Ang ;
Li, Zejun ;
Liu, Wenhua ;
Chen, Zheng .
FRONTIERS IN GENETICS, 2019, 10
[5]   A novel information diffusion method based on network consistency for identifying disease related microRNAs [J].
Chen, Min ;
Peng, Yan ;
Li, Ang ;
Li, Zejun ;
Deng, Yingwei ;
Liu, Wenhua ;
Liao, Bo ;
Dai, Chengqiu .
RSC ADVANCES, 2018, 8 (64) :36675-36690
[6]   Global Similarity Method Based on a Two-tier Random Walk for the Prediction of microRNA-Disease Association [J].
Chen, Min ;
Liao, Bo ;
Li, Zejun .
SCIENTIFIC REPORTS, 2018, 8
[7]   Uncover miRNA-Disease Association by Exploiting Global Network Similarity [J].
Chen, Min ;
Lu, Xingguo ;
Liao, Bo ;
Li, Zejun ;
Cai, Lijun ;
Gu, Changlong .
PLOS ONE, 2016, 11 (12)
[8]   Deep-belief network for predicting potential miRNA-disease associations [J].
Chen, Xing ;
Li, Tian-Hao ;
Zhao, Yan ;
Wang, Chun-Chun ;
Zhu, Chi-Chi .
BRIEFINGS IN BIOINFORMATICS, 2021, 22 (03)
[9]   NCMCMDA: miRNA-disease association prediction through neighborhood constraint matrix completion [J].
Chen, Xing ;
Sun, Lian-Gang ;
Zhao, Yan .
BRIEFINGS IN BIOINFORMATICS, 2021, 22 (01) :485-496
[10]   Potential miRNA-disease association prediction based on kernelized Bayesian matrix factorization [J].
Chen, Xing ;
Li, Shao-Xin ;
Yin, Jun ;
Wang, Chun-Chun .
GENOMICS, 2020, 112 (01) :809-819