Advancing Network Resilience Through Data Mining and Machine Learning in Cybersecurity
Bibliographic record
Abstract
The advancement of internet technology and growing involvement in the cyber world have made us prone to cyber-attacks inducing severe damage to individuals and organizations, including financial loss, identity theft, and reputational damage. With cyber threats evolving alongside technological progress, strengthening network resilience to combat security vulnerabil-ities is crucial. This research extends cyber-crime analysis with an innovative approach, utilizing data mining to not only predict cyber incidents but to reinforce network robustness. Although there are many strategies for intrusion detection, predicting upcoming cyber threats remains an open research challenge. Hence, this research seeks to utilize temporal correlations among attack frequencies within specific time periods to predict the future severity of cyber incidents. The research aims to address the current research limitations by introducing a real-time data collection framework that will provide up-to-date cyber-attack data. A correlation was identified in the reported attack volume across consecutive time frames through collected attack data analysis. This research introduces a predictive model that forecasts the frequency of cyber-attacks within a specified time window, using a historical record of attack counts. The research includes various machine learning and deep learning methods to develop a prediction system based on multiple time frames with an over 15% improvement in accuracy compared to the conventional baseline model. Namely, our research demonstrates that cyber incidents are not entirely random, and by analyzing patterns and trends in past incidents, developed AI techniques can be used to improve cybersecurity measures and prevent future attacks.
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.004 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| 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".