Enhanced Malware Detection for Mobile Operating Systems Using Machine Learning and Dynamic Analysis
Bibliographic record
Abstract
Mobile smartphone operating systems have garnered widespread popularity due to their open-source nature and high performance.However, the convenience of these systems has also led to a rise in malware distribution.Traditional signature-based detection methods often fail to identify unknown threats, prompting the need for more effective solutions.In this study, we propose an advanced machine learning-based model for detecting malware on smartphones.Our model leverages dynamic and static analysis techniques to select and infer features, followed by a novel feature extraction method using sampling and Principal Component Analysis (PCA) to reduce dimensionality without adversely impacting the accuracy.Experimental results demonstrate the effectiveness of our approach in significantly enhancing malware detection accuracy and efficiency on smartphone operating systems.By analyzing the dynamic behavior of applications and incorporating innovative detection methods, our research contributes to a more robust and proactive approach to smartphone security.Through rigorous evaluation using real-world and synthetic datasets, we validate the efficacy of our model in accurately identifying malware instances and guiding users towards safe application downloads.Overall, our study provides a promising avenue for mitigating the escalating threat of malware on mobile devices.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".