Implementation of TF-IDF Method and Support Vector Machine Algorithm for Job Applicants Text Classification

MUHAMMAD FARIS LUTHFI

Informasi Dasar

108 kali
20.04.4278
006.31
Karya Ilmiah - Skripsi (S1) - Reference

Tens of thousands of people are applying for job to large companies every year. The goal of the recruitment process is to get new employees who can fit to the company’s working culture. Due to the high number of applicants, the recruitment process takes a lot of time and requires high cost. This paper implements a popular combination of term frequency-inverse document frequency (TF-IDF) as the extraction method and support vector machine (SVM) as the classifier to filter the applicants' interview verbatim. SVM generally produces better accuracy in text classification compared to random forest or k-nearest neighbors (KNN) algorithm. However, TF-IDF has several developments to improve its flaws, one of them is term frequency-relevance frequency (TF-RF). As a comparison, in this study we use three extraction methods: TF only (without IDF), TF-IDF, and TF-RF. We use the verbatim from interview simulation at PT. Telkom as the data source. The results of SVM combined with TF-IDF achieves 86.31% of accuracy, whereas TF only achieves 85.06%, and with TF-RF gives 83.61% of accuracy. These results show TF-IDF still outperforms TF-RF in term of accuracy for this case.

Subjek

Machine Learning
 

Katalog

Implementation of TF-IDF Method and Support Vector Machine Algorithm for Job Applicants Text Classification
 
-
Indonesia

Sirkulasi

Rp. 0
Rp. 0
Tidak

Pengarang

MUHAMMAD FARIS LUTHFI
Perorangan
KEMAS MUSLIM LHAKSMANA, NIKEN DWI WAHYU CAHYANI
 

Penerbit

Universitas Telkom, S1 Informatika
Bandung
2020

Koleksi

Kompetensi

 

Download / Flippingbook

 

Ulasan

Belum ada ulasan yang diberikan
anda harus sign-in untuk memberikan ulasan ke katalog ini