ArticleScientific reports2026
Self-supervised learning on graphs predicts non-coding RNA and disease associations.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
Non-coding RNAs (ncRNAs) play crucial roles in regulating the initiation and progression of various cancers. Accurate identification disease-related ncRNAs would provide a unique opportunity to design better therapeutic interventions. Graph convolutional network-based methods have been proposed to identify potential ncRNA-disease associations (RDAs). However, some methods only use the graph structure and ignore the similarity information of nodes, and some methods integrate multi-source relation data which will introduce noise and have poor generalization. Learning robust node embeddings using graph convolutional network to build RDA predictive frameworks with high generalization remains a key challenge. We proposed a new RDA prediction scheme, SSLGRDA, composed of graph self-supervised learning and machine learning. Since SSLGRDA works on both heterogeneous and homogeneous graphs, we constructed ncRNA-disease heterogeneous graph based on known RDA, as well as heterogeneous graph based on known RDA, ncRNA similarities and disease similarities. For the latter, we ignored the node and edge types and treated it as homogeneous graph. Based on multiple contrastive or generate strategies, we used graph self-supervised learning to extract robust ncRNA and disease embedding to enhance the prediction ability and generalization of the model. Finally, we use machine learning methods to predict latent RDA probabilities. To evaluate model performance, we performed SSLGRDA on 9 ncRNA-disease datasets. Comprehensive experimental results show that SSLGRDA not only has good generalization, but also outperforms several state-of-the-art methods. Case studies on three ncRNA-disease datasets further demonstrate the ability of SSLGRDA in discovering potential ncRNA-disease associations.
Indexed as
Identifiers
What Socratic holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.