Claim Missing Document
Check
Articles

Found 23 Documents
Search

Analisis Algoritma K-Means dalam Pengelompokkan Persebaran Covid-19 di Indonesia Fitriyani, Nurul Khasanah; Abdulloh, Ferian Fauzi
MEANS (Media Informasi Analisa dan Sistem) Volume 6 Nomor 2
Publisher : LPPM UNIKA Santo Thomas Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (880.061 KB) | DOI: 10.54367/means.v6i2.1372

Abstract

Covid-19 or Coronavirus is a virus that is found in humans and animals. This virus can infect humans to cause various diseases such as flu, to serious diseases such as Middle East Respiratory Syndrome (MERS) and Severe Acute Respiratory Syndrome (SARS). In Indonesia, the spread of Covid-19 cases continues to increase and is evenly distributed in all provinces in Indonesia because of the fairly rapid spread due to the vast area in Indonesia, making it possible for grouping based on regions in Indonesia to be needed which will result in the center points of the spread of this Covid-19 case. This study aims to group Covid-19 data into a cluster using the K-Means Clustering Data Mining Algorithm. The Covid-19 data used in this study is Covid-19 data on July 6, 2021 which was taken from the official website of Kawal Covid-19 (KawalCovid-19.id). The attributes used are positive cases, recovered, and died. The clusters formed from the results of research using K-Means Clustering are 3 clusters with the first cluster consisting of 2 provinces, the second cluster 3 provinces, and for the third cluster 29 provinces. The cluster with the largest Covid-19 spread rate is cluster one. From this study, the accuracy was 91.176% and evaluated using the Davies-Bouldin Index yielded a fairly good cluster result with a value of 0.493371469.
Comparison Of Efficientnet And Yolov8 Algorithms In Motor Vehicle Classification Ferian Fauzi Abdulloh; Favian Afrheza Fattah; Devi Wulandari; Ali Mustopa
SITEKNIK: Sistem Informasi, Teknik dan Teknologi Terapan Vol. 2 No. 3 (2025): July
Publisher : RAM PUBLISHER

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5281/zenodo.16561038

Abstract

The YOLOv8 accuracy curve highlights clear overfitting. As shown in the graph, the model reaches 100% training accuracy from the first epoch and remains flat, indicating it memorized the training data. However, validation accuracy lags behind, fluctuating between 90% and 92% without significant improvement. This discrepancy between training and validation performance suggests that YOLOv8 struggles to generalize to unseen data. The issue likely stems from its architecture, which is optimized for object detection tasks that prioritize object localization over feature extraction for classification. When repurposed for classification, YOLOv8 may not extract the nuanced visual patterns needed to differentiate similar classes, such as trucks and buses. Consequently, although YOLOv8 performs well on the training set, its classification accuracy in real-world scenarios is limited. Addressing this may require architectural adjustments, stronger regularization, or more diverse training data to enhance the model’s generalization for pure classification tasks.
COMPARISON OF K-NEAREST NEIGHBOR AND SUPPORT VECTOR MACHINE ALGORITHM OPTIMIZATION WITH GRID SEARCH CV ON STROKE PREDICTION Aprilliandhika, Wahyu; Abdulloh, Ferian Fauzi
Jurnal Teknik Informatika (Jutif) Vol. 5 No. 4 (2024): JUTIF Volume 5, Number 4, August 2024
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2024.5.4.1951

Abstract

Stroke ranks second as the leading cause of death globally, with disability being the primary accompanying factor. The cause of death in stroke patients is due to the lack of an optimal stroke prediction system; therefore, identifying whether a patient is experiencing a stroke or not becomes the focus of this research. Thus, the objective of this study is to compare the performance of stroke prediction using two classification models, namely K-Nearest Neighbors (KNN) and Support Vector Machine (SVM), with and without using the GridSearchCV optimization technique. In this experiment, the dataset is processed and divided into training and testing data using the SMOTE oversampling technique. Initial testing is conducted without GridSearchCV. The results of the initial testing show that the KNN model performs better than SVM, with accuracies of 91% and 83%, respectively. After optimizing parameters using GridSearchCV, both models experience a significant performance improvement. The KNN model increases accuracy to 95% with precision of 91% and recall of 98%, while the SVM model increases accuracy to 94% with precision of 90% and recall of 99%. These results indicate that using GridSearchCV to optimize parameters of KNN and SVM models can significantly enhance stroke prediction performance. There are differences in precision and recall between KNN and SVM. The KNN model tends to have higher recall, while the SVM model has higher precision, and for accuracy, the KNN algorithm outperforms SVM in stroke prediction.