Universiti Teknologi Malaysia Institutional Repository

Redundancy coefficient gradual up-weighting-based mutual information feature selection technique for crypto-ransomware early detection

Al-rimy, Bander Ali Saleh and Maarof, Mohd. Aizaini and Alazab, Mamoun and Mohd. Shaid, Syed Zainudeen and A. Ghaleb, Fuad and Almalawi, Abdulmohsen and Ali, Abdullah Marish and Al-Hadhrami, Tawfik (2021) Redundancy coefficient gradual up-weighting-based mutual information feature selection technique for crypto-ransomware early detection. Future Generation Computer Systems, 115 . pp. 641-658. ISSN 0167-739X

[img]
Preview
PDF
4MB

Official URL: http://dx.doi.org/10.1016/j.future.2020.10.002

Abstract

Crypto-ransomware is a type of malware whose effect is irreversible even after detection and removal. Thus, early detection is crucial to protect user files from being encrypted and held to ransom. Several studies have proposed early detection solutions based on the data acquired during the pre-encryption phase of the attacks. However, the lack of sufficient data in the early phases of the attack adversely affects the ability of feature selection techniques in these models to perceive the common characteristics of the attack features, which makes it challenging to reduce the redundant features, consequently decreasing the detection accuracy. Therefore, this study proposes a novel Redundancy Coefficient Gradual Upweighting (RCGU) technique that makes better redundancy–relevancy trade-offs during feature selection. Unlike existing feature significance estimation techniques that rely on the comparison between the candidate feature and the common characteristics of the already-selected features, RCGU compares the mutual information between the candidate feature and each feature in the selected set individually. Therefore, RCGU increases the weight of the redundancy term proportional to the number of already selected features. By integrating the RCGU into the Mutual Information Feature Selection (MIFS) technique, the Enhanced MIFS (EMIFS) was developed. Further improvement was achieved by proposing MM-EMIFS which incorporates the MaxMin approximation with EMIFS to prevent the redundancy overestimation that RCGU could cause when the number of features in the already-selected set increases. The experimental evaluation shows that the proposed techniques achieved accuracy higher than that in related works, which confirms the ability of RCGU to make better redundancy–relevancy trade-offs and select more discriminative pre-encryption attack features compared to existing solutions.

Item Type:Article
Uncontrolled Keywords:Feature selection, Malware
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computing
ID Code:94618
Deposited By: Widya Wahid
Deposited On:31 Mar 2022 15:51
Last Modified:31 Mar 2022 15:51

Repository Staff Only: item control page