Algoritma Multi-Kelas Twin Bounded SVM Untuk Klasifikasi Pola

  • Tomasouw B
  • Leleury Z
N/ACitations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Pattern recognition is a process of recognizing patterns by using machine learning algorithm. Pattern recognition can be defined as a classification of data based on knowledge that already gained or  information extracted from patterns. One method that can be used in pattern classification problem is SVM. In this study we introduced Twin Bounded SVM which is refinement of Twin SVM. The discussion begins with the linear Twin Bounded SVM method to solve a two-class classification problem and followed by an algorithm to solve multi-class classification problem

Cite

CITATION STYLE

APA

Tomasouw, B. P., & Leleury, Z. A. (2020). Algoritma Multi-Kelas Twin Bounded SVM Untuk Klasifikasi Pola. Tensor: Pure and Applied Mathematics Journal, 1(1), 15–24. https://doi.org/10.30598/tensorvol1iss1pp15-24

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