Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal MATRIK : Jurnal Manajemen, Teknik Informatika, dan Rekayasa Komputer
Deny Jollyta
Institut Bisnis dan Teknologi Pelita Indonesia, Pekanbaru, Indonesia
Computer Science & IT

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

Found 2 Documents
Search

 1 
Cluster Validity for Optimizing Classification Model: Davies Bouldin Index – Random Forest Algorithm Prihandoko Prihandoko; Deny Jollyta; Gusrianty Gusrianty; Muhammad Siddik; Johan Johan
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 24 No. 1 (2024)
Publisher : Universitas Bumigora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30812/matrik.v24i1.4043

Abstract

Several factors impact pregnant women’s health and mortality rates. The symptoms of disease in pregnant women are often similar. This makes it difficult to evaluate which factors contribute to a low, medium, or high risk of mortality among pregnant women. The purpose of this research is to generate classification rules for maternal health risk using optimal clusters. The optimal cluster is obtained from the process carried out by the validity cluster. The methods used are K-Means clustering, Davies Bouldin Index (DBI), and the Random Forest algorithm. These methods build optimum clusters from a set of k-tests to produce the best classification. Optimal clusters comprising cluster members withstrong similarities are high-dimensional data. Therefore, the Principal Component Analysis (PCA) technique is required to evaluate attribute value. The result of the research is that the best classification rule was obtained from k-tests = 22 on the 20th cluster, which has an accuracy of 97% to low, mid, and high risk. The novelty lies in using DBI for data that the Random Forest will classify. According to the research findings, the classification rules created through optimal clusters are 9.7% better than without the clustering process. This demonstrates that optimizing the data group has implications for enhancing the classification algorithm’s performance.
Enhancement of Supervised Learning Models for Intrusion Detection Through Mutual Information and Hyperparameter Tuning Deny Jollyta; Yoakhina Nicole Makaruku; Alyauma Hajjah; Yulvia Nora Marlim
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 25 No. 2 (2026)
Publisher : Universitas Bumigora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30812/matrik.v25i2.5760

Abstract

Enhancing the performance of supervised learning algorithms through feature and hyperparameter testing remains challenging for users, particularly when detecting computer network intrusions. There are opportunities to assess whether a supervised learning algorithm performs optimally, depending on the number of features and the choice of hyperparameters. The purpose of this research is to enhance the network intrusion detection performance of three supervised learning algorithms, namely Support Vector Machine (SVM), eXtreme Gradient Boosting, and Random Forest, by using the Mutual Information feature selection approach and hyperparameter tuning. Mutual Information measures the dependency of features on the target. Features with high values are the most informative. Hyperparameters are not learned from the data; they are set before training begins. Hyperparameters are selected in accordance with the requirements of the three algorithms via iterative training and testing on the NSL-KDD dataset. The dataset was split into 80:20, 70:30, and 60:40. The results showed that the fifteen features with the highest mutual information were identified and trained on the data using appropriate hyperparameters. By splitting the data in an 80:20 ratio, the accuracy of Support Vector Machine reached its maximum, increasing from 90% to 98%. In contrast, eXtreme Gradient Boosting and Random Forest reached their maximum, increasing from 97% and 98% to 100%, respectively. The study’s findings advance our understanding of how algorithm performance depends on feature and hyperparameter selection.
Co-Authors Alyauma Hajjah Gusrianty Gusrianty Johan Johan Muhammad Siddik Prihandoko . Yoakhina Nicole Makaruku Yulvia Nora Marlim