• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xu Mengfan, Li Xinghua, Liu Hai, Zhong Cheng, Ma Jianfeng. An Intrusion Detection Scheme Based on Semi-Supervised Learning and Information Gain Ratio[J]. Journal of Computer Research and Development, 2017, 54(10): 2255-2267. DOI: 10.7544/issn1000-1239.2017.20170456
Citation: Xu Mengfan, Li Xinghua, Liu Hai, Zhong Cheng, Ma Jianfeng. An Intrusion Detection Scheme Based on Semi-Supervised Learning and Information Gain Ratio[J]. Journal of Computer Research and Development, 2017, 54(10): 2255-2267. DOI: 10.7544/issn1000-1239.2017.20170456

An Intrusion Detection Scheme Based on Semi-Supervised Learning and Information Gain Ratio

More Information
  • Published Date: September 30, 2017
  • State-of-the-art intrusion detection schemes for unknown attacks employ machine learning techniques to identify anomaly features within network traffic data. However, due to the lack of enough training set, the difficulty of selecting features quantitatively and the dynamic change of unknown attacks, the existing schemes cannot detect unknown attacks effectually. To address this issue, an intrusion detection scheme based on semi-supervised learning and information gain ratio is proposed. In order to overcome the limited problem of training set in the training period, the semi-supervised learning algorithm is used to obtain large-scale training set with a small amount of labelled data. In the detection period, the information gain ratio is introduced to determine the impact of different features and weight voting to infer the final output label to identify unknown attacks adaptively and quantitatively, which can not only retain the information of features at utmost, but also adjust the weight of single decision tree adaptively against dynamic attacks. Extensive experiments indicate that the proposed scheme can quantitatively analyze the important network traffic features of unknown attacks and detect them by using a small amount of labelled data with no less than 91% accuracy and no more than 5% false negative rate, which have obvious advantages over existing schemes.
  • Related Articles

    [1]Cheng Haodong, Han Meng, Zhang Ni, Li Xiaojuan, Wang Le. Closed High Utility Itemsets Mining over Data Stream Based on Sliding Window Model[J]. Journal of Computer Research and Development, 2021, 58(11): 2500-2514. DOI: 10.7544/issn1000-1239.2021.20200554
    [2]Zhang Xiaojian, Wang Miao, Meng Xiaofeng. An Accurate Method for Mining top-k Frequent Pattern Under Differential Privacy[J]. Journal of Computer Research and Development, 2014, 51(1): 104-114.
    [3]Lei Xiangxin, Yang Zhiying, Huang Shaoyin, Hu Yunfa. Mining Frequent Subtree on Paging XML Data Stream[J]. Journal of Computer Research and Development, 2012, 49(9): 1926-1936.
    [4]Liao Guoqiong, Wu Lingqin, Wan Changxuan. Frequent Patterns Mining over Uncertain Data Streams Based on Probability Decay Window Model[J]. Journal of Computer Research and Development, 2012, 49(5): 1105-1115.
    [5]Zhu Ranwei, Wang Peng, and Liu Majin. Algorithm Based on Counting for Mining Frequent Items over Data Stream[J]. Journal of Computer Research and Development, 2011, 48(10): 1803-1811.
    [6]Tong Yongxin, Zhang Yuanyuan, Yuan Mei, Ma Shilong, Yu Dan, Zhao Li. An Efficient Algorithm for Mining Compressed Sequential Patterns[J]. Journal of Computer Research and Development, 2010, 47(1): 72-80.
    [7]Liu Xuejun, Xu Hongbing, Dong Yisheng, Qian Jiangbo, Wang Yongli. Mining Frequent Closed Patterns from a Sliding Window over Data Streams[J]. Journal of Computer Research and Development, 2006, 43(10): 1738-1743.
    [8]Liu Xuejun, Xu Hongbing, Dong Yisheng, Wang Yongli, Qian Jiangbo. Mining Frequent Patterns in Data Streams[J]. Journal of Computer Research and Development, 2005, 42(12): 2192-2198.
    [9]Ma Haibing, Zhang Chenghong, Zhang Jin, and Hu Yunfa. Mining Frequent Patterns Based on IS\++-Tree Model[J]. Journal of Computer Research and Development, 2005, 42(4): 588-593.
    [10]Wang Wei, Zhou Haofeng, Yuan Qingqing, Lou Yubo, and Sui Baile. Mining Frequent Patterns Based on Graph Theory[J]. Journal of Computer Research and Development, 2005, 42(2): 230-235.

Catalog

    Article views (1486) PDF downloads (1305) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return