Artificial Neural Networks for the Prediction of Monkeypox Outbreak
Bibliographic record
Abstract
While the world is still struggling to recover from the harm caused by the widespread COVID-19 pandemic, the monkeypox virus now poses a new threat of becoming a pandemic. Although it is not as dangerous or infectious as COVID-19, new cases of the disease are nevertheless being reported daily from many countries. In this study, we have used public datasets provided by the European Centre for Disease Prevention and Control for developing a prediction model for the spread of the monkeypox outbreak to and throughout the USA, Germany, the UK, France and Canada. We have used certain effective neural network models for this purpose. The novelty of this study is that a neural network model for a time series monkeypox dataset is developed and compared with LSTM and GRU models using an adaptive moment estimation (ADAM) optimizer. The Levenberg-Marquardt (LM) learning technique is used to develop and validate a single hidden layer artificial neural network (ANN) model. Different ANN model architectures with varying numbers of hidden layer neurons were trained, and the K-fold cross-validation early stopping validation approach was employed to identify the optimum structure with the best generalization potential. In the regression analysis, our ANN model gives a good R-value of almost 99%, the LSTM model gives almost 98% and the GRU model gives almost 98%. These three model fits demonstrated that there was a good agreement between the experimental data and the forecasted values. The results of our experiments show that the ANN model performs better than the other methods on the collected monkeypox dataset in all five countries. To the best of the authors' knowledge, this is the first report that has used ANN, LSTM and GRU to predict a monkeypox outbreak in all five countries.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.002 |
| 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".