Bayesian Model Averaging of Bayesian Network Classifiers for Intrusion Detection

Liyuan Xiao, Yetian Chen, Carl K. Chang
{"title":"Bayesian Model Averaging of Bayesian Network Classifiers for Intrusion Detection","authors":"Liyuan Xiao, Yetian Chen, Carl K. Chang","doi":"10.1109/COMPSACW.2014.25","DOIUrl":null,"url":null,"abstract":"Bayesian network (BN) classifiers with powerful reasoning capabilities have been increasingly utilized to detect intrusion with reasonable accuracy and efficiency. However, existing BN classifiers for intrusion detection suffer two problems. First, such BN classifiers are often trained from data using heuristic methods that usually select suboptimal models. Second, the classifiers are trained using very large datasets which may be time consuming to obtain in practice. When the size of training dataset is small, the performance of a single BN classifier is significantly reduced due to its inability to represent the whole probability distribution. To alleviate these problems, we build a Bayesian classifier by Bayesian Model Averaging(BMA) over the k-best BN classifiers, called Bayesian Network Model Averaging (BNMA) classifier. We train and evaluate BNMA classifier on the NSL-KDD dataset, which is less redundant, thus more judicial than the commonly used KDD Cup 99 dataset. We show that the BNMA classifier performs significantly better in terms of detection accuracy than the Naive Bayes classifier and the BN classifier built with heuristic method. We also show that the BNMA classifier trained using a smaller dataset outperforms two other classifiers trained using a larger dataset. This also implies that the BNMA is beneficial in accelerating the detection process due to its less dependance on the potentially prolonged process of collecting large training datasets.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"59","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSACW.2014.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 59

Abstract

Bayesian network (BN) classifiers with powerful reasoning capabilities have been increasingly utilized to detect intrusion with reasonable accuracy and efficiency. However, existing BN classifiers for intrusion detection suffer two problems. First, such BN classifiers are often trained from data using heuristic methods that usually select suboptimal models. Second, the classifiers are trained using very large datasets which may be time consuming to obtain in practice. When the size of training dataset is small, the performance of a single BN classifier is significantly reduced due to its inability to represent the whole probability distribution. To alleviate these problems, we build a Bayesian classifier by Bayesian Model Averaging(BMA) over the k-best BN classifiers, called Bayesian Network Model Averaging (BNMA) classifier. We train and evaluate BNMA classifier on the NSL-KDD dataset, which is less redundant, thus more judicial than the commonly used KDD Cup 99 dataset. We show that the BNMA classifier performs significantly better in terms of detection accuracy than the Naive Bayes classifier and the BN classifier built with heuristic method. We also show that the BNMA classifier trained using a smaller dataset outperforms two other classifiers trained using a larger dataset. This also implies that the BNMA is beneficial in accelerating the detection process due to its less dependance on the potentially prolonged process of collecting large training datasets.
入侵检测中贝叶斯网络分类器的贝叶斯模型平均
贝叶斯网络(BN)分类器具有强大的推理能力,越来越多地用于以合理的精度和效率检测入侵。然而,现有的用于入侵检测的BN分类器存在两个问题。首先,这种BN分类器通常使用启发式方法从数据中训练,通常选择次优模型。其次,分类器使用非常大的数据集进行训练,这在实践中可能需要花费大量时间。当训练数据集规模较小时,单个BN分类器的性能由于无法表示整个概率分布而显著降低。为了缓解这些问题,我们在k-best BN分类器上通过贝叶斯模型平均(BMA)构建贝叶斯分类器,称为贝叶斯网络模型平均(BNMA)分类器。我们在NSL-KDD数据集上训练和评估BNMA分类器,该数据集冗余较少,因此比常用的KDD Cup 99数据集更具司法性。我们证明了BNMA分类器在检测精度方面明显优于朴素贝叶斯分类器和用启发式方法构建的BN分类器。我们还表明,使用较小数据集训练的BNMA分类器优于使用较大数据集训练的其他两个分类器。这也意味着BNMA有利于加速检测过程,因为它较少依赖于收集大型训练数据集的可能延长的过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书