A fast kernel on hierarchial tree structures and its application to windows application behavior analysis

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

Abstract

System calls have been proved to be important evidence for analyzing the behavior of running applications. However, application behavior analyzers which investigate the majority of system calls usually suffer from severe system performance deterioration or frequent system crashes. In the presented study, a light weighted analyzer is approached by two avenues. On the one hand, the computation load to monitor the system calls are considerably reduced by limiting the target functions to two specific groups: file accesses and Windows Registry accesses. On the other hand, analytical accuracy is achieved by deep inspection into the string parameters of the function calls, where the proximity of the programs are evaluated by the newly proposed kernel functions. The efficacy of the proposed approach is evaluated on real world datasets with promising results reported. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Ban, T., Ando, R., & Kadobayashi, Y. (2010). A fast kernel on hierarchial tree structures and its application to windows application behavior analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6444 LNCS, pp. 267–274). https://doi.org/10.1007/978-3-642-17534-3_33

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