Hide metadata

dc.contributor.authorSæbø, William Giffen
dc.date.accessioned2017-06-02T22:27:29Z
dc.date.available2017-06-02T22:27:29Z
dc.date.issued2017
dc.identifier.citationSæbø, William Giffen. Intrusion detection with the K nearest neighbour algorithm. Master thesis, University of Oslo, 2017
dc.identifier.urihttp://hdl.handle.net/10852/55544
dc.description.abstractWith the proliferation of cyber-attacks, there is an increased interest among practitioners and in academy in using Machine Learning as a defense, detection and prevention tool. In this thesis, we study the efficiency of one of the most simple and yet efficient legacy Machine Learning algorithms, namely the K-nearest-neighbour algorithm, in detecting intrusions. We investigate how different portions of training data and the value of k (i.e the number of neighbors) might affect the classification performance in three different datasets. As a benchmark dataset, we will use the KDD cup dataset, but the algorithm will also be tested on the built in IRIS dataset. The findings in the thesis demonstrate that the KNN algorithm is quite accurate in predicting attacks despite its simplicity.eng
dc.language.isoeng
dc.subjectdata mining
dc.subjectintrusion detection
dc.subjectKNN algorithm
dc.subjectmachine learning
dc.titleIntrusion detection with the K nearest neighbour algorithmeng
dc.typeMaster thesis
dc.date.updated2017-06-02T22:27:29Z
dc.creator.authorSæbø, William Giffen
dc.identifier.urnURN:NBN:no-58328
dc.type.documentMasteroppgave
dc.identifier.fulltextFulltext https://www.duo.uio.no/bitstream/handle/10852/55544/1/william-saebo-master.pdf


Files in this item

Appears in the following Collection

Hide metadata