FP-tree and SVM for malicious web campaign detection

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The classification of the massive amount of malicious software variants into families is a challenging problem faced by the network community. In this paper (The work was supported by the EU FP7 grant No. 608533 (NECOMA) and “Information technologies: Research and their interdisciplinary applications”, POKL.04.01.01-00-051/10-00.) we introduce a hybrid technique combining a frequent pattern mining and a classification technique to detect malicious campaigns. A novel approach to prepare malicious datasets containing URLs for training the supervised learning classification method is provided. We have investigated the performance of our system employing frequent pattern tree and Support Vector Machine on the real database consisting of malicious data taken from numerous devices located in many organizations and serviced by CERT Polska. The results of extensive experiments show the effectiveness and efficiency of our approach in detecting malicious web campaigns.

Cite

CITATION STYLE

APA

Kruczkowski, M., Niewiadomska-Szynkiewicz, E., & Kozakiewicz, A. (2015). FP-tree and SVM for malicious web campaign detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9012, pp. 193–201). Springer Verlag. https://doi.org/10.1007/978-3-319-15705-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free