arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.00200cs.CRcs.LGstat.ML

KiloGrams: Very Large N-Grams for Malware Classification

Laboratory for Physical Sciences(物理科学实验室);Booz Allen Hamilton(博思艾伦汉密尔顿);U.S. Navy(美国海军);Endgame(Endgame公司);Univ. of Maryland, Baltimore County(马里兰大学巴尔的摩县分校)

Edward Raff, William Fleming, Richard Zak, Hyrum Anderson, Bill Finlayson, Charles Nicholas, Mark McLean

英文摘要:

N-grams have been a common tool for information retrieval and machine learning applications for decades. In nearly all previous works, only a few values of $n$ are tested, with $n > 6$ being exceedingly rare. Larger values of $n$ are not tested due to computational burden or the fear of overfitting. In this work, we present a method to find the top-$k$ most frequent $n$-grams that is 60$\times$ faster for small $n$, and can tackle large $n\geq1024$. Despite the unprecedented size of $n$ considered, we show how these features still have predictive ability for malware classification tasks. More important, large $n$-grams provide benefits in producing features that are interpretable by malware analysis, and can be used to create general purpose signatures compatible with industry standard tools like Yara. Furthermore, the counts of common $n$-grams in a file may be added as features to publicly available human-engineered features that rival efficacy of professionally-developed features when used to train gradient-boosted decision tree models on the EMBER dataset.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑