Komparasi Teknik Hyperparameter Optimization pada SVM untuk Permasalahan Klasifikasi dengan Menggunakan Grid Search dan Random Search

  • Fajri M
  • Primajaya A
N/ACitations
Citations of this article
141Readers
Mendeley users who have this article in their library.

Abstract

Classification is one of the important tasks in the field of Machine Learning. Classification can be viewed as an Optimization Problem (Optimization Problem) with the aim of finding the best model that can represent the relationship/pattern between data with labels. Support Vector Machine (SVM) Is an algorithm in Machine Learning used to solve problems such as Classification or Regression. The performance of the SVM algorithm is strongly influenced by parameters, for example error prediction in non-linear SVM results in parameters C and gamma. In this study, an analysis of the technique was carried out to obtain good parameter values using Grid search and Random Search on seven datasets. Evaluation is done by calculating the value of accuracy, memory usage and validity test time of the best model by the two techniques.

Cite

CITATION STYLE

APA

Fajri, M., & Primajaya, A. (2023). Komparasi Teknik Hyperparameter Optimization pada SVM untuk Permasalahan Klasifikasi dengan Menggunakan Grid Search dan Random Search. Journal of Applied Informatics and Computing, 7(1), 14–19. https://doi.org/10.30871/jaic.v7i1.5004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free