The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Data mining methods for detection of new malicious executables
Open accessAbstract
A serious security threat today is malicious executables, especially new, unseen malicious executables often arriving as email attachments. These new malicious executables are created at the rate of thousands every year and pose a serious security threat. Current anti-virus systems attempt to detect these new malicious programs with heuristics generated by hand. This approach is costly and oftentimes ineffective. We present a data mining framework that detects new, previously unseen malicious executables accurately and automatically. The data mining framework automatically found patterns in our data set and used these patterns to detect a set of new malicious binaries. Comparing our detection methods with a traditional signature-based method, our method more than doubles the current detection rates for new malicious executables.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
Kohavi, R. (1995) · Zenodo · doi:10.5281/zenodo.19712698 · Cited by 10,909
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Self-citationThe internet worm program: an analysis
Spafford, E. H. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/66093.66095 · Cited by 397
Liu, H. (1996) · ACM SIGART Bulletin · doi:10.1145/230062.1066049 · Cited by 369
Learning to classify text from labeled and unlabeled documents
Nigam, K., McCallum, A., Thrun, S., & Mitchell, T. M. (1998) · Cited by 327
Smooth non-parametric receiver operating characteristic (ROC) curves for continuous diagnostic tests
Zou, K. H., Hall, W. J., & Shapiro, D. E. (1997) · Statistics in Medicine · doi:10.1002/(sici)1097-0258(19971015)16:19<2143::aid-sim655>3.0.co;2-3 · Cited by 274
Learning Patterns from Unix Process Execution Traces for Intrusion Detection
Lee, W., Stolfo, S. J., & Chan, P. K. (1997) · doi:10.7916/d8b56rf2 · Cited by 268
Self-citationLearning Trees an ules with Set-val ed Features
Cohen, W. W. (1996) · Cited by 247
A short course on computer viruses
Cohen, F. B., Highland, H. J., & David, J. (1991) · Computer Fraud & Security Bulletin · doi:10.1016/0142-0496(91)90211-m · Cited by 157
Cited by
Intrusion detection by machine learning: A review
Tsai, C.-F., Hsu, Y.-F., Lin, C.-Y., & Lin, W.-Y. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.05.029 · Cited by 969
Automatic analysis of malware behavior using machine learning
Rieck, K., Trinius, P., Willems, C., & Holz, T. (2011) · Journal of Computer Security · doi:10.3233/jcs-2010-0410 · Cited by 729
A Comprehensive Review on Malware Detection Approaches
Aslan, O., & Samet, R. (2020) · IEEE Access · doi:10.1109/access.2019.2963724 · Cited by 649
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
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
Metadata
- Authors
- Schultz, M. G., Eskin, E., Zadok, F., & Stolfo, S. J.
- Venue
- Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Pages
- 38-49
- OpenAlex
- W2144112223
- Cited by
- 1,067
- References
- 9
- FWCI
- 9.12
- Type
- conference paper
- Language
- en
- Open access
- green
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.