The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Malware classification with recurrent networks
Abstract
Attackers often create systems that automatically rewrite and reorder their malware to avoid detection. Typical machine learning approaches, which learn a classifier based on a handcrafted feature vector, are not sufficiently robust to such reorderings. We propose a different approach, which, similar to natural language modeling, learns the language of malware spoken through the executed instructions and extracts robust, time domain features. Echo state networks (ESNs) and recurrent neural networks (RNNs) are used for the projection stage that extracts the features. These models are trained in an unsupervised fashion. A standard classifier uses these features to detect malicious files. We explore a few variants of ESNs and RNNs for the projection stage, including Max-Pooling and Half-Frame models which we propose. The best performing hybrid model uses an ESN for the recurrent model, Max-Pooling for non-linear sampling, and logistic regression for the final classification. Compared to the standard trigram of events model, it improves the true positive rate by 98.3% at a false positive rate of 0.1%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Bidirectional recurrent neural networks
Schuster, M., & Paliwal, K. K. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650093 · Cited by 10,172 · cited 2×
“To overcome this limitation, we use a Bi-Directional model [11] which combines two separate models, one which learns by processing the events in the forward direction and the second which constructs a model by processing the events in the reverse direction.”
MethodSpeech recognition with deep recurrent neural networks
Graves, A., Mohamed, A.-R., & Hinton, G. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638947 · Cited by 8,893 · cited 2×
“Recently, researchers have demonstrated excellent results using recurrent neural networks (RNNs) on language modeling [6], online handwritten recognition and generation [7], and speech recognition [8].”
BackgroundLearning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
(2011) · Cited by 6,993
Improving neural networks by preventing co-adaptation of feature detectors
Hinton, G. E., Srivastava, N., Krizhevsky, A., Sutskever, I., & Salakhutdinov, R. R. (2012) · arXiv · doi:10.48550/arxiv.1207.0580 · Cited by 6,382
Recurrent neural network based language model
Mikolov, T., Karafiát, M., Burget, L., Černocký, J., & Khudanpur, S. (2010) · Interspeech 2010 · doi:10.21437/interspeech.2010-343 · Cited by 5,390 · cited 2×
“Recently, researchers have demonstrated excellent results using recurrent neural networks (RNNs) on language modeling [6], online handwritten recognition and generation [7], and speech recognition [8].”
BackgroundMethodOn the difficulty of training recurrent neural networks
Pascanu, R., Mikolov, T., & Bengio, Y. (2012) · arXiv · doi:10.48550/arxiv.1211.5063 · Cited by 4,310
Self-citationHarnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811
(2013) · Cited by 3,740
Generating Sequences With Recurrent Neural Networks
Graves, A. (2013) · arXiv · doi:10.48550/arxiv.1308.0850 · Cited by 2,894
Evaluation of Pooling Operations in Convolutional Architectures for Object Recognition
Scherer, D., Müller, A., & Behnke, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15825-4_10 · Cited by 1,503
Data mining methods for detection of new malicious executables
Schultz, M. G., Eskin, E., Zadok, F., & Stolfo, S. J. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924286 · Cited by 1,067
Learning to Detect and Classify Malicious Executables in the Wild
Kolter, J. Z., & Maloof, M. A. (2006) · doi:10.5555/1248547.1248646 · Cited by 562
Advances in optimizing recurrent networks
Bengio, Y., Boulanger-Lewandowski, N., & Pascanu, R. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6639349 · Cited by 469
Self-citationLarge-scale malware classification using random projections and neural networks
Dahl, G. E., Stokes, J. W., Deng, L., & Yu, D. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638293 · Cited by 439
Self-citationA Survey of Malware Detection Techniques
Idika, N. C., & Mathur, A. P. (2007) · Cited by 394
A Biologically Inspired Immune System for Computers
Kephart, J. O. (1994) · The MIT Press eBooks · doi:10.7551/mitpress/1428.003.0017 · Cited by 386
Behavior-based spyware detection
Kirda, E., Kruegel, C., Banks, G., Vigna, G., & Kemmerer, R. A. (2006) · Cited by 237
Mining specifications of malicious behavior
Christodorescu, M., Jha, S., & Kruegel, C. (2008) · India Software Engineering Conference · doi:10.1145/1342211.1342215 · Cited by 162
Using File Relationships in Malware Classification
Karampatziakis, N., Stokes, J. W., Thomas, A., & Marinescu, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37300-8_1 · Cited by 30
Self-citationPolymorphic Malware Detection Using Hierarchical Hidden Markov Model
Muhaya, F. B., Khan, M. K., & Xiang, Y. (2011) · IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · doi:10.1109/dasc.2011.47 · Cited by 15
Cited by
Towards Evaluating the Robustness of Neural Networks
Carlini, N., & Wagner, D. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.49 · Cited by 8,859
MagNet: A Two-Pronged Defense against Adversarial Examples
Meng, D., & Chen, H. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134057 · Cited by 1,006
Certified Robustness to Adversarial Examples with Differential Privacy
Lecuyer, M., Atlidakis, V., Geambasu, R., Hsu, D., & Jana, S. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00044 · Cited by 750
Automatically learning semantic features for defect prediction
Wang, S., Liu, T., & Tan, L. (2016) · Proceedings of the 38th International Conference on Software Engineering · doi:10.1145/2884781.2884804 · Cited by 689
Robust Intelligent Malware Detection Using Deep Learning
Vinayakumar, R., Alazab, M., Soman, K. P., Poornachandran, P., & Venkatraman, S. (2019) · IEEE Access · doi:10.1109/access.2019.2906934 · Cited by 577
Metadata
- Authors
- Pascanu, R., Stokes, J. W., Sanossian, H., Marinescu, M., & Thomas, A.
- Venue
- 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
- Publisher
- IEEE
- Published
- 2015-04
- Pages
- 1916-1920
- ISSN
- 1520-6149 (ISSN-L)
- OpenAlex
- W1545528966
- Cited by
- 423
- References
- 22
- FWCI
- 17.69
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.