Analysis of Markov Blanket Based Feature Ranking for Android Malware Detection

Yusfrizal Yusfrizal; Andrian Syahputra; Yahya Tanjung; Safrizal

doi:10.59934/jaiea.v3i3.506

Authors

Yusfrizal Yusfrizal Universitas Potensi Utama
Andrian Syahputra Universitas Potensi Utama
Yahya Tanjung Universitas Potensi Utama
Safrizal Universitas Potensi Utama

DOI:

https://doi.org/10.59934/jaiea.v3i3.506

Keywords:

Malware, Feature Ranking, Markov Blanket, Android

Abstract

The ubiquity of Android applications in our daily lives has brought forth an indispensable need for robust app security mechanisms. Malware-infested applications not only jeopardize user privacy but also compromise data integrity and overall device security. Detecting and mitigating malicious behavior within Android applications is becoming increasingly challenging due to the high-dimensional nature of the data. Moving forward, employing Machine Learning (ML) techniques to detect malware in Android apps has become the norm. High dimensional feature space poses several formidable challenges, including data scarcity, over fitting, and heightened computational demands. While dimensionality reduction techniques are a potential remedy, they often result in loss of crucial information essential for comprehending and identifying malicious behaviors accurately. Feature ranking based feature subset selection emerges as a promising alternative, as it allows us to retain the original feature space, ensuring precise representation of app behaviors. This article explores various Markov Blanket (MB) based feature ranking techniques, proposes a variant of Grow Shrink (GS) MB technique, GS++ which demonstrates enhanced performance within the context of Android malware detection.

Downloads

Download data is not yet available.

References

U. J. Butt, M. F. Abbod, and A. Kumar, “Cyber threat ransomware and marketing to networked consumers,” in Handbook of research on innovations in technology and marketing for the connected consumer, IGI Global, 2020, pp. 155–185.

J. Qiu, J. Zhang, W. Luo, L. Pan, S. Nepal, and Y. Xiang, “A survey of android malware detection with deep neural models,” ACM Comput. Surv., vol. 53, no. 6, pp. 1–36, 2020.

S. He, F. Guo, and Q. Zou, “MRMD2. 0: a python tool for machine learning with feature ranking and reduction,” Curr. Bioinform., vol. 15, no. 10, pp. 1213–1221, 2020.

Z. Ling, K. Yu, Y. Zhang, L. Liu, and J. Li, “Causal learner: A toolbox for causal structure and markov blanket learning,” Pattern Recognit. Lett., vol. 163, pp. 92–95, 2022.

H. H. Htun, M. Biehl, and N. Petkov, “Survey of feature selection and extraction techniques for stock market prediction,” Financ. Innov., vol. 9, no. 1, p. 26, 2023.

M. Harris and M. Zwick, “Graphical Models in Reconstructability Analysis and Bayesian Networks,” Entropy, vol. 23, no. 8, p. 986, 2021.

X. Wu, B. Jiang, X. Wang, T. Ban, and H. Chen, “Feature selection in the data stream based on incremental Markov boundary learning,” IEEE Trans. Neural Networks Learn. Syst., 2023.

H. Wang, Z. Ling, K. Yu, and X. Wu, “Towards efficient and effective discovery of Markov blankets for feature selection,” Inf. Sci. (Ny)., vol. 509, pp. 227–242, 2020.

K. Yu et al., “Causality-based feature selection: Methods and evaluations,” ACM Comput. Surv., vol. 53, no. 5, pp. 1–36, 2020.

J. Lemmon et al., “Evaluation of feature selection methods for preserving machine learning performance in the presence of temporal dataset shift in clinical medicine,” Methods Inf. Med., vol. 62, no. 01/02, pp. 60–70, 2023.

N. Wang, H. Liu, L. Zhang, Y. Cai, and Q. Shi, “Loose-to-strict Markov blanket learning algorithm for feature selection,” Knowledge-Based Syst., vol. 283, p. 111216, 2024.

R. Duangsoithong and Y. Zhao, “Floating search and conditional independence testing for causal feature selection.,” Songklanakarin J. Sci. Technol., vol. 43, no. 6, 2021.

S. del Río and E. Villanueva, “A Novel Method to Estimate Parents and Children for Local Bayesian Network Learning,” in Intelligent Systems and Applications: Proceedings of the 2021 Intelligent Systems Conference (IntelliSys) Volume 2, 2022, pp. 468–485.

M. A. Javidian, M. Valtorta, and P. Jamshidi, “Learning LWF chain graphs: A Markov blanket discovery approach,” in Conference on Uncertainty in Artificial Intelligence, 2020, pp. 1069–1078.

A. Hassan, J. H. Paik, S. Khare, and S. A. Hassan, “Ppfs: Predictive permutation feature selection,” arXiv Prepr. arXiv2110.10713, 2021.

P. Liu, L. Li, Y. Zhao, X. Sun, and J. Grundy, “Androzooopen: Collecting large-scale open source android apps for the research community,” in Proceedings of the 17th International Conference on Mining Software Repositories, 2020, pp. 548–552.