MFF-nDA: A Computational Model for ncRNA–Disease Association Prediction Based on Multimodule Fusion
Bibliographic record
Abstract
Noncoding RNAs(ncRNAs), including piwi-interacting RNA(piRNA), long noncoding RNA(lncRNA), microRNA(miRNA), small nucleolar RNA(snoRNA), and circular RNA(circRNA), contribute significantly to gene expression regulation and serve as key factors in disease association studies and health-related exploration. Accurate prediction of ncRNA-disease associations is crucial for elucidating disease mechanisms and advancing therapeutic development. Recently, computational models based on a graph neural network have extensively emerged for identifying associations among various ncRNAs and diseases. However, existing computational models have not fully utilized integrative information on ncRNs and diseases, and reliance on GNN-based models alone may be limited in performance due to oversmoothing issues. On the other hand, existing models are mainly targeted at a specific type of ncRNA and may not be applicable to most ncRNAs. Therefore, to overcome these limitations, we propound a computational model MFF-nDA based on multimodule fusion. Specifically, we first introduce five types of similarity network information, including three types of ncRNA and two types of disease similarity information, in order to fully explore and optimize the multisource feature information on these entities. Subsequently, we establish three modules: heterogeneous network representation module based on Transformer, association network representation module based on graph convolutional network (GCN), and topological structure representation module based on graph attention network (GAT), which capture diverse features of nodes in heterogeneous networks and topological structure information reflected in association networks. The complementary effects of the three modules also help relieve the oversmoothing issue to some extent. By leveraging the multimodule fusion learning to comprehensively capture the diverse features of these entities, our model outperforms the available state-of-the-art methods, achieving an AUC greater than 0.9000 for each dataset. This demonstrates the highest predictive performance, making it a valuable tool for identifying potential ncRNA associated with diseases. The code of MFF-nDA can be accessed at https://github.com/Jack-Cxy/MFF-nDA.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".