Comparison of Decision Tree and Random Forest in Book Loan Classification for Universitas Esa Unggul Bekasi

Authors

  • Hania Ayu Karin Universitas Esa Unggul
  • Siti Rodiyah Universitas Esa Unggul
  • Adelia Rafa Farzana Universitas Esa Unggul
  • Erika Amanda Putri Universitas Esa Unggul
  • Diva Yasa Universitas Esa Unggul
  • Vitri Tundjungsari Universitas Esa Unggul

DOI:

https://doi.org/10.59934/jaiea.v5i2.2192

Keywords:

Decision Tree, Loan Delay, University Library, Random Forest, SMOTE.

Abstract

This study compares the performance of Decision Tree and Random Forest algorithms in classifying the status of book loans at the Library of Universitas Esa Unggul Bekasi Campus. The objective of this research is to build a predictive model capable of identifying potential late returns as a basis for more proactive decision-making. The dataset used consists of 1,210 historical book loan records from the period of January to May 2025. Preprocessing stages included data cleaning, feature engineering, encoding of categorical variables, and handling class imbalance using the Synthetic Minority Over-sampling Technique (SMOTE). Classification models were built and evaluated using accuracy, precision, recall, F1-score, and AUC-ROC metrics. Test results showed that the Random Forest algorithm had superior and more stable performance compared to Decision Tree, especially in detecting the minority class of late loans. After hyperparameter tuning, Random Forest achieved higher F1-score and recall values without a significant drop in precision. These findings indicate that Random Forest is more effective for handling imbalanced and complex loan data. Therefore, the Random Forest algorithm is recommended as a decision support system to improve service efficiency, collection availability, and library management quality.

Downloads

Download data is not yet available.

References

V. Tundjungsari, “Dasar Machine Learning_v.3.0_FULL ISBN.pdf,” 2024.

L. Rokach and O. Maimon, “Top-Down Induction of Decision Trees Classifiers –,” vol. 1, no. 11, pp. 1–12, 2002.

R. M. Ubaidilah et al., “Prediksi Kelulusan Mahasiswa Berdasarkan Data Kunjung dan Peminjaman Buku menggunakan Rapid Miner dengan Metode C . 45 dan Random Forest,” vol. 7, no. 2, pp. 14–20, 2023.

B. Anggo, S. Aji, Y. Setiawan, S. D. Anggraini, D. K. Surabaya, and U. Telkom, “Analisis Perbandingan Algoritma Decision Tree , Random Forest , dan XGBoost untuk Klasifikasi Penyakit Infeksi Gigi dan Mulut,” pp. 135–148, 2020.

H. Oktavianto, H. W. Sulistyo, G. Wijaya, and D. Irawan, “Analisis Komparasi Kinerja Metode Decision Tree dan Random Forest dalam Klasifikasi Teks Data Kesehatan,” vol. 11, no. 1, pp. 56–65, 2024.

Breiman, Leo & Friedman, Jerome & Olshen, Richard & Stone, Charles. (2017). Classification And Regression Trees. doi: 10.1201/9781315139470.

N. Novianda, R. Akram, and A. L. Mawardi, “Penerapan Teknologi Pemberian Pakan Ikan Otomatis Berbasis Internet of Things Dalam Upaya Peningkatan Hasil Panen Ikan Lele,” JMM (Jurnal Masy. Mandiri), vol. 6, no. 6, p. 4562, 2022, doi: 10.31764/jmm.v6i6.10925.

H. Esmaily, M. Tayefi, H. Doosti, M. Ghayour-Mobarhan, H. Nezami, and A. Amirabadizadeh, “A Comparison between Decision Tree and Random Forest in Determining the Risk Factors Associated with Type 2 Diabetes,” vol. 18, no. 2, 2018.

N. I. Yaman, A. R. Juwita, S. Arum, P. Lestari, and S. Faisal, “Perbandingan Kinerja Algoritma Decision Tree dan Random Forest untuk Klasifikasi Nutrisi pada Makanan Cepat Saji,” pp. 184–195, 2024, doi: 10.33364/algoritma/v.21-2.1649.

Davis, Jesse & Goadrich, Mark. (2006). The Relationship Between Precision-Recall and ROC Curves. Proceedings of the 23rd International Conference on Machine Learning, ACM. 06. doi: 10.1145/1143844.1143874.

E. Helmud, E. Helmud, and P. Romadiana, “Classification Comparison Performance of Supervised Machine Learning Random Forest and Decision Tree Algorithms Using Confusion Matrix,” vol. 13, pp. 92–97, 2024.

Z. Amri, M. Rodi, M. N. Wathani, and A. Bagja, “Infotek : Jurnal Informatika dan Teknologi Prediksi Diabetes Menggunakan Algoritma K-Nearest ( KNN ) Teknik SMOTE-ENN Infotek : Jurnal Informatika dan Teknologi Diabetes merupakan penyakit tidak menular yang secara serius memengaruhi sistem kesehatan besa,” vol. 8, no. 1, pp. 193–204, 2025.

H. Izzi, A. Setyanto, and A. D. Hartanto, “Infotek : Jurnal Informatika dan Teknologi Optimalisasi Akurasi Algoritma Naïve Bayes Dengan Metode Syntetic Minority Oversampling Technique ( Smote ) Pada Data Numerik Infotek : Jurnal Informatika dan Teknologi Klasifikasi adalah tugas dasar dari analisi,” vol. 8, no. 1, 2025.

Breiman, L. Random Forests. Machine Learning 45, 5–32 (2001). doi: 10.1023/A:1010933404324.

Downloads

Published

2026-02-15

How to Cite

Hania Ayu Karin, Siti Rodiyah, Adelia Rafa Farzana, Erika Amanda Putri, Diva Yasa, & Vitri Tundjungsari. (2026). Comparison of Decision Tree and Random Forest in Book Loan Classification for Universitas Esa Unggul Bekasi. Journal of Artificial Intelligence and Engineering Applications (JAIEA), 5(2), 3366–3374. https://doi.org/10.59934/jaiea.v5i2.2192