Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,067

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Data mining methods for detection of new malicious executables

Open access
Schultz, M.G., Eskin, E., Zadok, F., Stolfo, S.J.·2002·Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/secpri.2001.924286

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 1,067

Metadata

Authors
Schultz, M. G., Eskin, E., Zadok, F., & Stolfo, S. J.
Venue
Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
Published
2002-11-13
Pages
38-49
OpenAlex
W2144112223
Cited by
1,067
References
1
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Data mining methods for detection of new malicious executables. https://app.cochat.ai/papers/10.1109/secpri.2001.924286
The paper
Schultz, M. G., Eskin, E., Zadok, F., & Stolfo, S. J. (2002). Data mining methods for detection of new malicious executables. Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001. https://doi.org/10.1109/secpri.2001.924286

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.