Generalized version of the support vector machine for binary classification problems: supporting hyperplane machine

04/13/2014
by   E. G. Abramov, et al.
0

In this paper there is proposed a generalized version of the SVM for binary classification problems in the case of using an arbitrary transformation x -> y. An approach similar to the classic SVM method is used. The problem is widely explained. Various formulations of primal and dual problems are proposed. For one of the most important cases the formulae are derived in detail. A simple computational example is demonstrated. The algorithm and its implementation is presented in Octave language.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2018

GADGET SVM: A Gossip-bAseD sub-GradiEnT Solver for Linear SVMs

In the era of big data, an important weapon in a machine learning resear...
research
04/16/2020

Nonparallel Hyperplane Classifiers for Multi-category Classification

Support vector machines (SVMs) are widely used for solving classificatio...
research
02/15/2021

A generalized quadratic loss for SVM and Deep Neural Networks

We consider some supervised binary classification tasks and a regression...
research
05/20/2015

Fuzzy Least Squares Twin Support Vector Machines

Least Squares Twin Support Vector Machine (LSTSVM) is an extremely effic...
research
09/21/2019

Single Class Universum-SVM

This paper extends the idea of Universum learning [1, 2] to single-class...
research
02/26/2020

Nonlinear classifiers for ranking problems based on kernelized SVM

Many classification problems focus on maximizing the performance only on...
research
09/04/2016

A Probabilistic Optimum-Path Forest Classifier for Binary Classification Problems

Probabilistic-driven classification techniques extend the role of tradit...

Please sign up or login with your details

Forgot password? Click here to reset