Infotekmesin
Vol 17 No 2 (2026): Infotekmesin: Juli 2026

Perbandingan Kinerja Algoritma Random Forest, Support Vector Machine, dan Naive Bayes Pada Klasifikasi Judul Skripsi Menggunakan Variasi N-Gram

Nur Wachid Adi Prasetya (Politeknik Negeri Cilacap)
Ike Yunia Pasa (Universitas Muhammadiyah Purworejo)



Article Info

Publish Date
31 Jul 2026

Abstract

Choosing a thesis topic remains challenging because many students struggle to select an appropriate research title. Thesis title classification can support this process by helping identify suitable research areas. Although classification algorithms have been widely applied in sentiment analysis, comparative studies of Random Forest, Support Vector Machine (SVM), and Naive Bayes, for thesis title classification using N-Gram features remain limited. This study compares these algorithms through text preprocessing, TF-IDF-based N-Gram feature extraction, and evaluation using confusion matrices and processing time. The dataset consists of 96 thesis titles classified into four categories: Information Systems, Multimedia, Networks, and IoT & Artificial Intelligence. The results show that SVM achieved the best performance, with 80% accuracy, 89% precision, 80% recall, an F1-score of 81.46%, and a processing time of 0.003 seconds, indicating that SVM is the most effective algorithm for thesis title classification compared with Naive Bayes and Random Forest.

Copyrights © 2026






Journal Info

Abbrev

infotekmesin

Publisher

Subject

Computer Science & IT Electrical & Electronics Engineering Mechanical Engineering

Description

INFOTEKMESIN is a peer-reviewed open-access journal with e-ISSN 2685-9858 and p-ISSN: 2087-1627 published by Pusat Penelitian dan Pengabdian Masyarakat (P3M) Politeknik Negeri Cilacap. The journal invites scientists and engineers to exchange and disseminate theoretical and practice-oriented in the ...