FTLIoT: A Federated Transfer Learning Framework for Securing IoT
Bibliographic record
Abstract
The growing number of Internet of Things (IoT) applications and connected devices has increased the chance for more cyberattacks against those applications and devices and emphasized the need to protect the IoT networks. Due to the vast network and the anonymity of the internet, it has been challenging to preserve private information and communication. Although most systems implement security devices (i.e. firewalls) to avoid this, the second line of defence, Intrusion Detection Systems (IDSs), are critical in enhancing the system's security level. This paper proposed a model that combines the two machine learning techniques, Federated and Transfer Learning, to build an IDS to secure the IoT networks with less training time and enhanced performance while preserving the user's data privacy. Deep learning algorithms, namely Deep Neural Network (DNN) and Convolutional Neural Network (CNN), are used to evaluate the performance of the proposed framework on a benchmark dataset, CSE-CIC-IDS2018, and the feasibility of adopting Federated Transfer Learning (FTL) is shown in terms of performance metrics and training and fine-tuning time. The results show that the proposed technique can increase performance and decrease training time compared to the traditional machine learning techniques.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".