Klasterisasi Jawaban Uraian Mahasiswa Menggunakan TF-IDF dan K-Means untuk Membantu Koreksi Ujian

Authors

  • Irsyad Arif Mashudi Politeknik Negeri Malang Malang
  • Sofyan Noor Arief Politeknik Negeri Malang Malang
  • Deasy Sandhya E.I. Politeknik Negeri Malang Malang
  • Triana Fatmawati Politeknik Negeri Malang Malang
  • Mamluatul Hani’ah Politeknik Negeri Malang Malang
  • Irfan Thalib Alfarid Politeknik Negeri Malang Malang

DOI:

https://doi.org/10.30865/mib.v7i4.6688

Keywords:

Essay Correction System, Clustering, TF-IDF, K-Means, Decision Support System

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.

References

N. A. Zulkifli, M. Mukaiyar, H. Syarif, and Y. Rozimela, “Challenges In Assessing Students’ Writing For Future Instruction,†vol. 301, no. Icla 2018, pp. 713–722, 2019, doi: 10.2991/icla-18.2019.117.

R. Rajesh. and R. Kanimozhi., “Digitized Exam Paper Evaluation,†in 2019 IEEE International Conference on System, Computation, Automation and Networking (ICSCAN), Pondicherry, India: IEEE, Mar. 2019, pp. 1–5. doi: 10.1109/ICSCAN.2019.8878791.

A. A. P. Ratna, N. A. Wulandari, A. Kaltsum, I. Ibrahim, and P. D. Purnamasari, “Answer Categorization Method Using K-Means for Indonesian Language Automatic Short Answer Grading System Based on Latent Semantic Analysis,†in 2019 16th International Conference on Quality in Research (QIR): International Symposium on Electrical and Computer Engineering, Padang, Indonesia: IEEE, Jul. 2019, pp. 1–5. doi: 10.1109/QIR.2019.8897845.

A. Onan, “Two-Stage Topic Extraction Model for Bibliometric Data Analysis Based on Word Embeddings and Clustering,†IEEE Access, vol. 7, pp. 145614–145633, 2019, doi: 10.1109/ACCESS.2019.2945911.

M. Ahmed, R. Seraj, and S. M. S. Islam, “The k-means algorithm: A comprehensive survey and performance evaluation,†Electronics (Switzerland), vol. 9, no. 8, pp. 1–12, 2020, doi: 10.3390/electronics9081295.

W. N. Ibrahem Al-Obaydy, H. A. Hashim, Y. AbdulKhaleq Najm, and A. A. Jalal, “Document classification using term frequency-inverse document frequency and K-means clustering,†Indonesian Journal of Electrical Engineering and Computer Science, vol. 27, no. 3, pp. 1517–1524, 2022, doi: 10.11591/ijeecs.v27.i3.pp1517-1524.

A. Abdulhafedh, “Incorporating K-means, Hierarchical Clustering and PCA in Customer Segmentation,†Journal of City and Development, vol. 3, no. 1, pp. 12–30, 2021, doi: 10.12691/jcd-3-1-3.

A. Zikir, K. Nurfadilah, Irwan, and Adiatma, “Perbandingan Metode Clustering Dengan Menggunakan Metode Average Linkage Dan Metode K-Means Pada Industri Kecil Dan Menengah Di Kabupaten Wajo,†Jurnal Matematika dan Statistika serta Aplikasinya, vol. 10, no. 2, 2022.

I. M. Nugroho and T. I. Hermanto, “ANALISIS CLUSTERING UNTUK PENGELOMPOKAN JUDUL SKRIPSI MAHASISWA MENGGUNAKAN METODE TF-IDF DAN ALGORITMA K-MEANS (STUDI KASUS : STT WASTUKANCANA),†rabit, vol. 6, no. 1, pp. 55–67, Jan. 2021, doi: 10.36341/rabit.v6i1.1617.

S. A. Hasan, W. Ruiqin, and M. G. Hussain, “Clustering Analysis of Bangla News Articles with TF-IDF & CV Using Mini-Batch K-Means and K-Means,†in 2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom), Malang, Indonesia: IEEE, Jun. 2022, pp. 17–22. doi: 10.1109/CyberneticsCom55287.2022.9865339.

W. N. I. Al-Obaydy, H. A. Hashim, Y. A. Najm, and A. A. Jalal, “Document classification using term frequency-inverse document frequency and K-means clustering,†IJEECS, vol. 27, no. 3, p. 1517, Sep. 2022, doi: 10.11591/ijeecs.v27.i3.pp1517-1524.

W. Arif and N. A. Mahoto, “Document Clustering – A Feasible Demonstration with K-means Algorithm,†in 2019 2nd International Conference on Computing, Mathematics and Engineering Technologies (iCoMET), Sukkur, Pakistan: IEEE, Jan. 2019, pp. 1–6. doi: 10.1109/ICOMET.2019.8673480.

A. Fitriyani, D. Handayani, A. Noeman, A. R. Mahbub, R. Salkiawati, and A. Fathurrozi, “E-Archive Document Clustering Information System Using K-Means Algorithm,†in 2022 Seventh International Conference on Informatics and Computing (ICIC), Denpasar, Bali, Indonesia: IEEE, Dec. 2022, pp. 1–5. doi: 10.1109/ICIC56845.2022.10006935.

R. K. Ibrahim, S. R. M. Zeebaree, K. Jacksi, M. A. M. Sadeeq, H. M. Shukur, and A. Alkhayyat, “Design a Clustering Document based Semantic Similarity System using TFIDF and K-Mean,†in 2021 4th International Iraqi Conference on Engineering Technology and Their Applications (IICETA), Najaf, Iraq: IEEE, Sep. 2021, pp. 87–93. doi: 10.1109/IICETA51758.2021.9717942.

A. A. P. Ratna, R. R. Noviaindriani, L. Santiar, I. Ibrahim, and P. D. Purnamasari, “K-Means Clustering for Answer Categorization on Latent Semantic Analysis Automatic Japanese Short Essay Grading System,†in 2019 16th International Conference on Quality in Research (QIR): International Symposium on Electrical and Computer Engineering, Padang, Indonesia: IEEE, Jul. 2019, pp. 1–5. doi: 10.1109/QIR.2019.8898271.

S. Xueqi, Z. Suohuai, J. Xuedong, and H. Yanlong, “Key information extraction method of traditional Chinese medicine records based on TF-IDF and K-means,†in 2022 7th International Conference on Intelligent Informatics and Biomedical Science (ICIIBMS), Nara, Japan: IEEE, Nov. 2022, pp. 335–340. doi: 10.1109/ICIIBMS55689.2022.9971547.

M. I. Zul, F. Yulia, and D. Nurmalasari, “Social Media Sentiment Analysis Using K-Means and Naïve Bayes Algorithm,†in 2018 2nd International Conference on Electrical Engineering and Informatics (ICon EEI), Batam, Indonesia: IEEE, Oct. 2018, pp. 24–29. doi: 10.1109/ICon-EEI.2018.8784326.

K. Venkatachalam, V. P. Reddy, M. Amudhan, A. Raguraman, and E. Mohan, “An Implementation of K-Means Clustering for Efficient Image Segmentation,†in 2021 10th IEEE International Conference on Communication Systems and Network Technologies (CSNT), Bhopal, India: IEEE, Jun. 2021, pp. 224–229. doi: 10.1109/CSNT51715.2021.9509680.

A. Librian, “High quality stemmer library for Indonesian Language (Bahasa).†[Online]. Available: https://github.com/sastrawi/sastrawi

I. A. Mashudi and S. N. Arief, “ANALISIS SENTIMEN PERKEMBANGAN KASUS COVID-19 PADA KOMENTAR FACEBOOK,†JTIA, vol. 2, no. 1, pp. 5–9, Jan. 2021, doi: 10.33795/jtia.v2i1.47.

H. B. Tambunan, D. H. Barus, J. Hartono, A. S. Alam, D. A. Nugraha, and H. H. H. Usman, “Electrical Peak Load Clustering Analysis Using K-Means Algorithm and Silhouette Coefficient,†in 2020 International Conference on Technology and Policy in Energy and Electric Power (ICT-PEP), Bandung, Indonesia: IEEE, Sep. 2020, pp. 258–262. doi: 10.1109/ICT-PEP50916.2020.9249773.

Downloads

Published

2023-10-31

Issue

Vol. 7 No. 4 (2023): Oktober 2023

Section

Articles

License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).