Sequencegram: n-gram modeling of system calls for program based anomaly detection

N. Hubballi, S. Biswas, Sukumar Nandi
{"title":"Sequencegram: n-gram modeling of system calls for program based anomaly detection","authors":"N. Hubballi, S. Biswas, Sukumar Nandi","doi":"10.1109/COMSNETS.2011.5716416","DOIUrl":null,"url":null,"abstract":"Our contribution in this paper is two fold. First we provide preliminary investigation results establishing program based anomaly detection is effective if short system call sequences are modeled along with their occurrence frequency. Second as a consequence of this, built normal program model can tolerate some level of contamination in the training dataset. We describe an experimental system Sequencegram, designed to validate the contributions. Sequencegram model short sequences of system calls in the form of n-grams and store in a tree (for the space efficiency) called as n-gram-tree. A score known as anomaly score is associated with every short sequence (based on its occurrence frequency) which represents the probability of short sequence being anomalous. As it is generally assumed that, there is a skewed distribution of normal and abnormal sequences, more frequently occurring sequences are given lower anomaly score and vice versa. Individual n-gram anomaly score contribute to the anomaly score of a program trace.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2011.5716416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

Abstract

Our contribution in this paper is two fold. First we provide preliminary investigation results establishing program based anomaly detection is effective if short system call sequences are modeled along with their occurrence frequency. Second as a consequence of this, built normal program model can tolerate some level of contamination in the training dataset. We describe an experimental system Sequencegram, designed to validate the contributions. Sequencegram model short sequences of system calls in the form of n-grams and store in a tree (for the space efficiency) called as n-gram-tree. A score known as anomaly score is associated with every short sequence (based on its occurrence frequency) which represents the probability of short sequence being anomalous. As it is generally assumed that, there is a skewed distribution of normal and abnormal sequences, more frequently occurring sequences are given lower anomaly score and vice versa. Individual n-gram anomaly score contribute to the anomaly score of a program trace.
序列图:基于程序异常检测的系统调用的n-gram建模
我们在本文中的贡献有两个方面。首先,我们提供了初步的调查结果,证明了基于程序的异常检测是有效的,如果短系统调用序列与它们的发生频率一起建模。其次,由于这个原因,建立的正常程序模型可以容忍训练数据集中的某种程度的污染。我们描述了一个实验系统序列图,旨在验证贡献。序列图以n-gram的形式对系统调用的短序列进行建模,并存储在称为n-gram-tree的树中(为了提高空间效率)。一个被称为异常分数的分数与每个短序列相关联(基于其出现频率),它表示短序列异常的概率。由于通常认为正常序列和异常序列呈偏态分布,因此出现频率越高的序列异常得分越低,反之亦然。单个n-gram异常评分有助于程序跟踪的异常评分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信