Artificial Intelligence-Driven Neonatal Disease Diagnosis Using Efficient Particle Swarm Fine-Tuned Dilated Recurrent Neural Net: A High-Precision Deep Learning Approach
Bibliographic record
Abstract
A kid born younger than 28 days is considered neonatal.The majority of deaths among children under five in Ethiopia are caused by neonatal mortality, which is a severe issue.Infant illness diagnosis and treatment require specialist medical resources with a wealth of experience and expertise.There are not enough of these professionals in the world, especially in low-income nations, which makes diagnosis and treatment more challenging.This paper presents an efficient particle swarm fine-tuned dilated recurrent neural net (EPASFN-DRNN) to build an artificial intelligence (AI) system of neonatal illness diagnosis.Min-max normalization refers to one of the preliminary processing steps, which is used to normalize the clinical data in order to reduce the number of unnecessary variances and enhance the quality of the input data overall.The dynamic nature of neonatal health problems must be captured, and the EPASFN-DRNN's capacity to handle sequential data and extract pertinent characteristics becomes critical.The experimental setup is implemented using the Python programming language, a versatile system to build and run deep learning (DL) models, due to its ability to extract contextual information of varying scales, which increases the capability of the model to recognize small trends in neonatal health data.The study determines the effectiveness of EPASFN-DRNN by contrasting the results with the results of the previous methods.The EPASFN-DRNN model makes predictions of neonatal diseases with a high result of 99.00, 98.60, 98.50, and 98.20 F1-score, recall, accuracy, and precision, respectively.The statistics confirm the capacity of the proposed model to diagnose patients in a correct and timely manner that would allow timely involvement of medical care and improve the health outcomes of newborns.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".