Claim Missing Document
Check
Articles

Found 13 Documents
Search

Evaluasi Algoritma Klasifikasi dengan Berbagai Metode Seleksi Fitur untuk Mendeteksi Aktivitas Trojan Rijal, Muhammad; Ilham, Amil Ahmad; Paundu, Ady Wahyudi
Jurnal Pekommas Vol 7 No 2 (2022): December 2022
Publisher : Sekolah Tinggi Multi Media “MMTC” Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.56873/jpkm.v7i2.4842

Abstract

- Viruses are malicious programs that can be harmful. One of the most dangerous viruses is the trojan virus, where the trojan virus hides on the user's device without being aware of its existence. Trojan viruses can be very difficult to spot because they hide on network devices and disguise themselves as part of the device. However, when a network device is infected by a trojan virus attack, the activities that occur on the network will be different from usual activities. In network activity, there are various parameters that cause classification to take longer to predict. In this study, various comparisons of feature reduction algorithms between Coefficient Correlation, Information Gain, PCA, and LDA were carried out and tested the combination of classification model algorithms (Random Forest, Decision Tree, KNN, Naïve Bayes, AdaBoost) to detect the best trojan activity on the internet network. faster to increase security against trojan viruses. The results of the study show that the classification with maximum accuracy with the best time is obtained by a combination of Coefficient Correlation, Information Gain, and PCA using the Decision Tree classification, using a combination of feature selection and classification methods obtained 99% accuracy and prediction time of 0.0033 seconds.
Optimization of Herbal Plant Classification Using Hybrid Method Particle Swarm Optimization With Support Vector Machine Amriana, Amriana; Ilham, Amil Ahmad; Achmad, Andani; Yusran, Yusran
JOIV : International Journal on Informatics Visualization Vol 9, No 1 (2025)
Publisher : Society of Visual Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62527/joiv.9.1.2576

Abstract

The classification process applied in this study helps identify the many kinds of herbal plants. Herbal plant leaf features are used based on color, shape, and texture. Particle Swarm Optimization and Support Vector Machine (PSO-SVM) hybridization are applied in the classification process to increase classification and identification accuracy. A well-liked metaheuristic approach for solving optimization issues is Particle Swarm Optimization (PSO). Particles look around the search area for the best responses.  A particle swarm is initially initialized randomly within the search area via the PSO algorithm. Every particle's mobility is determined by both its own experience and the experiences of the other particles in the swarm. Each particle keeps track of the best solution it has ever found and the swarm's most extraordinary remedy that has so far been discovered. The Hybrid approach concurrently selects features for the SVM and optimizes its parameters. The kernel function's gamma value non-linearly maps an input space to a high-dimensional feature space. At the same time, the C parameter determines the trade-off between fitting error minimization and model complexity. The Gaussian kernel parameter is set to determine the optimal parameter value of the RBF kernel function. Feature selection solves the issue by eliminating redundant, associated, and irrelevant features. A confusion matrix is utilized in the evaluation to gauge the system's performance. The results demonstrated an improvement in accuracy, with the hybrid PSO-SVM using test data achieving an accuracy of 98% compared to the SVM method, achieving a 91% accuracy.
Enhancing Relational Database Efficiency through Algorithmic Query Tuning in Virtual Memory Systems Yulis, Nurlina; Ilham, Amil Ahmad; Achmad, Andani; Samman, Faizal Arya
JOIV : International Journal on Informatics Visualization Vol 9, No 4 (2025)
Publisher : Society of Visual Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62527/joiv.9.4.2850

Abstract

The rapid evolution of virtual memory-based relational database systems has significantly advanced data processing capabilities. However, the efficiency of these systems largely depends on query execution optimization, which can be enhanced through algorithmic query tuning techniques. This study investigates the impact of these techniques on enhancing query performance in virtual memory-based relational databases. Various algorithmic methods were analyzed to optimize query execution plans, with a focus on key performance indicators such as execution time, CPU and memory usage, disk I/O, and cache hit ratio. The systematic application of these methods revealed effective strategies for performance enhancement. Results show substantial improvements in execution time, resource utilization, and scalability. This work offers valuable insights for database administrators and system architects, highlighting the role of algorithmic query tuning in managing the growing demands for data processing. Future research endeavors should explore the realm of AI-driven automation, with a particular focus on enhancing query optimization techniques. Additionally, there is a pressing need to investigate advanced security measures that safeguard data integrity within expansive, large-scale systems. By adopting innovative approaches, we can ensure robust protection and efficient performance in an increasingly data-driven world.