Comparative Analysis of K-Nearest Neighbor and Support Vector Machine Methods for Assessing Quality Standards of Palm Oil Bunches
Keywords:
K-Nearest Neighbors, Support Vector Machine, Quality of Palm Oil Fruit Bunches, Data MiningAbstract
Oil palm (Elaeis guineensis Jacq) is a crucial crop in the agricultural sector, particularly in Indonesia, as it produces various economically valuable products. The quality of oil palm fruit bunches (TBS) significantly influences the production process of crude palm oil (CPO), making accurate quality assessments essential for maintaining industry standards. This study aims to compare the effectiveness of two machine learning methods, K-Nearest Neighbor (K-NN) and Support Vector Machine (SVM), in determining the acceptable quality of TBS. Using TBS data from the years 2019 to 2023, the research analyzes several variables, including maturity level and yield percentage, to develop a web-based system for classifying TBS. The classification process involves preprocessing the data, applying the algorithms, and evaluating their performance based on key metrics such as accuracy, recall, and precision. The results indicate that the K-NN method outperforms SVM, achieving an accuracy of 100%, a recall of 100%, and a precision of 100%. In contrast, the SVM method demonstrates an accuracy of 91%, a recall of 100%, and a precision of 91%. These findings highlight the effectiveness of K-NN in classifying TBS quality while also demonstrating the reliability of SVM. This research is expected to provide valuable insights and effective solutions for decision-making regarding the acceptance of TBS quality, ultimately benefiting stakeholders in the palm oil industry and serving as a reference for future studies in data mining classification.
References
[1] H. Stephanie, N. Tinaprilla, and D. A. Rifin, “EFISIENSI PABRIK KELAPA SAWIT DI INDONESIA,” Jurnal Agribisnis Indonesia, vol. 6, no. 1, pp. 27–36, 2018, [Online]. Available: http://journal.ipb.ac.id/index.php/jagbi
[2] R. K. Dinata, H. Akbar, and N. Hasdyna, “Algoritma K-Nearest Neighbor dengan Euclidean Distance dan Manhattan Distance untuk Klasifikasi Transportasi Bus,” ILKOM Jurnal Ilmiah, vol. 12, no. 2, pp. 104–111, Aug. 2020, doi: 10.33096/ilkom.v12i2.539.104-111.
[3] R. Umar, I. Riadi, D. Astria Faroek, A. Dahlan, S. Sistem Informasi, and U. Ahmad Dahlan, “Komparasi Image Matching Menggunakan Metode K-Nearest Neighbor (KNN) dan Metode Support Vector Machine (SVM),” 2020. [Online]. Available: http://jurnal.polibatam.ac.id/index.php/JAIC
[4] W. R. U. Fadilah, D. Agfiannisa, and Y. Azhar, “Analisis Prediksi Harga Saham PT. Telekomunikasi Indonesia Menggunakan Metode Support Vector Machine,” Fountain of Informatics Journal, vol. 5, no. 2, p. 45, Sep. 2020, doi: 10.21111/fij.v5i2.4449.
[5] R. Kesuma Dinata and N. Hasdyna, “KLASIFIKASI SEKOLAH MENENGAH PERTAMA/SEDERAJAT WILAYAH BIREUEN MENGGUNAKAN ALGORITMA K-NEAREST NEIGHBORS BERBASIS WEB,” 2020.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Siti Hajar, Rozi Kesuma Dinata, Maryana
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Copyright Notice
Authors published in this journal agree to the following terms:
1. The copyright of each article is retained by the author (s).
2. The author grants the journal the first publication rights with the work simultaneously licensed under the Creative Commons Attribution License, allowing others to share the work with an acknowledgment of authorship and the initial publication in this journal.
3. Authors may enter into separate additional contractual agreements for the non-exclusive distribution of published journal versions of the work (for example, posting them to institutional repositories or publishing them in a book), with acknowledgment of their initial publication in this journal.
4. Authors are permitted and encouraged to post their work online (For example in the Institutional Repository or on their website) before and during the submission process, as this can lead to productive exchanges, as well as earlier and larger citations of published work.
5. Articles and all related material published are distributed under a Creative Commons Attribution-ShareAlike 4.0 International License.