DS-kNN: An Intrusion Detection System Based on a Distance Sum-Based K-Nearest Neighbors

DS-kNN: An Intrusion Detection System Based on a Distance Sum-Based K-Nearest Neighbors

Redha Taguelmimt, Rachid Beghdad
Copyright: © 2021 |Pages: 14
DOI: 10.4018/IJISP.2021040107
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

On one hand, there are many proposed intrusion detection systems (IDSs) in the literature. On the other hand, many studies try to deduce the important features that can best detect attacks. This paper presents a new and an easy-to-implement approach to intrusion detection, named distance sum-based k-nearest neighbors (DS-kNN), which is an improved version of k-NN classifier. Given a data sample to classify, DS-kNN computes the distance sum of the k-nearest neighbors of the data sample in each of the possible classes of the dataset. Then, the data sample is assigned to the class having the smallest sum. The experimental results show that the DS-kNN classifier performs better than the original k-NN algorithm in terms of accuracy, detection rate, false positive, and attacks classification. The authors mainly compare DS-kNN to CANN, but also to SVM, S-NDAE, and DBN. The obtained results also show that the approach is very competitive.
Article Preview
Top

1. Introduction

Technology advances have made access to the internet an important part of people’s daily life which has led to a growing increase in the number of people connecting to the Internet. One of the most difficult challenges that come along with the technology advances is the security breaches that keep on evolving. The first step in securing networks is to define a security policy. It consists of rules to ensure that security properties (confidentiality, integrity, availability) apply to the data of the system being studied. However, it is virtually impossible to have a completely secured network and protect it from all possible attacks only with these rules. Thus, to overcome this problem, it is necessary to detect these attacks as soon as possible in order to react quickly and avoid serious damage. An intrusion detection system can identify whether network traffic behavior is normal or anomalous and alert network administrators. Intrusion detection is equivalent to a classification problem where specific analytical techniques are used to improve the accuracy of classifiers in effectively identifying the intrusive behavior. There are two main approaches to intrusion detection: Misuse detection and anomaly detection. The first approach involves looking for signatures of known attacks, and basically works by looking for abusive activities compared with all existing attacks. Anomaly detection indicates malicious activities by analyzing past activities to see if a behavior is not consistent with the normal behavior. In prior solutions, signature-based techniques were largely used to detect all the attacks captured in their signature databases, but the current situation will reach a point where the use of such techniques leads to inefficient and inaccurate detection due to the high false alarm rate. In recent years, innovative approaches including anomaly-based detection have been proposed to detect anomalies including data mining, statistical analysis and artificial intelligence techniques. There have been many recent studies that combine different data mining and machine learning techniques in order to improve detection performance. However, combining several sophisticated techniques increase the overall complexity which leads very likely to a high computational burden. On the other hand, and on a practical point of view, many benchmarks were used in literature to test and evaluate any solution dedicated to intrusion detection. KDD cup 99 (The Fifth International Conference on Knowledge Discovery and Data Mining) remains the most known of them, but, its use leads to some problems (redundant attacks, unuseful features). This is the reason why some authors focused on deducing the most important features leading to better results while using KDD cup 99. In addition, even if KDD is composed of training and testing datasets, some authors (Lin, Ke, & Tsai, 2015) used only the first dataset to train and test their contribution. This is not realistic and may lead to biased results. Therefore, in this study we propose a novel approach to intrusion detection that is based on improving the k-Nearest Neighbors (k-NN) classifier performance. Specifically, given a dataset, and a data sample to classify, the k nearest neighbors of the data sample in each possible dataset class are identified. Then, the sum of the distances between these k neighbors and the data sample is calculated for each class. At the end, the data sample is assigned to the class with the smallest distance sum. We focus mainly on comparing our contribution to the CANN (the Cluster center And Nearest Neighbors) (Lin et al., 2015) approach. Our work has been organized as follows. The related works are discussed in section 2. In section 3, the proposed approach for intrusion detection is introduced. Section 4 describes the experiments and simulation results. Finally, Section 5 concludes the paper.

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2024)
Volume 17: 1 Issue (2023)
Volume 16: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing