Klasifikasi Algoritma KNN dalam menentukan Penerima Bantuan Langsung Tunai

Ryan Hamonangan, Risa Komala Sari, Saeful Anwar, Tuti Hartati

Abstract


Poverty is a condition where an individual or a group experiences economic incapacity to meet their basic needs, and this study involves broader aspects than just expenditures. The focus of this research is on Ciherang and Ciaro Villages, located in the Nagreg Subdistrict, Bandung Regency, which are areas with significant levels of poverty. This research responds to poverty issues by utilizing the K-Nearest Neighbor (KNN) Algorithm in the data mining classification process. KNN considers the proximity of a new object to its nearest neighbors, and as a supervised learning algorithm, KNN requires target information or classes in the analyzed dataset. The aim of this research is to provide information regarding the classification of recipients of Direct Cash Assistance (BLT) in Ciherang and Ciaro Villages. The research results present data on criteria for determining whether recipients are considered eligible or ineligible for BLT, with an accuracy rate reaching 81.56%. Additionally, the performance of this algorithm is demonstrated through true recall values for both eligible and ineligible recipients, with recall for true ineligible recipients at 88.43%, recall for true eligible recipients at 74.80%, precision for eligible recipients at 86.79%, and precision for ineligible recipients at 77.54%. These findings provide a basis for more accurate decision-making in determining BLT recipients in both villages. This can contribute to the design of more targeted and effective social policies in reducing the impact of poverty, providing in-depth insights into the characteristics of BLT recipients, and demonstrating the relevance and efficiency of the KNN algorithm in addressing complex social issues.


Keywords


Classification, KNN Algorithm, Direct Cash Assistance (BLT)

Full Text:

PDF

References


Erliyana et al. (2021) ‘JURNAL DATA SCIENCE & INFORMATIKA ( JDSI ) Analisa Penjualan Mobil Dengan Menggunakan Algoritma’, 1(2), pp. 32–35.

Nurdiawan, O. (2023a) ‘Experimental Student Experiences’, 1(4).

Nurdiawan, O. (2023b) ‘PENERAPAN DATA MINING MENGGUNAKAN ALGORITMA FREQUENT PATTERN - GROWTH UNTUK MENENTUKAN POLA PEMBELIAN PRODUK CHEMICALS’, 7(1), pp. 547–551.

Nurjanah, A. and Rifai, A. (2023) ‘Penerapan Algoritma K-Nearest Neighbor Untuk Klasifikasi Kelayakan Status Penduduk Miskin Di Desa Susukan Tonggoh’, 2(1), pp. 164–176.

Pahrudin, P. and Harianto, K. (2022) ‘Penerapan Algoritma K-Nearest Neighbor Untuk Klasifikasi Warga Penerima Bantuan Sosial’, 4(3), pp. 1241–1245. Available at: https://doi.org/10.47065/bits.v4i3.2276.

Pauji, A. et al. (2022) ‘Implementasi Algoritma K-Nearest Neighbor Dalam Menentukan Penerima Bantuan Langsung Tunai’, 04(01), pp. 1–7.

Prasetiya, T. et al. (2020) ‘Klasifikasi Status Stunting Balita Di Desa Slangit Menggunakan Metode K-Nearest Neighbor’, INFORMATICS FOR EDUCATORS AND PROFESSIONAL : Journal of Informatics, 5(1), p. 93. Available at: https://doi.org/10.51211/itbi.v5i1.1431.

Triayudi, A. (2023) ‘Penerapan Data Mining Untuk Klasifikasi Penerima Dana Bantuan Sosial Dengan Menggunakan Algoritma K-Nearest Neighbor’, 5(2), pp. 532–542. Available at: https://doi.org/10.47065/bits.v5i2.3972.

Washilaturrizqi and Nurdiawan, O. (2023) ‘IMPLEMENTASI ALGORITMA C4 . 5 UNTUK MENENTUKAN PENERIMA’, 7(1), pp. 373–377.

Widaningsih, S. et al. (2022) ‘Penerapan Data Mining Untuk Memprediksi Siswa Berprestasi Dengan Menggunakan Algoritma K Nearest Neighbor’, 9(3), pp. 2598–2611.




DOI: http://dx.doi.org/10.36499/jinrpl.v6i1.10298

Refbacks

  • There are currently no refbacks.


INDEXED BY :

Google Scholar GarudaCrossrefBASE Dimensions DOAJOne Search Scilit Sinta

 

 

 


Address : :

Fakultas Teknik Universitas Wahid Hasyim

JL. Menoreh Tengah X / 22, Sampangan, Gajahmungkur, Kota Semarang, Jawa Tengah 50232, Indonesia
Handphone: 0815-6529-309
Email: jinformatika@unwahas.ac.id
 
 
RJI JournalStories Main logo
View My Stats
ISSN : 2656-2855   E-ISSN : 2685-5518