Ling Zhang, Jian-Wei Zhang, Nai Mei Fan, Hao Hao Zhao
{"title":"基于粗糙集和随机森林的入侵检测模型","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":"{\"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}","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}
Intrusion Detection Model Based on Rough Set and Random Forest
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%.