Klasifikasi Tingkat Kepuasan Peserta Pelatihan Balai Besar Pelatihan Vokasi dan Produktivitas Menggunakan Algoritma C5.0
DOI:
https://doi.org/10.47065/bulletincsr.v5i5.733Keywords:
C5.0 Algorithm; Classification; Participant Satisfaction; Vocational TrainingAbstract
The evaluation of training participant satisfaction at the Center for Vocational Training and Productivity Development (BBPVP) has traditionally relied on conventional methods, resulting in less accurate and unstructured outcomes. The core issue necessitates a data-driven solution to enhance objectivity and reliability. This study aims to develop a C5.0 algorithm-based classification model to automatically measure participant satisfaction levels and identify dominant influencing factors. The methodology includes collecting survey data from 300 respondents across five SERVQUAL attributes (reliability, assurance, responsiveness, empathy, tangibles), data preprocessing, dataset splitting (80:20), and model development using Python’s Scikit-learn library. Results indicate a model accuracy of 98.3% (12% higher than Naïve Bayes), with "assurance" as the most influential attribute (gain ratio: 0.638). Contributions of this research include: (1) providing BBPVP with an accurate data-driven satisfaction evaluation tool, (2) offering strategic recommendations to improve training quality, particularly in assurance, and (3) potential adoption of this method as a national vocational training evaluation standard.
Downloads
References
R. Zhang, M. Han, F. He, F. Meng, and C. Li, “Damped sliding based mining of average utility-driven sequential patterns over uncertain data streams,” Neurocomputing, vol. 647, p. 130669, Sep. 2025, doi: 10.1016/j.neucom.2025.130669.
Q. Wu et al., “Advances in Data Mining for Food Flavor Analysis: A Comprehensive Review of Techniques, Applications and Future Directions,” Journal of Future Foods, May 2025, doi: 10.1016/j.jfutfo.2024.12.002.
G. P. Siknun and I. S. Sitanggang, “Web-based Classification Application for Forest Fire Data Using the Shiny Framework and the C5.0 Algorithm,” Procedia Environ Sci, vol. 33, pp. 332–339, 2016, doi: 10.1016/j.proenv.2016.03.084.
S.-T. Wang, “Integrating KPSO and C5.0 to analyze the omnichannel solutions for optimizing telecommunication retail,” Decis Support Syst, vol. 109, pp. 39–49, May 2018, doi: 10.1016/j.dss.2017.12.009.
B. F. Tanyu, A. Abbaspour, Y. Alimohammadlou, and G. Tecuci, “Landslide susceptibility analyses using Random Forest, C4.5, and C5.0 with balanced and unbalanced datasets,” Catena (Amst), vol. 203, p. 105355, Aug. 2021, doi: 10.1016/j.catena.2021.105355.
Z. Guo, Y. Shi, F. Huang, X. Fan, and J. Huang, “Landslide susceptibility zonation method based on C5.0 decision tree and K-means cluster algorithms to improve the efficiency of risk management,” Geoscience Frontiers, vol. 12, no. 6, p. 101249, Nov. 2021, doi: 10.1016/j.gsf.2021.101249.
S. PANG and J. GONG, “C5.0 Classification Algorithm and Application on Individual Credit Evaluation of Banks,” Systems Engineering - Theory & Practice, vol. 29, no. 12, pp. 94–104, Dec. 2009, doi: 10.1016/S1874-8651(10)60092-0.
G. Feng and Q. Li, “The Study on Innovative Development of the Elderly Care Industry under the Community-based Elderly Care Model Based on the SERVQUAL Model,” Open Public Health J, vol. 18, no. 1, Feb. 2025, doi: 10.2174/0118749445370791250203060003.
D. P. Utomo, P. Sirait, and R. Yunis, “Reduksi Atribut Pada Dataset Penyakit Jantung dan Klasifikasi Menggunakan Algoritma C5.0,” JURNAL MEDIA INFORMATIKA BUDIDARMA, vol. 4, pp. 994–1006, Oct. 2020, doi: 10.30865/mib.v4i4.2355.
S. I. T. Joseph, “Survey of Data Mining Algorithms for Intelligent Computing System,” Journal of Trends in Computer Science and Smart Technology (TCSST), vol. 1, pp. 14–23, 2019.
D. Kim et al., “Efficient mining of incremental high utility patterns with negative unit profits over all the accumulated stream data,” Knowl Based Syst, vol. 325, p. 113956, Sep. 2025, doi: 10.1016/j.knosys.2025.113956.
T. Kristóf and M. Virág, “EU-27 bank failure prediction with C5.0 decision trees and deep learning neural networks,” Res Int Bus Finance, vol. 61, p. 101644, Oct. 2022, doi: 10.1016/j.ribaf.2022.101644.
M. , & H. T. Syafrizal, “A Comparative Study of Classification Algorithms for Predicting Customer Churn on Small dataset,” Procedia Comput Sci, vol. 157, pp. 457–463, 2019.
D. M. Rivero et al., “Service recovery and innovation on customer satisfaction amidst massive typhoon-induced disruptions: The mediating role of SERVQUAL,” International Journal of Disaster Risk Reduction, vol. 99, p. 104130, Dec. 2023, doi: 10.1016/j.ijdrr.2023.104130.
I. , & F. S. Nawangsih, “rediksi Pengangkatan Karyawan Dengan Metode Algoritma C5. 0 (Studi Kasus Pt. Mataram Cakra Buana Agung),” Pelita Teknologi, vol. 16, 2021.
L. Ningrum, R. Nooraeni, S. M. Berliana, and L. K. Sari, “Association of SDG Indicators of the Social Development Pillar in Indonesia using the Apriori Algorithm,” Procedia Comput Sci, vol. 245, pp. 450–459, 2024, doi: 10.1016/j.procs.2024.10.271.
V. V. Burkhovetskiy and B. Y. Steinberg, “Parallelizing an exact algorithm for the traveling salesman problem,” Procedia Comput Sci, vol. 119, pp. 97–102, 2017, doi: 10.1016/j.procs.2017.11.165.
A. Musadi, C. C. Tertius, J. Steven, H. A. Saputri, and K. M. Suryaningrum, “Comparing Artificial Neural Network and Decision Tree Algorithm to Predict Tides at Tanjung Priok Port,” Procedia Comput Sci, vol. 227, pp. 406–414, 2023, doi: 10.1016/j.procs.2023.10.540.
B. Santosa and A. L. Safitri, “Biogeography-based Optimization (BBO) Algorithm for Single Machine Total Weighted Tardiness Problem (SMTWTP),” Procedia Manuf, vol. 4, pp. 552–557, 2015, doi: 10.1016/j.promfg.2015.11.075.
S. H. Abrehdari, “Leveraging the Process Mining Technique to Optimize Data Preparation Time in a Database Used as an Automated Data Delivery Center,” MethodsX, p. 103428, Jun. 2025, doi: 10.1016/j.mex.2025.103428.
F. Yu, G. Li, H. Chen, Y. Guo, Y. Yuan, and B. Coulton, “A VRF charge fault diagnosis method based on expert modification C5.0 decision tree,” International Journal of Refrigeration, vol. 92, pp. 106–112, Aug. 2018, doi: 10.1016/j.ijrefrig.2018.05.034.
C. Nas, “Data Mining Prediksi Minat Calon Mahasiswa Memilih Perguruan Tinggi Menggunakan Algoritma C4.5,” Jurnal Manajemen Informatika (JAMIKA), vol. 11, no. 2, pp. 131–145, Sep. 2021, doi: 10.34010/jamika.v11i2.5506.
Z. Gao, M. Illindala, and J. Lei, “Leveraging data mining for critical branch identification through simultaneity and causality correlation analysis under cascading failures in power systems,” Reliab Eng Syst Saf, vol. 264, p. 111298, Dec. 2025, doi: 10.1016/j.ress.2025.111298.
H.-J. Chiang, C.-C. Tseng, and C.-C. Torng, “A retrospective analysis of prognostic indicators in dental implant therapy using the C5.0 decision tree algorithm,” J Dent Sci, vol. 8, no. 3, pp. 248–255, Sep. 2013, doi: 10.1016/j.jds.2013.04.009.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Klasifikasi Tingkat Kepuasan Peserta Pelatihan Balai Besar Pelatihan Vokasi dan Produktivitas Menggunakan Algoritma C5.0
ARTICLE HISTORY
How to Cite
Issue
Section
Copyright (c) 2025 Fahmi Maulana, Rakhmat Kurniawan
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
