PDF Get rights and content
OriginalPaper | Open access | Published: July 31, 2022

A Study on the Effectiveness of k-NN Algorithm for Career Guidance in Education

Indriyani, Laros Tuhuteru, Gentur Wahyu Nyipto Wibowo, Alex Wenda, I Nengah Sandi
JINAV: Journal of Information and Visualization, Vol. 3 No. 1 (2022), pp. 43-49 https://doi.org/10.35877/454RI.jinav1491 Published: 2022-07-31
Get Permissions

Abstract

This study aims to evaluate the performance of k-NN algorithm in recommending career paths for students based on their interests, past courses, and career goals. The k-NN algorithm was applied to a dataset of student information and its performance was evaluated using quantitative or qualitative measures such as accuracy or user satisfaction. The results indicated that the algorithm provided accurate recommendations and that the choice of k and the use of Euclidean distance measure were crucial for the performance of the algorithm. However, the study also highlighted the limitations of the research, such as the size and diversity of the dataset used, which could have affected the generalizability of the results. This study emphasizes the potential of data-driven approaches in career guidance in education and the k-NN algorithm as a valuable tool in this field. Future research could include incorporating additional factors such as student demographics or academic performance into the algorithm and using more diverse and larger datasets

Keywords

academic performancecareer guidanceeducationEuclidean distancek-NN algorithm

References (17)

  1. G. Hermawan, “‘Implementasi Algoritma Greedy Best First Search pada Aplikasi Permainan Congklak untuk Optimasi Pemilihan Lubang dengan Pola Berfikir Dinamis,’” in Seminar Nasional Teknologi Informasi dan Multimedia (SNASTIA), 2012, pp. 1–6. doi: 10.13140/RG.2.1.1742.4801.
  2. M. Eremia, K. Tomsovic, and G. Cârtină, “Expert Systems,” in Advanced Solutions in Power Systems: HVDC, FACTS, and AI Techniques, 2016. doi: 10.1002/9781119175391.ch15.
  3. I. Giachos, E. C. Papakitsos, and G. Chorozoglou, “Exploring natural language understanding in robotic interfaces,” Int. J. Adv. Intell. Informatics, vol. 3, no. 1, pp. 10–19, Mar. 2017, doi: 10.26555/ijain.v3i1.81.
  4. A. S. M. Lumenta, “PERBANDINGAN METODE PENCARIAN DEPTH-FIRST SEARCH, BREADTH-FIRST SEARCH DAN BEST-FIRST SEARCH PADA PERMAINAN 8-PUZZLE,” e-journal Tek. Elektro dan Komput., 2014.
  5. P. Langley and S. Sage, “Induction of Selective Bayesian Classifiers,” Proc. Tenth Int. Conf. Uncertain. Artif. Intell., no. 1990, pp. 399–406, 1994, doi: 10.1016/B978-1-55860-332-5.50055-9.
  6. “Pembelajaran Supervised SVM Untuk Identifikasi Obyek Pisau Pada Mesin X-Ray Bandara Juanda Agung Santoso, Isturom Arif, M. Hatta.” Accessed: Jun. 02, 2019. [Online]. Available: https://njca.co.id/main/index.php/njca/article/viewFile/2/2
  7. P. Kaushik, A. Sharma, and G. S. Bhathal, “Revamping Supermarkets with AI and RSSi∗,” 2021. doi: 10.1109/ICAIS50930.2021.9395814.
  8. M. Melanie, “An introduction to genetic algorithms,” Cambridge, Massachusetts London, England, …, p. 162, 1996, doi: 10.1016/S0898-1221(96)90227-8.
  9. U. Agrawal et al., “Combining clustering and classification ensembles: A novel pipeline to identify breast cancer profiles,” Artif. Intell. Med., vol. 97, pp. 27–37, 2019, doi: 10.1016/j.artmed.2019.05.002.
  10. N. El-Sourani, S. Hauke, and M. Borschbach, “An evolutionary approach for solving the Rubik’s cube incorporating exact methods,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, vol. 6024 LNCS, no. PART 1, pp. 80–89. doi: 10.1007/978-3-642-12239-2-9.

How to Cite

Indriyani, I., Tuhuteru, L., Wibowo, G. W. N., Wenda, A., & Sandi, I. N. (2022). A Study on the Effectiveness of k-NN Algorithm for Career Guidance in Education. JINAV: Journal of Information and Visualization, 3(1), 43–49. https://doi.org/10.35877/454RI.jinav1491