ArticleScientific reports2024
Bidirectional recurrent neural network approach for predicting cervical cancer recurrence and survival.
Article in Scientific reports, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers, 1 of them a synthesis that pooled it.
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
5 citing papers in PubMed, 1 synthesis or guideline pooled it.
- Harnessing Machine Learning, a Subset of Artificial Intelligence, for Early Detection and Diagnosis of Type 1 Diabetes: A Systematic Review.International journal of molecular sciences · 2025Pooled it
- Preoperative prediction of cervical cancer recurrence using explainable MRI radiomics: a SHAP-Guided machine learning study.Abdominal radiology (New York) · 2026Article
- CERV-Score: A Hybrid Machine Learning Framework for Cervical Cancer Risk Prediction Using Integrated Clinical and Genomic Data.International journal of telemedicine and applications · 2026Article
- Integrative Long Non-Coding RNA Analysis and Recurrence Prediction in Cervical Cancer Using a Recurrent Neural Network.Diagnostics (Basel, Switzerland) · 2025Article
- Integrating Clinical and Transcriptomic Profiles Associated with Vitamin D to Enhance Disease-Free Survival in Cervical Cancer Recurrence Using the CatBoost Algorithm.Diagnostics (Basel, Switzerland) · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
Cervical cancer is a deadly disease in women globally. There is a greater chance of getting rid of cervical cancer in case of earliest diagnosis. But for some patients, there is a chance of recurrence. The chances of treating the Recurrence of cervical carcinoma arelimited. The main objective of a research is to find the key features that will predict the cervical cancer recurrence and survival rates accurately by utilizing a neural network that is bidirectionally recurrent. The goal is to reduce risk factors of cervical cancer recurrence by identifying genes with positive coefficients and targeting them for preventive interventions. First step is identification of risk factors for cervical carcinoma recurrence by utilising clinical attributes. This research uses following Random forest, Logistic regression, Gradient boosting and support vector machine algorithms are applied for classification. Random forest offers the maximum precision of these four techniques at 91.2%. The second step is identifying long noncoding RNA (lnRNA) gene signatures among people with cervical carcinomaby implementingHSIC model. Intended to discover biomarkers in initial cervical carcinoma clinical data from people who experienced a distant repetition that could be connected to lnRNA gene signatures and utilized for forecasting survival rates using a bidirectional recurrent neural network(Bi-RNN). The results shows that Bi-RNN model effectively forecast the cervical cancer recurrence and survival.
Indexed as
Identifiers
What OpenQuestion 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 OpenQuestion graph.