A triangle area based nearest neighbors approach to intrusion detection
作者:
Highlights:
•
摘要
Intrusion detection is a necessary step to identify unusual access or attacks to secure internal networks. In general, intrusion detection can be approached by machine learning techniques. In literature, advanced techniques by hybrid learning or ensemble methods have been considered, and related work has shown that they are superior to the models using single machine learning techniques. This paper proposes a hybrid learning model based on the triangle area based nearest neighbors (TANN) in order to detect attacks more effectively. In TANN, the k-means clustering is firstly used to obtain cluster centers corresponding to the attack classes, respectively. Then, the triangle area by two cluster centers with one data from the given dataset is calculated and formed a new feature signature of the data. Finally, the k-NN classifier is used to classify similar attacks based on the new feature represented by triangle areas. By using KDD-Cup ’99 as the simulation dataset, the experimental results show that TANN can effectively detect intrusion attacks and provide higher accuracy and detection rates, and the lower false alarm rate than three baseline models based on support vector machines, k-NN, and the hybrid centroid-based classification model by combining k-means and k-NN.
论文关键词:Intrusion detection,Machine learning,Triangle area,k-means,k-nearest neighbors,Support vector machines
论文评审过程:Received 3 December 2008, Revised 8 March 2009, Accepted 24 May 2009, Available online 3 June 2009.
论文官网地址:https://doi.org/10.1016/j.patcog.2009.05.017