The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Malware classification based on call graph clustering
Abstract
Each day, anti-virus companies receive tens of thousands samples of potentially harmful executables. Many of the malicious samples are variations of previously encountered malware, created by their authors to evade pattern-based detection. Dealing with these large amounts of data requires robust, automatic detection approaches. This paper studies malware classification based on call graph clustering. By representing malware samples as call graphs, it is possible to abstract certain variations away, enabling the detection of structural similarities between samples. The ability to cluster similar samples together will make more generic detection techniques possible, thereby targeting the commonalities of the samples within a cluster. To compare call graphs mutually, we compute pairwise graph similarity scores via graph matchings which approximately minimize the graph edit distance. Next, to facilitate the discovery of similar malware samples, we employ several clustering algorithms, including k-medoids and Density-Based Spatial Clustering of Applications with Noise (DBSCAN). Clustering experiments are conducted on a collection of real malware samples, and the results are evaluated against manual classifications provided by human malware analysts. Experiments show that it is indeed possible to accurately detect malware families via call graph clustering. We anticipate that in the future, call graphs can be used to analyse the emergence of new malware families, and ultimately to automate implementation of generic detection schemes.
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
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Cited by
Gibert, D., Mateu, C., & Planes, J. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2019.102526 · Cited by 619
Structural detection of android malware using embedded call graphs
Gascon, H., Yamaguchi, F., Arp, D., & Rieck, K. (2013) · Proceedings of the 2013 ACM workshop on Artificial intelligence and security · doi:10.1145/2517312.2517315 · Cited by 329
Metadata
- Authors
- Kinable, J., & Kostakis, O.
- Venue
- Journal in Computer Virology
- Published
- 2011-02-03
- Volume
- 7
- Issue
- 4
- Pages
- 233-245
- ISSN
- 1772-9890 (ISSN-L)
- 1772-9904
- OpenAlex
- W1553801604
- Cited by
- 192
- References
- 3
- FWCI
- 19.99
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Malware classification based on call graph clustering. https://app.cochat.ai/papers/10.1007/s11416-011-0151-y
- The paper
- Kinable, J., & Kostakis, O. (2011). Malware classification based on call graph clustering. Journal in Computer Virology. https://doi.org/10.1007/s11416-011-0151-y
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.