The prediction of scholarship recipients in higher education using k-Nearest neighbor algorithm

3rd Annual Applied Science and Engineering Conference

工业技术;自然科学

Kurniadi, D.^1,2 ; Abdurachman, E.^2 ; Warnars, H.L.H.S.^2 ; Suparta, W.^2

Department of Informatics, Sekolah Tinggi Teknologi Garut, Jalan Mayor Syamsu 1, Garut

44151, Indonesia^1

Department of Computer Science, Graduate Program Doctor of Computer Science, Bina Nusantara University, Jakarta

11480, Indonesia^2

关键词: Confusion matrices;    Cumulative grade point averages;    Distance calculation;    Euclidean distance;    K nearest neighbor algorithm;    K-nearest neighbors;    Prediction model;    Prediction process;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/434/1/012039/pdf
DOI  :  10.1088/1757-899X/434/1/012039

来源: IOP

【 摘 要 】

This article aims to implement the algorithm model of k-Nearest Neighbor (k-NN) in analyzing, predicting, and classifying students who have potentials to get scholarships in universities. The k-NN algorithm works by making a prediction based on the closest data points between the old data history as training data and the new data as testing data. The data collected totals 1018 students with 24 scholarship receiver candidate students are used as the dataset for the test purposes. The attributes used in the prediction process are a semester, parents' income, number of family dependents, and Cumulative Grade Point Average. The distance calculation of the value from testing attribute to each training attribute uses Euclidean Distance equation, while the test of the model accuracy value is calculated using Confusion Matrix. The results of the simulation of the prediction model show that the determining factor of training data from both the number and the variation of different values can improve the performance of the k-NN algorithm with the best accuracy rate of 95.83 percent in predicting students who have the greatest chance of getting the scholarship.