Performance improvement of k-nearest neighbor algorithm in KIP scholarship recipient selection

Romadhon, Manzilur Rahman, Faisal, Muhammad ORCID: and Imamudin, Mochamad (2023) Performance improvement of k-nearest neighbor algorithm in KIP scholarship recipient selection. Jurnal Riset Informatika, 5 (4). pp. 465-470. ISSN 26561735

[img] Text
17877.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial.

Download (375kB)


Law 12 of 2012 mandates that the government increase access to higher education for high achievers and underprivileged people. One of the efforts to realize this is by providing KIP Lectures. To ensure that beneficiaries are indeed eligible for KIP scholarships, it is necessary to classify scholarship recipients with data mining classification techniques correctly. The classification technique chosen is k-Nearest Neighbor (K-NN). K-NN is a classification method that relies heavily on the k parameter in carrying out classification. K-NN was applied to the KIP Scholarship applicant dataset at UIN Malang in 2022. The test scenario in this research is to compare the k-odd and k-even parameters to find the most optimal k value in K-NN. The highest accuracy value obtained by k-odd is 0.71 or 71% when k=9, and the highest for k-even is 0.67 or 67% when k=10. Using optimal k parameters is proven to improve k-NN performance. The K-NN algorithm with k-odd parameters, namely k=9, is the best method for classifying KIP scholarship recipients in this research. The results of this research can be considered in determining KIP scholarship recipients worthy of using K-NN.

Item Type: Journal Article
Keywords: k-nn; Parameter of k; KIP
Subjects: 08 INFORMATION AND COMPUTING SCIENCES > 0801 Artificial Intelligence and Image Processing > 080109 Pattern Recognition and Data Mining
Divisions: Faculty of Technology > Department of Informatics Engineering
Depositing User: Muhammad Faisal
Date Deposited: 04 Jan 2024 14:20


Downloads per month over past year

Origin of downloads

Actions (login required)

View Item View Item