ANALISIS KOMPARATIF DECISION TREE, K-NEAREST NEIGHBOR, SUPPORT VECTOR MACHINE, DAN RANDOM FOREST UNTUK PREDIKSI OBJEK BERBASIS FITUR NUMERIK
DOI:
https://doi.org/10.30646/tikomsin.v14i1.1098Keywords:
artificial intelligence, object prediction, machine learning, classification, random forestAbstract
This study addresses the problem of object classification using numerical feature representations in machine learning environments. The research aims to compare the performance of four supervised learning algorithms, namely Decision Tree, K-Nearest Neighbor (KNN), Support Vector Machine (SVM), and Random Forest, in predicting object classes. The methodology consists of data preprocessing, normalization using Min-Max Scaling, model training, and evaluation using accuracy, precision, recall, and F1-score. A dataset of 2,400 samples with 18 numerical features and four object classes was used, with an 80:20 train-test split and cross-validation for robustness. The results show that Random Forest achieved the highest performance with 95.1% accuracy and 0.949 F1-score, followed by SVM with 93.2% accuracy. KNN and Decision Tree achieved 90.4% and 88.1% accuracy, respectively.The novelty of this study lies in the structured experimental pipeline and comprehensive multi-metric evaluation combined with computational efficiency analysis for object prediction using tabular data.It can be concluded that ensemble-based methods such as Random Forest provide superior generalization and stability for heterogeneous object data.
References
P. Tsirtsakis, G. Zacharis, G. S. Maraslidis, and G. F. Fragulis, “Deep learning for object recognition: A comprehensive review of models and algorithms,†International Journal of Cognitive Computing in Engineering, vol. 6, pp. 298-312, 2025, doi: 10.1016/j.ijcce.2025.01.004.
M. Trigka and E. Dritsas, “A Comprehensive Survey of Machine Learning Techniques and Models for Object Detection,†Sensors, vol. 25, no. 1, Art. no. 214, 2025, doi: 10.3390/s25010214.
J. Wang, S. Zou, Y. Wang, W. Huang, and J. Song, “Unified benchmark construction and algorithm performance evaluation for large-scale object detection,†Discover Computing, vol. 28, Art. no. 196, 2025, doi: 10.1007/s10791-025-09707-x.
K. M. Sujon, R. Hassan, K. Choi, and M. A. Samad, “Accuracy, precision, recall, f1-score, or MCC? empirical evidence from advanced statistics, ML, and XAI for evaluating business predictive models,†Journal of Big Data, vol. 12, Art. no. 268, 2025, doi: 10.1186/s40537-025-01313-4.
J. Kim, H. Maathuis, and D. Sent, “Human-centered evaluation of explainable AI applications: a systematic review,†Frontiers in Artificial Intelligence, vol. 7, 2024, doi: 10.3389/frai.2024.1456486.
S. T. H. Shah, S. A. H. Shah, I. I. Khan, et al., “Data-driven classification and explainable-AI in the field of lung imaging,†Frontiers in Big Data, vol. 7, 2024, doi: 10.3389/fdata.2024.1393758.
M. Kasahun and A. Legesse, “Machine learning for urban land use/ cover mapping: Comparison of artificial neural network, random forest and support vector machine, a case study of Dilla town,†Heliyon, vol. 10, Art. no. e39146, 2024, doi: 10.1016/j.heliyon.2024.e39146.
C. Albertini, A. Gioia, V. Iacobellis, G. P. Petropoulos, and S. Manfreda, “Assessing multi-source random forest classification and robustness of predictor variables in flooded areas mapping,†Remote Sensing Applications: Society and Environment, vol. 35, Art. no. 101239, 2024, doi: 10.1016/j.rsase.2024.101239.
R. Iranzad and X. Liu, “A review of random forest-based feature selection methods for data science education and applications,†International Journal of Data Science and Analytics, vol. 20, pp. 197-211, 2025, doi: 10.1007/s41060-024-00509-w.
M. I. Khaldi, A. Erraissi, M. Hain, et al., “Comparative Analysis of Supervised Machine Learning Classification Models,†in Intersection of Artificial Intelligence, Data Science, and Cutting-Edge Technologies: From Concepts to Applications in Smart Environment, LNNS, vol. 1353, pp. 321-326, 2025, doi: 10.1007/978-3-031-88304-0_44.
I. Carvalho, H. G. Oliveira, and C. Silva, “A Multidimensional Taxonomy for Recent Trends in Explainable Artificial Intelligence,†in Progress in Artificial Intelligence (EPIA 2024), Lecture Notes in Artificial Intelligence, vol. 14968, pp. 273-284, 2024, doi: 10.1007/978-3-031-73501-1_23.
G. Schwalbe and B. Finzel, “A comprehensive taxonomy for explainable artificial intelligence: a systematic survey of surveys on methods and concepts,†Data Mining and Knowledge Discovery, vol. 38, pp. 3043-3101, 2024, doi: 10.1007/s10618-022-00867-8.
Y.-H. Gao, X.-W. Huang, and Y.-M. Meng, “A systematic evaluation of data preprocessing and model optimization for machine learning algorithms: Using sphalerite trace element data as an example,†Journal of Asian Earth Sciences, vol. 292, Art. no. 106728, 2025, doi: 10.1016/j.jseaes.2025.106728.
E. Kulkarni and M. Digalwar, “Rule-Driven Preprocessing for Improving Machine Learning Model Performance,†SN Computer Science, vol. 6, Art. no. 996, 2025, doi: 10.1007/s42979-025-04543-8.
C. Sharma, S. Sharma, K. Sharma, G. K. Sethi, and H.-Y. Chen, “Exploring explainable AI: a bibliometric analysis,†Discover Applied Sciences, vol. 6, Art. no. 615, 2024, doi: 10.1007/s42452-024-06324-z.
Downloads
Additional Files
Published
Issue
Section
Citation Check
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 a Creative Commons Attribution License that allows others to share the work with an acknowledgement 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 acknowledgement 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 (See The Effect of Open Access).
Â
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
