Hidden Markov Models with Random Restarts vs Boosting for Malware Detection
원문 초록
Effective and efficient malware detection is at the forefront of research into building secure digital systems. As with many other fields, malware detection research has seen a dramatic increase in the application of machine learning algorithms. One machine learning technique that has been used widely in the field of pattern matching in general-and malware detection in particular-is hidden Markov models (HMMs). HMM training is based on a hill climb, and hence we can often improve a model by training multiple times with different initial values. In this research, we compare boosted HMMs (using AdaBoost) to HMMs trained with multiple random restarts, in the context of malware detection. These techniques are applied to a variety of challenging malware datasets. We find that random restarts perform surprisingly well in comparison to boosting. Only in the most difficult "cold start" cases (where training data is severely limited) does boosting appear to offer sufficient improvement to justify its higher computational cost in the scoring phase.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
EMBER2024 -- A Benchmark Dataset for Holistic Evaluation of Malware Classifiers
LAMDA: A Longitudinal Android Malware Benchmark for Concept Drift Analysis
Evaluating the Robustness of Adversarial Defenses in Malware Detection Systems
Cyber Security Data Science: Machine Learning Methods and their Performance on Imbalanced Datasets
Imbalanced malware classification: an approach based on dynamic classifier selection
CyberLLMInstruct: A New Dataset for Analysing Safety of Fine-Tuned LLMs Using Cyber Security Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.