Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Computer Science (CO-SCIENCE) Jurnal Informatika Polinema (JIP)
Mohammad Dwi Irfan Affandi
Universitas Merdeka Malang
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Library & Information Science

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

Found 2 Documents
Search

 1 
Komparasi Metode SMOTE-Tomek dan SMOTE-ENN untuk Mengatasi Data Imbalanced Fandi Yulian Pamuji; Mohammad Dwi Irfan Affandi; Andriyan Rizki Jatmiko
Jurnal Informatika Polinema Vol. 12 No. 3 (2026): Vol. 12 No. 3 (2026)
Publisher : UPT P2M State Polytechnic of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33795/jip.v12i3.9550

Abstract

Perkembangan teknologi informasi dan data analisis saat ini mendorong meningkatnya pemanfaatan machine learning dalam berbagai bidang. Namun, salah satu permasalahan umum yang sering muncul dalam penerapan machine learning adalah kondisi data tidak seimbang (imbalanced data) yaitu ketidakseimbangan jumlah data antar kelas, di mana kelas mayoritas jauh lebih dominan dibandingkan kelas minoritas. Untuk mengatasi permasalahan dataset tidak seimbang adalah dengan menyeimbangkan distribusi kelas tidak seragam di antara kelas-kelas dengan komparasi menggunakan metode SMOTE-Tomek dan SMOTE-ENN supaya jumlahnya seimbang dari kelas mayoritas (negatif) maupun kelas minoritas (positif). Berdasarkan hasil eksperimen yang telah dilakukan dari penelitian ini yaitu bahwa pengujian metode SMOTE-Tomek dengan metode klasifikasi mampu menangani jumlah kelas mayoritas (negatif) dan kelas minoritas (positif) pada data tidak seimbang dengan menghasilkan nilai MCC dan G-mean mencapai kinerja prediksi yang lebih besar dibandingkan dengan menggunakan metode klasifikasi saja maupun menggunakan Metode SMOTE-ENN. Kemudian untuk dataset Binary nilai MCC dan G-mean yang paling tinggi menggunakan SMOTE-ENN + Random Forest dengan nilai tertinggi MCC = 0.99 dan nilai G-mean = 0.99 dari nilai MCC dan G-mean diatas akurasinya sudah bagus karena nilai MCC dan G-mean yang mendekati 1 menunjukkan bahwa model memiliki performa klasifikasi yang sangat baik dalam menangani data tidak seimbang dengan menggunakan Metode SMOTE-Tomek + Random Forest dapat mencapai kinerja prediksi yang lebih besar untuk menangani dataset tidak seimbang Binary. Hal tersebut menunjukkan bahwa proses penanganan terhadap distribusi kelas yang tidak seimbang pada tahap preprocessing data memberikan pengaruh terhadap nilai akurasi MCC maupun G-mean metode SMOTE-Tomek + Random Forest.
Performance of Distance Metrics in SMOTE for Binary Imbalanced Classification Fandi Yulian Pamuji; Luthfi Indana; Mohammad Dwi Irfan Affandi
Computer Science (CO-SCIENCE) Vol. 6 No. 2 (2026): July 2026 (On Process)
Publisher : LPPM Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31294/co-science.v6i2.12543

Abstract

Skewed class distribution continues to be one of the central obstacles in binary classification, since a learning model tends to lean toward the dominant class and consequently overlooks observations belonging to the under-represented class. The purpose of this research is to examine how the choice of distance measure inside SMOTE, specifically Euclidean, Manhattan, Chebyshev, and Hamming, affects predictive quality on imbalanced binary data. Ten publicly available binary datasets drawn from the KEEL repository, whose imbalance ratios span from 1.86 up to 15.80, were used in the experiment. Every dataset was preprocessed and partitioned into 80% for training and 20% for testing; oversampling with SMOTE was carried out on the training portion only, after which four learners, namely Naive Bayes, Decision Tree, Logistic Regression, and k-Nearest Neighbor, were assessed. Model quality was judged through the Matthews Correlation Coefficient (MCC) together with the G-Mean, as these two indicators describe imbalanced performance more faithfully than plain accuracy. The comparison revealed that pairing Euclidean-based SMOTE with Logistic Regression yielded the strongest average scores (MCC = 0.72; G-Mean = 0.79); Manhattan-based SMOTE reached its top MCC again with Logistic Regression (MCC = 0.68) and its top G-Mean with the Decision Tree (G-Mean = 0.79); Chebyshev-based SMOTE delivered the best overall combination together with the Decision Tree (MCC = 0.74; G-Mean = 0.84); and Hamming-based SMOTE performed best alongside Logistic Regression (MCC = 0.73; G-Mean = 0.81). Taken together, these outcomes suggest that the distance function chosen within SMOTE shapes the quality of the generated synthetic points and, in turn, the behavior of the trained classifier.
Co-Authors Andriyan Rizki Jatmiko Fandi Yulian Pamuji Indana, Luthfi