Optimal feature selection based on OCS for improved malware detection in IoT networks using an ensemble classifier
Bibliographic record
Abstract
The increasing amount of IoT devices increases the size of network traffic data, causing an increase in the incidence of security breaches in IoT networks. Cybercriminals have developed malware to compromise the security of sensitive data, among other cyber threats. In the presence of inadequate and robust security mechanisms, sensitive data is prone to vulnerability. Hence, protecting data in the IoT environment is becoming a mandatory task. Various approaches have addressed malware detection using network data features. However, there is still room for improvement in developing superior techniques and utilizing more comprehensive datasets. This paper presents a novel lightweight ensemble voting classifier to detect malware traffic by deploying the best possible network data. The merits of the correlation coefficient and Opposition-Based Crow Search Algorithm (OCS) have been leveraged to compute the best possible features. Another advantage of this proposed experiment is its focus on a dataset tailored to malware traffic features. This focus enables highly accurate malware detection. After feature selection using OCS, the proposed malware classifier is trained and validated with both 5-fold and 10-fold cross-validation techniques. The tested results confirm that the presented malware classifier performs best using a minimal feature set, which is highly advantageous for IoT networks due to resource constraints.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.000 |
| 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".