MicroRNAs (miRNAs) play a vital role in regulating gene expression and various biological processes. As a result, they have been identified as effective targets for small molecule (SM) drugs in disease treatment. Heterogeneous graph inference stands as a classical approach for predicting SM-miRNA associations, showcasing commendable convergence accuracy and speed. However, most existing methods do not adequately address the inherent sparsity in SM-miRNA association networks, and imprecise SM/miRNA similarity metrics reduce the accuracy of predicting SM-miRNA associations. In this research, we proposed a heterogeneous graph inference with range constrained L-collaborative matrix factorization (HGIRCLMF) method to predict potential SM-miRNA associations. First, we computed the multi-source similarities of SM/miRNA and integrated these similarity information into a comprehensive SM/miRNA similarity. This step improved the accuracy of SM and miRNA similarity, ensuring reliability for the subsequent inference of the heterogeneity map. Second, we used a range constrained L-collaborative matrix factorization (RCLMF) model to pre-populate the SM-miRNA association matrix with missing values. In this step, we developed a novel matrix decomposition method that enhances the robustness and formative nature of SM-miRNA edges between SM networks and miRNA networks. Next, we built a well-established SM-miRNA heterogeneous network utilizing the processed biological information. Finally, HGIRCLMF used this network data to infer unknown association pair scores. We implemented four cross-validation experiments on two distinct datasets, and HGIRCLMF acquired the highest areas under the curve, surpassing six state-of-the-art computational approaches. Furthermore, we performed three case studies to validate the predictive power of our method in practical application.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1016/j.compbiolchem.2024.108078 | DOI Listing |
Alzheimers Dement
December 2024
University of Pennsylvania, Philadelphia, PA, USA.
Background: Alzheimer's disease (AD), characterized by significant brain volume reduction, is influenced by genetic predispositions related to brain volumetric phenotypes. While genome-wide association studies (GWASs) have linked brain imaging-derived phenotypes (IDPs) with AD, existing polygenic risk scores (PRSs) based models inadequately capture this relationship. We develop BrainNetScore, a network-based model enhancing AD risk prediction by integrating genetic associations between multiple brain IDPs and AD incidence.
View Article and Find Full Text PDFAlzheimers Dement
December 2024
Institute of Computational Biology, Helmholtz Zentrum München, German Research Center for Environmental Health, Neuherberg, Bavaria, Germany, Department of Psychiatry and Behavioral Sciences, Duke University, Durham, NC, USA.
Background: Despite recent breakthroughs, Alzheimer's disease (AD) remains untreatable. In addition, we are still lacking robust biomarkers for early diagnosis and promising novel targets for therapeutic intervention. To enable utilizing the entirety of molecular evidence in the discovery and prioritization of potential novel biomarkers and targets, we have developed the AD Atlas, a network-based multi-omics data integration platform.
View Article and Find Full Text PDFSci Rep
January 2025
School of Economics and Management, Beijing jiaotong University, Shandong, 264401, China.
Text Graph Representation Learning through Graph Neural Networks (TG-GNN) is a powerful approach in natural language processing and information retrieval. However, it faces challenges in computational complexity and interpretability. In this work, we propose CoGraphNet, a novel graph-based model for text classification, addressing key issues.
View Article and Find Full Text PDFSci Rep
January 2025
Guangdong Key Laboratory of Intelligent Information Processing, Shenzhen University, Shenzhen, 518060, China.
Graph neural networks (GNNs) have emerged as a prominent approach for capturing graph topology and modeling vertex-to-vertex relationships. They have been widely used in pattern recognition tasks including node and graph label prediction. However, when dealing with graphs from non-Euclidean domains, the relationships, and interdependencies between objects become more complex.
View Article and Find Full Text PDFSci Rep
January 2025
College of Information Science Technology, Hainan Normal University, Haikou, 571158, China.
MiRNAs and lncRNAs are two essential noncoding RNAs. Predicting associations between noncoding RNAs and diseases can significantly improve the accuracy of early diagnosis.With the continuous breakthroughs in artificial intelligence, researchers increasingly use deep learning methods to predict associations.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!