Ubaidilah, Romdan Muhamad
Unknown Affiliation

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

Found 2 Documents
Search

Prediksi Kelulusan Mahasiswa Berdasarkan Data Kunjung dan Peminjaman Buku menggunakan Rapid Miner dengan Metode C.45 dan Random Forest Ubaidilah, Romdan Muhamad
International Research on Big-Data and Computer Technology: I-Robot Vol 7, No 2 (2023): September 2023
Publisher : STMIK DHARMA WACANA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53514/ir.v7i2.410

Abstract

Waktu kelulusan dan ketidakseimbangan antara jumlah pendaftar dan lulusan menjadi perhatian utama perguruan tinggi.Masalah ini menyebabkan penumpukan data mahasiswa yang belum lulus, serta peningkatan kunjungan dan peminjaman bukusetiap harinya. Penelitian ini dilakukan untuk mendapatkan pengetahuan menggunakan teknik klasifikasi dengan memprosesdata guna menemukan pola pada data kelulusan dan transaksi perpustakaan. Pengolahan data menggunakan metode decisiontree dengan algoritma C4.5 dan Random Forest. Atribut non-kelas yang digunakan meliputi IP semester 1-4, jumlah kunjungan,pinjam buku dan status kelulusan. Prosesnya meliputi memuat data, membersihkan data, pemilihan fitur, pemodelan C4.5 andRandom Forest, pengujian akurasi menggunakan confusion matrix. Percobaannya menunjukkan bahwa kedua metode tersebutmemberikan tingkat akurasi prediksi yang cukup tinggi dalam memprediksi kelulusan mahasiswa. Dalam rasio training 90%dan testing 10%, metode C4.5 memiliki akurasi sebesar 94,90%, sementara Random Forest mencapai akurasi sebesar 95,13%.Manfaat dari penelitian ini adalah sebagai sumber pengetahuan strategis bagi program studi untuk memprediksi kelulusanmahasiswa.
Performance Comparasion of Adaboost and PSO Algorithms for Cervical Cancer Classification Using KNN Algorithm Ubaidilah, Romdan Muhamad; Sutedi, Sutedi
Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer dan Teknologi Informasi Vol 10, No 2 (2024): December 2024
Publisher : Fakultas Sains dan Teknologi, Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/coreit.v10i2.31711

Abstract

Abstract. Cervical cancer impacts the female reproductive organs and stands as the second most common cancer among women worldwide. The World Health Organization (WHO) reports that annually, approximately 500,000 women are diagnosed with cervical cancer, and about 300,000 die from it. Many of these deaths result from insufficient early detection and preventive measures. There are four primary screening techniques for detecting cervical cancer cells: Hinselmann, Schiller, Cytology, and Biopsy. In this study, patient health history data is analyzed using the KNN algorithm, which is further optimized with Adaboost and PSO techniques. These optimization strategies are evaluated to identify the most precise model for detecting patterns in cervical cancer patients and predicting their screening outcomes. This study employs the RapidMiner tool. Findings reveal that the KNN algorithm effectively performs multilabel classification, and when optimized with PSO, there is a slight improvement in accuracy.Purpose: The aim of this research is to assess the performance of the K-Nearest Neighbor (KNN) algorithm in multilabel classification of cervical cancer and to optimize it using Adaboost and Particle Swarm Optimization (PSO) techniques. This research is significant as it offers a potentially more accurate diagnostic method for detecting cervical cancer using medical records.Methods/Study design/approach: The Cervical Cancer Risk Classification dataset from Kaggle was used in this study. Data preprocessing was conducted before applying the KNN algorithm. The KNN algorithm's performance was evaluated using a 10-fold cross-validation method, and results were measured using the Confusion Matrix. Additionally, the KNN algorithm was optimized using Adaboost and PSO to assess improvements in accuracy.Result/Findings: Experimental results indicated that the KNN algorithm achieved optimal accuracy with k=5, reaching 95.81%, 91.26%, 94.64%, and 93.01% for Hinselmann, Schiller, Cytology, and Biopsy targets, respectively. Adaboost did not significantly improve accuracy, while PSO slightly enhanced the Hinselmann target accuracy from 95.81% to 95.92%. The average training time for this experiment was around two minutes. These results demonstrate the effectiveness of the KNN algorithm in conducting multilabel classification for cervical cancer diagnosis.Novelty/Originality/Value: This research demonstrates that optimizing the KNN algorithm with PSO can enhance accuracy, though not significantly. This suggests potential for further development to improve cervical cancer diagnostic accuracy. Testing the model with the latest data and optimizing parameters may lead to better models and useful tools for early cervical cancer diagnosis.