COMPARATIVE ANALYSIS OF THE K-NEAREST NEIGHBOR ALGORITHM ON VARIOUS INTRUSION DETECTION DATASETS
| Autor: | Andri Agung Riyadi, Fachri Amsury, Irwansyah Saputra, Tiska Pattiasina, Jupriyanto Jupriyanto |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Jurnal Riset Informatika, Vol 4, Iss 1, Pp 127-132 (2022) |
| Druh dokumentu: | article |
| ISSN: | 2656-1743 2656-1735 |
| DOI: | 10.34288/jri.v4i1.341 |
| Popis: | Security in computer networks can be vulnerable, this is because we have weaknesses in making security policies, weak computer system configurations, or software bugs. Intrusion detection is a mechanism for securing computer networks by detecting, preventing, and blocking illegal attempts to access confidential information. The IDS mechanism is designed to protect the system and reduce the impact of damage from any attack on a computer network for violating computer security policies including availability, confidentiality, and integrity. Data mining techniques have been used to obtain useful knowledge from the use of IDS datasets. Some IDS datasets that are commonly used are Full KDD, Corrected KDD99, NSL-KDD, 10% KDD, UNSW-NB15, Caida, ADFA Windows, and UNM have been used to get the accuracy rate using the k-Nearest Neighbors algorithm (k-NN). The latest IDS dataset provided by the Canadian Institute of Cybersecurity contains most of the latest attack scenarios named the CICIDS2017 dataset. A preliminary experiment shows that the approach using the k-NN method on the CICIDS2017 dataset successfully produces the highest average value of intrusion detection accuracy than other IDS datasets. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|