Malicious Data Classification in Packet Data Network Through Hybrid Meta Deep Learning
Bibliographic record
Abstract
Advancements in wireless network technology have provided a powerful tool to boost productivity and serve as a vital communication method that overcomes the limitations of wired networks. However, because of using wireless networks, security is an increasing concern in the community. At the time of our study, people rely on machine learning techniques to create a trustworthy networking system. However, it hinders the development of a reliable network as the number of publicly available malicious data is insufficient to train a model correctly. In real life, people are not very keen to share this data as they are sensitive. In order to deal with this issue, we primarily aim to develop a solution that provides a reliable intrusion detection system despite being trained with a small amount of data. This paper proposes a novel idea of hybrid meta deep learning in detecting malicious packet data. We use a combination of Siamese and Prototypical networks where the Siamese network is used for binary classification and the Prototypical network for multi-class classification. Both approaches are based on meta learning techniques, requiring a minimal amount of data for most attack classes. Utilizing these meta learning characteristics, we could train our model with just 3000 data samples and achieve more than 90% accuracy for both meta learning tactics. Our study aims to provide a secure and trustworthy network domain that enhances communication between end users.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.005 |
| Open science | 0.006 | 0.003 |
| 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".