Feature Rankers to Predict Classification Performance of Unsupervised Intrusion Detectors

T. Zoppi, A. Ceccarelli, A. Bondavalli
{"title":"Feature Rankers to Predict Classification Performance of Unsupervised Intrusion Detectors","authors":"T. Zoppi, A. Ceccarelli, A. Bondavalli","doi":"10.1109/ladc53747.2021.9672586","DOIUrl":null,"url":null,"abstract":"An anomaly-based Intrusion Detection System (IDS) consists of a monitor and a binary classifier, in which monitored system indicators are fed into a Machine Learning (ML) algorithm that detects anomalies due to attacks. Building such an IDS for a target system requires first to define a strategy to monitor features, then to select and evaluate many ML algorithms to find the most suitable candidate. Noticeably, features that do not fluctuate enough when attacks happen will negatively affect detection performance. In this paper we propose a strategy to predict the classification performance of unsupervised anomaly-based intrusion detectors without any knowledge or execution of the ML algorithm. We experimentally verify that individual scores assigned to features by filter and wrapper-based feature rankers can be used to predict the classification performance of anomaly detectors. Particularly, we detail, explain and motivate how feeding scores of feature rankers into a Random Forest regressor allows predicting the value of common evaluation metrics for anomaly detectors as F1 or MCC with average of relative residuals lower than 15%, and how to take advantage of our prediction strategy in different scenarios.","PeriodicalId":376642,"journal":{"name":"2021 10th Latin-American Symposium on Dependable Computing (LADC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 10th Latin-American Symposium on Dependable Computing (LADC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ladc53747.2021.9672586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An anomaly-based Intrusion Detection System (IDS) consists of a monitor and a binary classifier, in which monitored system indicators are fed into a Machine Learning (ML) algorithm that detects anomalies due to attacks. Building such an IDS for a target system requires first to define a strategy to monitor features, then to select and evaluate many ML algorithms to find the most suitable candidate. Noticeably, features that do not fluctuate enough when attacks happen will negatively affect detection performance. In this paper we propose a strategy to predict the classification performance of unsupervised anomaly-based intrusion detectors without any knowledge or execution of the ML algorithm. We experimentally verify that individual scores assigned to features by filter and wrapper-based feature rankers can be used to predict the classification performance of anomaly detectors. Particularly, we detail, explain and motivate how feeding scores of feature rankers into a Random Forest regressor allows predicting the value of common evaluation metrics for anomaly detectors as F1 or MCC with average of relative residuals lower than 15%, and how to take advantage of our prediction strategy in different scenarios.
特征秩预测无监督入侵检测器的分类性能
基于异常的入侵检测系统(IDS)由监视器和二元分类器组成,其中被监控的系统指标被馈送到机器学习(ML)算法中,该算法检测由攻击引起的异常。为目标系统构建这样的IDS需要首先定义一个监视特征的策略,然后选择和评估许多ML算法,以找到最合适的候选算法。值得注意的是,当攻击发生时,特征波动不够大会对检测性能产生负面影响。在本文中,我们提出了一种策略来预测无监督的基于异常的入侵检测器的分类性能,而不需要任何知识或执行ML算法。我们通过实验验证了由过滤器和基于包装的特征排序器分配给特征的个体分数可以用来预测异常检测器的分类性能。特别是,我们详细说明,解释和激励如何将特征排序器的分数输入随机森林回归器,以便预测异常检测器的常见评估指标的值,如F1或MCC,平均相对残差低于15%,以及如何在不同场景中利用我们的预测策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信