scholarly journals Radius Margin Bounds for Support Vector Machines with the RBF Kernel

2003 ◽  
Vol 15 (11) ◽  
pp. 2643-2681 ◽  
Author(s):  
Kai-Min Chung ◽  
Wei-Chun Kao ◽  
Chia-Liang Sun ◽  
Li-Lun Wang ◽  
Chih-Jen Lin
Keyword(s):  
The Other ◽  
Support Vector ◽  
Good Prediction ◽  
Support Vectors ◽  
Svm Model ◽  
Vector Machines ◽  
Comparable Performance ◽  
Important Approach ◽  
Rbf Kernel ◽  
Leave One Out

An important approach for efficient support vector machine (SVM) model selection is to use differentiable bounds of the leave-one-out (loo) error. Past efforts focused on finding tight bounds of loo (e.g., radius margin bounds, span bounds). However, their practical viability is still not very satisfactory. Duan, Keerthi, and Poo (2003) showed that radius margin bound gives good prediction for L2-SVM, one of the cases we look at. In this letter, through analyses about why this bound performs well for L2-SVM, we show that finding a bound whose minima are in a region with small loo values may be more important than its tightness. Based on this principle, we propose modified radius margin bounds for L1-SVM (the other case) where the original bound is applicable only to the hard-margin case. Our modification for L1-SVM achieves comparable performance to L2-SVM. To study whether L1-or L2-SVM should be used, we analyze other properties, such as their differentiability, number of support vectors, and number of free support vectors. In this aspect, L1-SVM possesses the advantage of having fewer support vectors. Their implementations are also different, so we discuss related issues in detail.

The Spinning Quality Control Management Based on Decision Making by Data Mining Techniques

2018 ◽  
Vol 7 (1) ◽  
pp. 72
Author(s):  
Khalid AA Abakar ◽  
Chongwen Yu
Keyword(s):  
Data Mining ◽  
Kernel Functions ◽  
Support Vector ◽  
Ann Model ◽  
Data Mining Techniques ◽  
Yarn Quality ◽  
Yarn Properties ◽  
Svm Model ◽  
Rbf Kernel

This work demonstrated the possibility of using the data mining techniques such as artificial neural networks (ANN) and support vector machine (SVM) based model to predict the quality of the spinning yarn parameters. Three different kernel functions were used as SVM kernel functions which are Polynomial and Radial Basis Function (RBF) and Pearson VII Function-based Universal Kernel (PUK) and ANN model were used as data mining techniques to predict yarn properties. In this paper, it was found that the SVM model based on Person VII kernel function (PUK) have the same performance in prediction of spinning yarn quality in comparison with SVM based RBF kernel. The comparison with the ANN model showed that the two SVM models give a better prediction performance than an ANN model.

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 Landslide Susceptibility Assessment Based on Different MaChine Learning Methods in Zhaoping County of Eastern Guangxi

2021 ◽  
Vol 13 (18) ◽  
pp. 3573
Author(s):  
Chunfang Kong ◽  
Yiping Tian ◽  
Xiaogang Ma ◽  
Zhengping Weng ◽  
Zhiting Zhang ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Random Forest ◽  
Landslide Susceptibility ◽  
Roc Curves ◽  
Support Vector ◽  
Swarm Optimization ◽  
Svm Model ◽  
Vector Machines ◽  
Susceptibility Evaluation ◽  
Landslide Disaster

Regarding the ever increasing and frequent occurrence of serious landslide disaster in eastern Guangxi, the current study was implemented to adopt support vector machines (SVM), particle swarm optimization support vector machines (PSO-SVM), random forest (RF), and particle swarm optimization random forest (PSO-RF) methods to assess landslide susceptibility in Zhaoping County. To this end, 10 landslide disaster-related variables including digital elevation model (DEM)-derived, meteorology-derived, Landsat8-derived, geology-derived, and human activities factors were provided. Of 345 landslide disaster locations found, 70% were used to train the models, and the rest of them were performed for model verification. The aforementioned four models were run, and landslide susceptibility evaluation maps were produced. Then, receiver operating characteristics (ROC) curves, statistical analysis, and field investigation were performed to test and verify the efficiency of these models. Analysis and comparison of the results denoted that all four landslide models performed well for the landslide susceptibility evaluation as indicated by the area under curve (AUC) values of ROC curves from 0.863 to 0.934. Among them, it has been shown that the PSO-RF model has the highest accuracy in comparison to other landslide models, followed by the PSO-SVM model, the RF model, and the SVM model. Moreover, the results also showed that the PSO algorithm has a good effect on SVM and RF models. Furthermore, the landslide models devolved in the present study are promising methods that could be transferred to other regions for landslide susceptibility evaluation. In addition, the evaluation results can provide suggestions for disaster reduction and prevention in Zhaoping County of eastern Guangxi.

Abutment scour in clear-water and live-bed conditions by GMDH network

2013 ◽  
Vol 67 (5) ◽  
pp. 1121-1128 ◽  
Author(s):  
Mohammad Najafzadeh ◽  
Gholam-Abbas Barani ◽  
Masoud Reza Hessami Kermani
Keyword(s):  
Back Propagation ◽  
Support Vector ◽  
Group Method ◽  
Scour Depth ◽  
Back Propagation Algorithm ◽  
Clear Water ◽  
Sediment Size ◽  
Svm Model ◽  
Vector Machines ◽  
Abutment Scour

In the present study, the Group Method of Data Handling (GMDH) network has been utilized to predict abutments scour depth for both clear-water and live-bed conditions. The GMDH network was developed using a Back Propagation algorithm (BP). Input parameters that were considered as effective variables on abutment scour depth included properties of sediment size, geometry of bridge abutments, and properties of approaching flow. Training and testing performances of the GMDH network were carried out using dimensionless parameters that were collected from the literature. The testing results were compared with those obtained using the Support Vector Machines (SVM) model and the traditional equations. The GMDH network predicted the abutment scour depth with lower error (RMSE (root mean square error) = 0.29 and MAPE (mean absolute percentage of error) = 0.99) and higher (R = 0.98) accuracy than those performed using the SVM model and the traditional equations.

scholarly journals Cascade Support Vector Machines with Dimensionality Reduction

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Oliver Kramer
Keyword(s):  
Support Vector Machines ◽  
Dimensionality Reduction ◽  
Principal Component ◽  
Large Data ◽  
Locally Linear Embedding ◽  
Benchmark Problems ◽  
Support Vector ◽  
Training Set ◽  
Support Vectors ◽  
Vector Machines

Cascade support vector machines have been introduced as extension of classic support vector machines that allow a fast training on large data sets. In this work, we combine cascade support vector machines with dimensionality reduction based preprocessing. The cascade principle allows fast learning based on the division of the training set into subsets and the union of cascade learning results based on support vectors in each cascade level. The combination with dimensionality reduction as preprocessing results in a significant speedup, often without loss of classifier accuracies, while considering the high-dimensional pendants of the low-dimensional support vectors in each new cascade level. We analyze and compare various instantiations of dimensionality reduction preprocessing and cascade SVMs with principal component analysis, locally linear embedding, and isometric mapping. The experimental analysis on various artificial and real-world benchmark problems includes various cascade specific parameters like intermediate training set sizes and dimensionalities.

Support Vector Machine Classification applied on Weaning Trials Patients

2008 ◽  
pp. 1277-1282
Author(s):  
B.F. Giraldo ◽  
A. Garde ◽  
C. Arizmendi ◽  
R. Jané ◽  
I. Diaz ◽  
...  
Keyword(s):  
Mechanical Ventilation ◽  
Support Vector Machine ◽  
Support Vector Machines ◽  
Work Of Breathing ◽  
Selection Procedure ◽  
Respiratory Pattern ◽  
Support Vector ◽  
Vector Machines ◽  
Leave One Out ◽  
Pattern Variability

The most common reason for instituting mechanical ventilation is to decrease a patient’s work of breathing. Many attempts have been made to increase the effectiveness on the evaluation of the respiratory pattern by means of respiratory signal analysis. This work suggests a method of studying the lying differences in respiratory pattern variability between patients on weaning trials. The core of the proposed method is the use of support vector machines to classify patients into two groups, taking into account 35 features of each one, previously extracted from the respiratory flow. 146 patients from mechanical ventilation were studied: Group S of 79 patients with Successful trials, and Group F of 67 patients that Failed on the attempt to maintain spontaneous breathing and had to be reconnected. Applying a feature selection procedure based on the use of the support vector machine with leave-one-out cross-validation, it was obtained 86.67% of well classified patients into the Group S and 73.34% into Group F, using only eight of the 35 features. Therefore, support vector machines can be an interesting classification method in the study of the respiratory pattern variability.

scholarly journals Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel

2003 ◽  
Vol 15 (7) ◽  
pp. 1667-1689 ◽  
Author(s):  
S. Sathiya Keerthi ◽  
Chih-Jen Lin
Keyword(s):  
Support Vector Machines ◽  
Model Selection ◽  
Heuristic Method ◽  
Gaussian Kernel ◽  
Support Vector ◽  
Svm Classifier ◽  
Vector Machines ◽  
Rbf Kernel ◽  
Linear Svm ◽  
Generalization Errors

Support vector machines (SVMs) with the gaussian (RBF) kernel have been popular for practical use. Model selection in this class of SVMs involves two hyper parameters: the penalty parameter C and the kernel width σ. This letter analyzes the behavior of the SVM classifier when these hyper parameters take very small or very large values. Our results help in understanding the hyperparameter space that leads to an efficient heuristic method of searching for hyperparameter values with small generalization errors. The analysis also indicates that if complete model selection using the gaussian kernel has been conducted, there is no need to consider linear SVM.

scholarly journals Application of the Artificial Neural Network and Support Vector Machines in Forest Fire Prediction in the Guangxi Autonomous Region, China

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Yudong Li ◽  
Zhongke Feng ◽  
Shilin Chen ◽  
Ziyu Zhao ◽  
Fengge Wang
Keyword(s):  
Neural Network ◽  
Support Vector Machines ◽  
Forest Fire ◽  
Bp Neural Network ◽  
Forest Fires ◽  
Prediction Accuracy ◽  
Support Vector ◽  
Autonomous Region ◽  
Svm Model ◽  
Vector Machines

The study of forest fire prediction is of great environmental and scientific significance. China’s Guangxi Autonomous Region has a high incidence rate of forest fires. At present, there is little research on forest fires in this area. The application of the artificial neural network and support vector machines (SVM) in forest fire prediction in this area can provide data for forest fire prevention and control in Guangxi. In this paper, based on Guangxi’s 2010–2018 satellite monitoring hotspot data, meteorology, terrain, vegetation, infrastructure, and socioeconomic data, the researchers determined the main forest fire driving factors in Guangxi. They used feature selection and backpropagation neural networks and radial basis SVM to build forest fire prediction models. Finally, the researchers use the accuracy, precision, and area under the characteristic curve (ROC-AUC) and other indicators to evaluate the predictive performance of the two models. The results showed that the prediction accuracy of the BP neural network and SVM is 92.16% and 89.89%, respectively. As both results are over 85%, the requirements of prediction accuracy is met. These results can be used for forest fire prediction in the Guangxi Autonomous Region. Specifically, the accuracy of the BP neural network was 0.93, which was higher than that of the SVM model (0.89); the recall of the SVM model was 0.84, which was lower than the BANN model (0.92), and the AUC value of the SVM model was 0.95, which was lower than the BP neural network model. The obtained results confirm that the BP neural network model can provide more prediction accuracy than support vector machines and is therefore more suitable for forest fire prediction in Guangxi, China. This research provides the necessary theoretical basis and data support for application in the field of forestry of the Guangxi Autonomous Region, China.

scholarly journals A Support Vector Machine Based Approach for Predicting the Risk of Freshwater Disease Emergence in England

Stats ◽  
2019 ◽  
Vol 2 (1) ◽  
pp. 89-103 ◽  
Author(s):  
Hossein Hassani ◽  
Emmanuel Silva ◽  
Marine Combe ◽  
Demetra Andreou ◽  
Mansi Ghodsi ◽  
...  
Keyword(s):  
Freshwater Fish ◽  
Support Vector ◽  
Fish Disease ◽  
Disease Emergence ◽  
Freshwater Biodiversity ◽  
Chi Square ◽  
Svm Model ◽  
Vector Machines ◽  
Accuracy Rates ◽  
High Fish

Disease emergence, in the last decades, has had increasingly disproportionate impacts on aquatic freshwater biodiversity. Here, we developed a new model based on Support Vector Machines (SVM) for predicting the risk of freshwater fish disease emergence in England. Following a rigorous training process and simulations, the proposed SVM model was validated and reported high accuracy rates for predicting the risk of freshwater fish disease emergence in England. Our findings suggest that the disease monitoring strategy employed in England could be successful at preventing disease emergence in certain parts of England, as areas in which there were high fish introductions were not correlated with high disease emergence (which was to be expected from the literature). We further tested our model’s predictions with actual disease emergence data using Chi-Square tests and test of Mutual Information. The results identified areas that require further attention and resource allocation to curb future freshwater disease emergence successfully.

Research of load identification based on multiple-input multiple-output SVM model selection

2011 ◽  
Vol 226 (5) ◽  
pp. 1395-1409 ◽  
Author(s):  
W Mao ◽  
M Tian ◽  
G Yan
Keyword(s):  
Model Selection ◽  
Multiple Input Multiple Output ◽  
Identification Accuracy ◽  
Support Vector ◽  
Load Identification ◽  
Multi Objective ◽  
Svm Model ◽  
Multiple Input ◽  
Input Multiple Output ◽  
Leave One Out

In this article, the problem of multiple-input multiple-output (MIMO) load identification is addressed. First, load identification is proved in dynamic theory as non-linear MIMO black-box modelling process. Second, considering the effect of hyper-parameters in small-size sample problem, a new MIMO Support Vector Machine (SVM) model selection method based on multi-objective particle swarm optimization is proposed in order to improve the identification's performance. The proposed method treats the model selection of MIMO SVM as a multi-objective optimization problem, and leave-one-out generalization errors of all output models are minimized simultaneously. Once the Pareto-optimal solutions are found, the SVM model with the best generalization ability is determined. The proposed method is evaluated in the experiment of dynamic load identification on cylinder stochastic vibration system, demonstrating its benefits in comparison to the existing model selection methods in terms of identification accuracy and numerical stability, especially near the peaks.

Sign in / Sign up

Export Citation Format

Share Document