Intrusion Detection Model Based on Rough Set and Random Forest

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Grid and High Performance Computing Pub Date : 2022-01-01 DOI:10.4018/ijghpc.301581
Ling Zhang, Jian-Wei Zhang, Nai Mei Fan, Hao Hao Zhao
{"title":"Intrusion Detection Model Based on Rough Set and Random Forest","authors":"Ling Zhang, Jian-Wei Zhang, Nai Mei Fan, Hao Hao Zhao","doi":"10.4018/ijghpc.301581","DOIUrl":null,"url":null,"abstract":"Currently, redundant data affects the speed of intrusion detection, many intrusion detection systems (IDS) have low detection rates and high false alert rate. Focusing on these weakness, a new intrusion detection model based on rough set and random forest (RSRFID) is designed. In the intrusion detection model, rough set (RS) is used to reduce the dimension of redundant attributes; the algorithm of decision tree(DT) is improved; a random forest (RF) algorithm based on attribute significances is proposed. Finally, the simulation experiment is given on NSL-KDD and UNSW-NB15 dataset. The results show: attributes of different types of datasets are reduced using RS; the detection rate of NSL-KDD is 93.73%, the false alert rate is 1.02%; the detection rate of NSL-KDD is 98.92%, the false alert rate is 2.92%.","PeriodicalId":43565,"journal":{"name":"International Journal of Grid and High Performance Computing","volume":"40 1","pages":"1-13"},"PeriodicalIF":0.6000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Grid and High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijghpc.301581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Currently, redundant data affects the speed of intrusion detection, many intrusion detection systems (IDS) have low detection rates and high false alert rate. Focusing on these weakness, a new intrusion detection model based on rough set and random forest (RSRFID) is designed. In the intrusion detection model, rough set (RS) is used to reduce the dimension of redundant attributes; the algorithm of decision tree(DT) is improved; a random forest (RF) algorithm based on attribute significances is proposed. Finally, the simulation experiment is given on NSL-KDD and UNSW-NB15 dataset. The results show: attributes of different types of datasets are reduced using RS; the detection rate of NSL-KDD is 93.73%, the false alert rate is 1.02%; the detection rate of NSL-KDD is 98.92%, the false alert rate is 2.92%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于粗糙集和随机森林的入侵检测模型
目前,数据冗余影响了入侵检测的速度,许多入侵检测系统存在检测率低、误报率高的问题。针对这些缺点,设计了一种新的基于粗糙集和随机森林(RSRFID)的入侵检测模型。在入侵检测模型中,采用粗糙集(RS)对冗余属性进行降维;改进了决策树(DT)算法;提出了一种基于属性重要度的随机森林算法。最后,在NSL-KDD和UNSW-NB15数据集上进行了模拟实验。结果表明:利用RS对不同类型数据集的属性进行了约简;NSL-KDD的检出率为93.73%,误报率为1.02%;NSL-KDD的检出率为98.92%,误报率为2.92%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.70
自引率
10.00%
发文量
24
期刊最新文献
A Potent View on the Effects of E-Learning Pre-Cutoff Value Calculation Method for Accelerating Metric Space Outlier Detection A Security Method for Cloud Storage Using Data Classification An Energy-Efficient Multi-Channel Design for Distributed Wireless Sensor Networks On Allocation Algorithms for Manycore Systems With Network on Chip
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1