Muhamad Azwar
Program Studi Ilmu Komputer, Universitas Bumigora

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Deteksi Malware pada Perangkat Android Menggunakan Ensemble Learning Muhamad Azwar; Lilik Widyawati; Raisul Azhar; Kartarina Kartarina; Tanwir Tanwir; Andi Sofyan Anas
Jurnal Teknologi Informasi dan Multimedia Vol. 7 No. 3 (2025): August
Publisher : Sekawan Institut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35746/jtim.v7i3.573

Abstract

The increasing use of permission-based applications on mobile platforms has raised concerns regarding privacy and security. Android, being one of the most widely used operating systems for interacting with mobile applications, is particularly susceptible to various security risks that must be promptly addressed. Low digital literacy and a lack of user awareness about security risks—especially when installing applications from unofficial sources or without paying attention to access permissions—make users vulnerable to malware attacks. Uninformed users can easily become victims of malware insertion by irresponsible parties, turning them into targets for data manipulation and even data theft, which may then be sold on illegal forums. Attackers exploit the permission system, allowing them to freely access the target smartphone. This lack of awareness among users increases their vulnerability to malware injection and subsequent threats such as data manipulation and the theft of personal information, which can be traded on underground markets. One approach to detecting malicious behavior in mobile applications is the use of machine learning techniques. These techniques can analyze application patterns and behaviors based on features such as requested permissions. Popular algorithms for malware detection include Support Vector Machine (SVM) and Random Forest (RF), both of which have demonstrated strong performance in various studies. However, to further improve accuracy and reduce classification errors, ensemble learning approaches such as Adaptive Boosting (AdaBoost) are increasingly being adopted. Ensemble learning combines multiple predictive models to produce more reliable classification results compared to single models. This study evaluates the performance of several classification algorithms in detecting malicious Android applications. The results show that AdaBoost achieved a high accuracy rate of 91.65% and an AUC value of 95%, effectively distinguishing between safe applications and malware. Therefore, the use of machine learning algorithms—particularly ensemble methods like AdaBoost—can serve as a promising solution to enhance the security and privacy of Android-based mobile application users.
Implementasi Algoritma Dijkstra dan Bellman-Ford untuk Optimasi Rute Pemadam Kebakaran di Kota Praya Sunardi Sunardi; Muhamad Azwar; Dedy Sofian MZ; Angga Radlisa Samsudin; Fazlul Rahman
Jurnal Teknologi Informasi dan Multimedia Vol. 7 No. 2 (2025): May
Publisher : Sekawan Institut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35746/jtim.v7i2.744

Abstract

Forest and land fires are critical emergencies requiring rapid response to minimize casualties and property damage. In urban areas like Praya City, fire department response delays are often caused by inefficient routing, especially with traffic congestion and complex road infrastructure. This study aims to analyze and compare the performance of Dijkstra's and Bellman-Ford's algorithms for optimizing firefighter routes in Praya City. This quantitative research utilized a computational and comparative analysis approach. Road network data from Praya City was obtained from Google Maps and modeled as a static graph consisting of 17 nodes and weighted edges repre-senting actual distances. Dijkstra's and Bellman-Ford's algorithms were implemented in Python to find the shortest routes from a designated starting point (Fire Department office) to all other nodes. Performance was evaluated based on route optimality, completeness, and computation time. Both Dijkstra's and Bellman-Ford's algorithms successfully identified identical optimal shortest routes for all tested origin-destination pairs within the Praya City graph. However, Dijkstra's algorithm demonstrated significantly superior computational efficiency, with an average computation time of 0.5 seconds, compared to Bellman-Ford's 1.5 seconds. For optimizing firefighter routes on the static road network graph of Praya City, Dijkstra's algorithm is recommended due to its combi-nation of optimality and superior speed. This finding provides an empirical basis for developing more efficient emergency response navigation systems. Future research should focus on inte-grating dynamic parameters like real-time traffic data.