| Full text | |
| Author(s): |
Dam, Khanh Huu The
;
-Wilson, Thomas Given
;
Legay, Axel
;
Veroneze, Rosana
Total Authors: 4
|
| Document type: | Journal article |
| Source: | APPLIED SOFT COMPUTING; v. 127, p. 21-pg., 2022-08-04. |
| Abstract | |
Detecting packer programs is a key step in the defense against malicious programs and plays a key role in cyber security defenses. One challenge with packer classification is that many features have been used and their individual significance is unknown. An effective approach for building classifiers without requiring prior knowledge of feature significance is to use associative classification (AC) algorithms, which combine association rules and classification. This work considers many different AC algorithms for the challenge of packer detection. Novel variations of many of these algorithms are also developed to address challenges related to having many features of varying types. The effectiveness of the classifiers produced by these algorithms is evaluated, including over time as packers and malware evolve. (C) 2022 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 20/00123-9 - An integrated and cross-disciplinary approach towards biclustering and constraint programming |
| Grantee: | Rosana Veroneze |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |
| FAPESP's process: | 17/21174-8 - Enumerative algorithms for biclustering: expanding and exploring their potential in bioinformatics and neuroscience |
| Grantee: | Rosana Veroneze |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |