The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Learning to detect malicious executables in the wild
Abstract
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and encoded each as a training example using n-grams of byte codes as features. Such processing resulted in more than 255 million distinct n-grams. After selecting the most relevant n-grams for prediction, we evaluated a variety of inductive methods, including naive Bayes, decision trees, support vector machines, and boosting. Ultimately, boosted decision trees outperformed other methods with an area under the roc curve of 0.996. Results also suggest that our methodology will scale to larger collections of executables. To the best of our knowledge, ours is the only fielded application for this task developed using techniques from machine learning and data mining.
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
(1992) · Cited by 23,431
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953 · cited 1×
“Researchers have shown that ensemble methods often improve performance over single classifiers [9, 31].”
BackgroundDietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
Hand, D. J., Mannila, H., & Smyth, P. (2001) · Cited by 2,581
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
Smith, A. (2002) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(02)00058-1 · Cited by 1,700
Inductive learning algorithms and representations for text categorization
Dumais, S., Platt, J., Heckerman, D., & Sahami, M. (1998) · Proceedings of the seventh international conference on Information and knowledge management · doi:10.1145/288627.288651 · Cited by 1,461
(1982) · Cited by 1,288
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
A Bayesian Approach to Filtering Junk E-Mail
Sahami, M., Dumais, S., Heckerman, D. E., & Horvitz, E. (1998) · Cited by 1,206
Platt, J. C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0008 · Cited by 1,156
Arcing classifier (with discussion and a rejoinder by the author)
Breiman, L. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691079 · Cited by 1,105
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
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
On Relevance, Probabilistic Indexing and Information Retrieval
Maron, M. E., & Kuhns, J. L. (1960) · Journal of the ACM · doi:10.1145/321033.321035 · Cited by 907
Static Analysis of Executables to Detect Malicious Patterns
Christodorescu, M., & Jha, S. (2006) · doi:10.21236/ada449067 · Cited by 600
Information Retrieval: Algorithms and Heuristics
Grossman, D. A., & Frieder, O. (1998) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4615-5539-1 · Cited by 537
Parsons, S. (2004) · The Knowledge Engineering Review · doi:10.1017/s0269888904220203 · Cited by 520
Data Mining - Practical Machine Learning Tools and Techniques with JAVA Implementations
Witten, I. H., & Frank, E. (2000) · Cumulative Index of Computer Aided Architectural Design · Cited by 394
Attacking Malicious Code: A Report to the Infosec Research Council
McGraw, G., & Morrisett, G. (2000) · IEEE Software · doi:10.1109/52.877857 · Cited by 230
Grossman, D. A., & Frieder, O. (2004) · Springer eBooks · Cited by 197
Explicitly representing expected cost: an alternative to ROC representation
Drummond, C., & Holte, R. C. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347126 · Cited by 181
Authorship analysis: identifying the author of a program
Krsul, I., & Spafford, E. H. (1997) · Computers & Security · doi:10.1016/s0167-4048(97)00005-9 · Cited by 164
MOSS : A system for detecting software plagiarism
Aiken, A. (2004) · Medical Entomology and Zoology · Cited by 141
Software forensics: Can we track code to its authors?
Spafford, E. H., & Weeber, S. A. (1993) · Computers & Security · doi:10.1016/0167-4048(93)90055-a · Cited by 116
Software Forensics: Extending Authorship Analysis Techniques to Computer Programs
MacDonell, S. G., Buckingham, D. W., Gray, A. R., & Sallis, P. J. (2002) · Tuwhera (Auckland University of Technology) · Cited by 97
Detecting Plagiarism in Student Pascale Programs
Jankowitz, H. T. (1988) · The Computer Journal · doi:10.1093/comjnl/31.1.1 · Cited by 93
Discrimination of authorship using visualization
Kjell, B. P., Woods, W. A., & Frieder, O. (1994) · Information Processing & Management · doi:10.1016/0306-4573(94)90029-9 · Cited by 75
Software Forensics: Extending Authorship Analysis Techniques to Computer Programs
Gray, A., Sallis, P. J., & Macdonell, S. (1997) · Otago University Research Archive (University of Otago) · Cited by 34
Detecting malicious java code using virtual machine auditing
Soman, S., Krintz, C., & Vigna, G. (2003) · Cited by 15
(1996)
Cited by
A Survey on Malware Detection Using Data Mining Techniques
Ye, Y., Li, T., Adjeroh, D., & Iyengar, S. S. (2018) · ACM Computing Surveys · doi:10.1145/3073559 · Cited by 623
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
Self-citationGenerating Adversarial Malware Examples for Black-Box Attacks Based on GAN
Hu, W., & Tan, Y. (2022) · Communications in Computer and Information Science · doi:10.1007/978-981-19-8991-9_29 · Cited by 547
A Survey on Machine Learning Techniques for Cyber Security in the Last Decade
Shaukat, K., Luo, S., Varadharajan, V., Hameed, I. A., & Xu, M. (2020) · IEEE Access · doi:10.1109/access.2020.3041951 · Cited by 530
Opcode sequences as representation of executables for data-mining-based unknown malware detection
Santos, I., Brezo, F., Ugarte-Pedrero, X., & Bringas, P. G. (2013) · Information Sciences · doi:10.1016/j.ins.2011.08.020 · Cited by 442
Metadata
- Authors
- Kolter, J. Z., & Maloof, M. A.
- Venue
- Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2004-08-22
- Pages
- 470-478
- OpenAlex
- W2099053789
- Cited by
- 475
- References
- 41
- FWCI
- 10.61
- 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.