Predict Network Intruder Using Machine Learning Model and Classification
Bibliographic record
Abstract
The massive number of sensors deployed in IoT generates humongous volumes of data for a broad range of applications such as smart home, smart healthcare, smart manufacturing, smart transportation, smart grid, smart agriculture etc. Analyzing such data in order to facilitate enhanced decision making and increase productivity and accuracy is a critical process for businesses and life improving paradigm. Machine Learning would play a vital role in creating smarter techniques to predict the intruder from the dataset. It has shown remarkable results in different fields, including Network security, image recognition, information retrieval, speech recognition, natural language processing, indoor localization, physiological and psychological state detection, etc. In this regard, intrusion detection is becoming a research focus in the field of information security. In our experiment, we used the CICIDS2017 data set to predict the Network Intruder. The Canadian Institute of Cyber Security released the data set CICIDS-2017, which consists of eight separate files and includes five days’ worth of normal cum abnormal network packet data. The goal of this research is to examine relevant and significant elements of large network packets in order to increase network packet attack detection accuracy and reduce execution time. We choose important and meaningful features by applying Information Gain, ranking and grouping features based on little weight values on the CICIDS-2017 dataset; and then use Random Forest (RF), Random Tree (RT), Naive Bayes (NB), Bayes Net (BN), and J48 classifier algorithms. The findings of the experiment reveal that the amount of relevant and significant features produced by Information Gain has a substantial impact on improving detection accuracy and execution time. The Random Forest method, for example, has the best accuracy with 0.14% of negative results when using 22 relevant selected features, whereas the Random Tree classifier algorithm has a higher accuracy with 0.13% of negative results when using 52 relevant selected features but takes a longer execution time.
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.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".