RGCNMDA: Pathway-Bridged Relational Graph Learning with Adaptive Multi-View Fusion for Human miRNA–Disease Association Prediction

Clicks: 33
ID: 326399
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #184 of 983 articles by views in BMC Bioinformatics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 983 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Abstract Motivation MicroRNAs are key post-transcriptional regulators whose dysregulation is associated with complex human diseases. Computational prediction can prioritize candidate miRNA–disease associations, but reliable evaluation is complicated by sparse labels, cold-start entities, limited biological context in bipartite graphs, and leakage when association-derived features are constructed before data splitting. Results We present RGCNMDA, a leakage-controlled multi-view framework that integrates global latent structure, local profiles and similarities, and pathway context. Within every fold, interaction profiles, GIP similarities, PCA inputs, MDMF factors, and miRNA–disease graph edges are reconstructed exclusively from training positives. Four independent factorized encoders transform the miRNA and disease interaction profiles and GIP similarities, while a fold-local MDMF branch captures global latent structure. These representations are integrated with a pathway-bridged graph containing miRNA, disease, and pathway nodes connected by six directed relation types. A relational graph convolutional network performs type- and direction-specific message passing, and node-wise gates adaptively fuse graph, MDMF, and combined profile and similarity representations before an MLP pair decoder scores candidate associations. On HMDD v4.0, RGCNMDA achieved AUCs of 0.9589, 0.9109, and 0.8836 under random, cold-disease, and cold-miRNA evaluation, respectively; on the processed independent-source RNADisease v4.0 benchmark, the corresponding values were 0.9580, 0.8446, and 0.8913. Same-protocol baseline comparisons and diagnostic analyses showed that the benefits of RGCNMDA were setting dependent, with the strongest pathway-related improvement under cold-disease evaluation. These results support the robustness of leakage-controlled multi-view learning across standard and cold-start evaluation settings. Availability and Implementation https://github.com/hnuchao/pathway-RGCNMDA
Reference Key
openalex_W7168167185 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Chao Hou, Mohamed Kone, Yang Xiang, Shulin Wang
Are you one of these authors? Claim your profile
Journal BMC Bioinformatics
Year 2026
DOI
10.1093/bioinformatics/btag620
URL
https://doi.org/10.1093/bioinformatics/btag620
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.