scholarly journals On the parameter optimization of Support Vector Machines for binary classification

2012 ◽  
Vol 9 (3) ◽  
pp. 33-43 ◽  
Author(s):  
Paulo Gaspar ◽  
Jaime Carbonell ◽  
José Luís Oliveira
Keyword(s):  
Support Vector Machines ◽  
Binary Classification ◽  
Classification Performance ◽  
Biological Data ◽  
Parameters Optimization ◽  
Support Vector ◽  
Minimal Risk ◽  
Class Separation ◽  
Vector Machines ◽  
Analyse Data

Summary Classifying biological data is a common task in the biomedical context. Predicting the class of new, unknown information allows researchers to gain insight and make decisions based on the available data. Also, using classification methods often implies choosing the best parameters to obtain optimal class separation, and the number of parameters might be large in biological datasets.Support Vector Machines provide a well-established and powerful classification method to analyse data and find the minimal-risk separation between different classes. Finding that separation strongly depends on the available feature set and the tuning of hyper-parameters. Techniques for feature selection and SVM parameters optimization are known to improve classification accuracy, and its literature is extensive.In this paper we review the strategies that are used to improve the classification performance of SVMs and perform our own experimentation to study the influence of features and hyper-parameters in the optimization process, using several known kernels.

scholarly journals A note on supervised classification and Nash-equilibrium problems

2017 ◽  
Vol 51 (2) ◽  
pp. 329-341
Author(s):  
Nicolas Couellan
Keyword(s):  
Nash Equilibrium ◽  
Support Vector Machines ◽  
Supervised Classification ◽  
Dual Space ◽  
Equilibrium Problems ◽  
Support Vector ◽  
Generalized Nash Equilibrium ◽  
Class Separation ◽  
Vector Machines ◽  
Generalized Nash Equilibrium Problems

In this note, we investigate connections between supervised classification and (Generalized) Nash equilibrium problems (NEP & GNEP). For the specific case of support vector machines (SVM), we exploit the geometric properties of class separation in the dual space to formulate a non-cooperative game. NEP and Generalized NEP formulations are proposed for both binary and multi-class SVM problems.

Gaussian Processes for Classification: Mean-Field Algorithms

2000 ◽  
Vol 12 (11) ◽  
pp. 2655-2684 ◽  
Author(s):  
Manfred Opper ◽  
Ole Winther
Keyword(s):  
Support Vector Machines ◽  
Gaussian Processes ◽  
Disordered Systems ◽  
Binary Classification ◽  
Computational Cost ◽  
Mean Field ◽  
Strong Support ◽  
Support Vector ◽  
Vector Machines ◽  
Leave One Out

We derive a mean-field algorithm for binary classification with gaussian processes that is based on the TAP approach originally proposed in statistical physics of disordered systems. The theory also yields an approximate leave-one-out estimator for the generalization error, which is computed with no extra computational cost. We show that from the TAP approach, it is possible to derive both a simpler “naive” mean-field theory and support vector machines (SVMs) as limiting cases. For both mean-field algorithms and support vector machines, simulation results for three small benchmark data sets are presented. They show that one may get state-of-the-art performance by using the leave-one-out estimator for model selection and the built-in leave-one-out estimators are extremely precise when compared to the exact leave-one-out estimate. The second result is taken as strong support for the internal consistency of the mean-field approach.

scholarly journals Bankruptcy Prediction of Engineering Companies in the EU Using Classification Methods

2018 ◽  
Vol 66 (5) ◽  
pp. 1347-1356 ◽  
Author(s):  
Michaela Staňková ◽  
David Hampel
Keyword(s):  
Logistic Regression ◽  
Support Vector Machines ◽  
Binary Classification ◽  
Classification Tree ◽  
Classification Trees ◽  
Bankruptcy Prediction ◽  
Support Vector ◽  
Type I ◽  
Vector Machines ◽  
The Eu

This article focuses on the problem of binary classification of 902 small- and medium‑sized engineering companies active in the EU, together with additional 51 companies which went bankrupt in 2014. For classification purposes, the basic statistical method of logistic regression has been selected, together with a representative of machine learning (support vector machines and classification trees method) to construct models for bankruptcy prediction. Different settings have been tested for each method. Furthermore, the models were estimated based on complete data and also using identified artificial factors. To evaluate the quality of prediction we observe not only the total accuracy with the type I and II errors but also the area under ROC curve criterion. The results clearly show that increasing distance to bankruptcy decreases the predictive ability of all models. The classification tree method leads us to rather simple models. The best classification results were achieved through logistic regression based on artificial factors. Moreover, this procedure provides good and stable results regardless of other settings. Artificial factors also seem to be a suitable variable for support vector machines models, but classification trees achieved better results using original data.

scholarly journals Rescale-Invariant SVM for Binary Classification

2017 ◽  
Author(s):  
Mojtaba Montazery ◽  
Nic Wilson
Keyword(s):  
Machine Learning ◽  
Decision Making ◽  
Support Vector Machines ◽  
Binary Classification ◽  
Experimental Results ◽  
Support Vector ◽  
Computation Method ◽  
Learning Methods ◽  
Machine Learning Methods ◽  
Vector Machines

Support Vector Machines (SVM) are among the most well-known machine learning methods, with broad use in different scientific areas. However, one necessary pre-processing phase for SVM is normalization (scaling) of features, since SVM is not invariant to the scales of the features’ spaces, i.e., different ways of scaling may lead to different results. We define a more robust decision-making approach for binary classification, in which one sample strongly belongs to a class if it belongs to that class for all possible rescalings of features. We derive a way of characterising the approach for binary SVM that allows determining when an instance strongly belongs to a class and when the classification is invariant to rescaling. The characterisation leads to a computation method to determine whether one sample is strongly positive, strongly negative or neither. Our experimental results back up the intuition that being strongly positive suggests stronger confidence that an instance really is positive.

Sign in / Sign up

Export Citation Format

Share Document