• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Ren Jiadong, Liu Xinqian, Wang Qian, He Haitao, Zhao Xiaolin. An Multi-Level Intrusion Detection Method Based on KNN Outlier Detection and Random Forests[J]. Journal of Computer Research and Development, 2019, 56(3): 566-575. DOI: 10.7544/issn1000-1239.2019.20180063
Citation: Ren Jiadong, Liu Xinqian, Wang Qian, He Haitao, Zhao Xiaolin. An Multi-Level Intrusion Detection Method Based on KNN Outlier Detection and Random Forests[J]. Journal of Computer Research and Development, 2019, 56(3): 566-575. DOI: 10.7544/issn1000-1239.2019.20180063

An Multi-Level Intrusion Detection Method Based on KNN Outlier Detection and Random Forests

More Information
  • Published Date: February 28, 2019
  • Intrusion detection system can efficiently detect attack behaviors, which will do great damage for network security. Currently many intrusion detection systems have low detection rates in these abnormal behaviors Probe (probing), U2R (user to root) and R2L (remote to local). Focusing on this weakness, a new hybrid multi-level intrusion detection method is proposed to identify network data as normal or abnormal behaviors. This method contains KNN (K nearest neighbors) outlier detection algorithm and multi-level random forests (RF) model, called KNN-RF. Firstly KNN outlier detection algorithm is applied to detect and delete outliers in each category and get a small high-quality training dataset. Then according to the similarity of network traffic, a new method of the division of data categories is put forward and this division method can avoid the mutual interference of anomaly behaviors in the detection process, especially for the detecting of the attack behaviors of small traffic. Based on this division, a multi-level random forests model is constructed to detect network abnormal behaviors and improve the efficiency of detecting known and unknown attacks. The popular KDD (knowledge discovery and data mining) Cup 1999 dataset is used to evaluate the performance of the proposed method. Compared with other algorithms, the proposed method is significantly superior to other algorithms in accuracy and detection rate, and can detect Probe, U2R and R2L effectively.
  • Related Articles

    [1]Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
    [2]Zhang Tianming, Zhao Jie, Jin Lu, Chen Lu, Cao Bin, Fan Jing. Vertex Betweenness Centrality Computation Method over Temporal Graphs[J]. Journal of Computer Research and Development, 2023, 60(10): 2383-2393. DOI: 10.7544/issn1000-1239.202220650
    [3]Zhu Xia, Luo Junzhou, Song Aibo, and Dong Fang. A Multi-Dimensional Indexing for Complex Query in Cloud Computing[J]. Journal of Computer Research and Development, 2013, 50(8): 1592-1603.
    [4]Wang Zhuxiao, Hu Hong, Chen Limin, Shi Zhongzhi. Parallel Computation Techniques for Dynamic Description Logics Reasoning[J]. Journal of Computer Research and Development, 2011, 48(12): 2317-2325.
    [5]Zhang Yu, Liu Ping, Liu Yanbing, Tan Jianlong, Guo Li. Algorithmic Complexity Attacks Against WuManber[J]. Journal of Computer Research and Development, 2011, 48(8): 1381-1389.
    [6]Lu Jiyuan, Zhang Peizhao, Duan Xiaohua, Chao Hongyang. An Optimized Motion Estimation Algorithm Based on Macroblock Priorities[J]. Journal of Computer Research and Development, 2011, 48(3): 494-500.
    [7]Lin Xin, Li Shanping, Yang Zhaohui, Xu Jian. A Reasoning-Oriented Context Replacement Algorithm in Pervasive Computing[J]. Journal of Computer Research and Development, 2009, 46(4): 549-557.
    [8]Huang Han, Hao Zhifeng, Qin Yong. Time Complexity of Evolutionary Programming[J]. Journal of Computer Research and Development, 2008, 45(11): 1850-1857.
    [9]Tian Mei, Luo Siwei, Huang Yaping, and Zhao Jiali. Extracting Bottom-Up Attention Information Based on Local Complexity and Early Visual Features[J]. Journal of Computer Research and Development, 2008, 45(10): 1739-1746.
    [10]Pan Rui, Zhu Daming, and Ma Shaohan. Research on Computational Complexity and Approximation Algorithm for General Facility Location Problem[J]. Journal of Computer Research and Development, 2007, 44(5): 790-797.

Catalog

    Article views (1847) PDF downloads (639) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return