Abstract
Piwi-interacting RNAs (piRNAs) are increasingly recognized as potential biomarkers for various diseases. Investig-ating the complex relationship between piRNAs and diseases through computational methods can reduce the costs and risks associated with biological experiments. Fast kernel learning (FKL) is a classical method for multi-source data fusion that is widely employed in association prediction research. However, biological networks are noisy due to the limitations of measurement technology and inherent natural variation, which can hamper the effectiveness of the network-based ideal kernel. The conventional FKL method does not address this issue. In this study, we propose a low-rank fast kernel learning (LRFKL) algorithm, which consists of low-rank representation (LRR) and the FKL algorithm. The LRFKL algorithm is designed to mitigate the effects of noise on the network-based ideal kernel. Using LRFKL, we propose a novel approach for predicting piRNA-disease associations called LKLPDA. Specifically, we first compute the similarity matrices for piRNAs and diseases. Then we use the LRFKL to fuse the similarity matrices for piRNAs and diseases separately. Finally, the LKLPDA employs AutoGluon-Tabular for predictive analysis. Computational results show that LKLPDA effectively predicts piRNA-disease associations with higher accuracy compared to previous methods. In addition, case studies confirm the reliability of the model in predicting piRNA-disease associations. Availability and implementation: The LKLPDA software and data are freely available at https://github.com/Shiqzz/LKLPDA-master.git.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE/ACM transactions on computational biology and bioinformatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.