Claim Missing Document
Check
Articles

Found 1 Documents
Search

Klasterisasi Jawaban Uraian Mahasiswa Menggunakan TF-IDF dan K-Means untuk Membantu Koreksi Ujian Irsyad Arif Mashudi; Sofyan Noor Arief; Deasy Sandhya E.I.; Triana Fatmawati; Mamluatul Hani’ah; Irfan Thalib Alfarid
JURNAL MEDIA INFORMATIKA BUDIDARMA Vol 7, No 4 (2023): Oktober 2023
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/mib.v7i4.6688

Abstract

One way to ensure students understand a topic is by giving them essay questions. Essay questions provide a more accurate evaluation compared to other types of questions. However, this raises new problems where lecturers often have not found an effective way to assess answers to essay questions. The large number of students makes the assessment process take a long time. However, in reality, there are many similarities in the answers between students. These similar answers can be grouped and given the same grade. Unfortunately, if done manually, this grouping takes a very long time. Clustering is one way that can be used to determine variations in student answers as a whole. TF-IDF and K-Means are the clustering algorithms that are considered the strongest and most popular. By using TF-IDF and K-Means to help lecturers group students' descriptive answers, it turns out to be quite effective because with a percentage of conformity to the grouping results of 65%, lecturers can group descriptive answers in a much faster time than manually grouping descriptive answers.