首页> 外文会议>IEEE Smart World Congress >A High-Performance Intrusion Detection Method Based on Combining Supervised and Unsupervised Learning
【24h】

A High-Performance Intrusion Detection Method Based on Combining Supervised and Unsupervised Learning

机译:一种基于组合监督和无监督学习的高性能入侵检测方法

获取原文

摘要

Intrusion detection system (IDS) plays an essential role in detecting malicious attacks and illegal network access. There are many proposed approaches using machine learning and data mining techniques in IDS to solve detection problems. However, related machine learning based intrusion detection method resulted in unsatisfying performance for U2R (user-to-root) and R2L (remote-to-local) attacks. To solve this problem, this paper proposes a novel attack detection approach that combines supervised and unsupervised learning. In this approach, we first conduct a feature selecting and weighting method that based on the relevance analysis of features. Then the features' weights are applied in the proposed classifier, in which K-Means algorithm is introduced in K-NN classifier. The K-Means is utilized in the classifier to reselect and sort the nearest neighbors by measuring the distances between neighbors and centroid centers, by which way we make the K-NN classifier more robust and less sensitive to the selection of K. The experimental results based on the KDD dataset show that the proposed method not only performs well on detecting DoS, Probe and R2L attacks, it also has significant improvement for detecting U2R attacks.
机译:入侵检测系统(IDS)在检测恶意攻击和非法网络访问方面发挥着重要作用。使用IDS中的机器学习和数据挖掘技术有许多提出的方法来解决检测问题。但是,基于相关机器学习的入侵检测方法导致U2R(用户到根)和R2L(远程到本地)攻击的不满意性能。为了解决这个问题,本文提出了一种新的攻击检测方法,将监督和无监督的学习结合在一起。在这种方法中,我们首先进行基于特征的相关性分析的特征选择和加权方法。然后在所提出的分类器中应用特征的权重,其中K-MECS算法在K-NN分类器中引入。通过测量邻居和质心中心之间的距离,通过将k-nn分类器重构和对最近的邻居重构并排序最近的邻居的k-meriach,通过这种方式对k的选择更加坚固且更敏感。实验结果基于KDD数据集显示,该方法不仅在检测到DOS,探测和R2L攻击时表现不佳,对检测U2R攻击也具有显着的改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号