A Rough Margin Based Fuzzy Support Vector Machine

2011 ◽  
Vol 204-210 ◽  
pp. 879-882
Author(s):  
Kai Li ◽  
Xiao Xia Lu
Keyword(s):  
Support Vector Machine ◽  
Support Vector Machines ◽  
Rough Set ◽  
Support Vector ◽  
Fuzzy Support Vector Machine ◽  
Lower Margin ◽  
Training Samples ◽  
Separating Hyperplane ◽  
Vector Machines ◽  
Benchmark Datasets

By combining fuzzy support vector machine with rough set, we propose a rough margin based fuzzy support vector machine (RFSVM). It inherits the characteristic of the FSVM method and considers position of training samples of the rough margin in order to reduce overfitting due to noises or outliers. The new proposed algorithm finds the optimal separating hyperplane that maximizes the rough margin containing lower margin and upper margin. Meanwhile, the points lied on the lower margin have larger penalty than these in the boundary of the rough margin. Experiments on several benchmark datasets show that the RFSVM algorithm is effective and feasible compared with the existing support vector machines.

A Solving Algorithm of Fuzzy Support Vector Machines Based on Determination of Membership

2013 ◽  
Vol 756-759 ◽  
pp. 3399-3403
Author(s):  
Hua Duan ◽  
Yan Mei Hou
Keyword(s):  
Support Vector Machine ◽  
Support Vector Machines ◽  
Fuzzy Membership ◽  
Support Vector ◽  
Fuzzy Support Vector Machine ◽  
Construction Algorithm ◽  
Vector Machines ◽  
Fuzzy Support Vector Machines ◽  
Smo Algorithm

In order to overcome the issues that Support Vector Machine is sensitive to the outlier and noise points, Fuzzy Support Vector Machine (FSVM) is proposed. The key issue to solve the FSVM is determinate the fuzzy membership. This paper gives an overview of construction algorithm of the fuzzy membership. We also give an algorithm to solve FSVM that is derived from improved-SMO algorithm.

scholarly journals Generalized Support Vector Machines (GSVMs) model for real-world time series forecasting

2021 ◽  
Author(s):  
Mehrnaz Ahmadi ◽  
Mehdi Khashei
Keyword(s):  
Support Vector Machine ◽  
Support Vector Machines ◽  
Real World ◽  
Support Vector ◽  
Data Sets ◽  
Fuzzy Support Vector Machine ◽  
Data Set ◽  
Proposed Model ◽  
Vector Machines ◽  
Forecasting Performance

Abstract Support vector machines (SVMs) are one of the most popular and widely-used approaches in modeling. Various kinds of SVM models have been developed in the literature of prediction and classification in order to cover different purposes. Fuzzy and crisp support vector machines are a well-known branch of modeling approaches that frequently applied for certain and uncertain modeling, respectively. However, each of these models can only be efficiently used in its specified domain and cannot yield appropriate and accurate results if the opposite situations have occurred. While the real-world systems and data sets often contain both certain and uncertain patterns that are complicatedly mixed together and need to be simultaneously modeled. In this paper, a generalized support vector machine (GSVM) is proposed that can simultaneously benefit the unique advantages of certain and uncertain versions of the traditional support vector machines in their own specialized categories. In the proposed model, the underlying data set is first categorized into two classes of certain and uncertain patterns. Then, certain patterns are modeled by a support vector machine, and uncertain patterns are modeled by a fuzzy support vector machine. After that, the function of the relationship, as well as the relative importance of each component, are estimated by another support vector machine, and subsequently, the final forecasts of the proposed model are calculated. Empirical results of wind speed forecasting indicate that the proposed method not only can achieve more accurate results than support vector machines (SVMs) and fuzzy support vector machines (FSVMs) but also can yield better forecasting performance than traditional fuzzy and nonfuzzy single models and traditional preprocessing-based hybrid models of SVMs.

Membership Calculation Based on Dimension Hierarchical Division

2013 ◽  
Vol 475-476 ◽  
pp. 312-317
Author(s):  
Ping Zhou ◽  
Jin Lei Wang ◽  
Xian Kai Chen ◽  
Guan Jun Zhang
Keyword(s):  
Support Vector Machine ◽  
Fuzzy Membership ◽  
Support Vector ◽  
Fuzzy Support Vector Machine ◽  
Bottom Up ◽  
Generalization Ability ◽  
Clustering Technique ◽  
Novel Approach ◽  
Training Samples ◽  
Noise Sample

Since dataset usually contain noises, it is very helpful to find out and remove the noise in a preprocessing step. Fuzzy membership can measure a samples weight. The weight should be smaller for noise sample but bigger for important sample. Therefore, appropriate sample memberships are vital. The article proposed a novel approach, Membership Calculate based on Hierarchical Division (MCHD), to calculate the membership of training samples. MCHD uses the conception of dimension similarity, which develop a bottom-up clustering technique to calculate the sample membership iteratively. The experiment indicates that MCHD can effectively detect noise and removes them from the dataset. Fuzzy support vector machine based on MCHD outperforms most of approaches published recently and hold the better generalization ability to handle the noise.

scholarly journals Research on Parallel Support Vector Machine Based on Spark Big Data Platform

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yao Huimin
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Big Data ◽  
Support Vector Machines ◽  
Cross Validation ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Lambda Architecture ◽  
Vector Machines ◽  
Data Platform

With the development of cloud computing and distributed cluster technology, the concept of big data has been expanded and extended in terms of capacity and value, and machine learning technology has also received unprecedented attention in recent years. Traditional machine learning algorithms cannot solve the problem of effective parallelization, so a parallelization support vector machine based on Spark big data platform is proposed. Firstly, the big data platform is designed with Lambda architecture, which is divided into three layers: Batch Layer, Serving Layer, and Speed Layer. Secondly, in order to improve the training efficiency of support vector machines on large-scale data, when merging two support vector machines, the “special points” other than support vectors are considered, that is, the points where the nonsupport vectors in one subset violate the training results of the other subset, and a cross-validation merging algorithm is proposed. Then, a parallelized support vector machine based on cross-validation is proposed, and the parallelization process of the support vector machine is realized on the Spark platform. Finally, experiments on different datasets verify the effectiveness and stability of the proposed method. Experimental results show that the proposed parallelized support vector machine has outstanding performance in speed-up ratio, training time, and prediction accuracy.

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.

Combination with Machine Learning Algorithms for the Classification in E-Bussiness

2011 ◽  
Vol 230-232 ◽  
pp. 625-628
Author(s):  
Lei Shi ◽  
Xin Ming Ma ◽  
Xiao Hong Hu
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Machine Learning Algorithms ◽  
Classification Model ◽  
Support Vector ◽  
Mathematical Tool ◽  
Vector Machines

E-bussiness has grown rapidly in the last decade and massive amount of data on customer purchases, browsing pattern and preferences has been generated. Classification of electronic data plays a pivotal role to mine the valuable information and thus has become one of the most important applications of E-bussiness. Support Vector Machines are popular and powerful machine learning techniques, and they offer state-of-the-art performance. Rough set theory is a formal mathematical tool to deal with incomplete or imprecise information and one of its important applications is feature selection. In this paper, rough set theory and support vector machines are combined to construct a classification model to classify the data of E-bussiness effectively.

scholarly journals A Novel Sparse Least Squares Support Vector Machines

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Xiao-Lei Xia ◽  
Weidong Jiao ◽  
Kang Li ◽  
George Irwin
Keyword(s):  
Support Vector Machine ◽  
Least Squares ◽  
Regularization Parameter ◽  
Support Vector ◽  
Training Algorithm ◽  
Least Squares Approximation ◽  
Generalization Ability ◽  
Vector Machines ◽  
Training Cost ◽  
Benchmark Datasets

The solution of a Least Squares Support Vector Machine (LS-SVM) suffers from the problem of nonsparseness. The Forward Least Squares Approximation (FLSA) is a greedy approximation algorithm with a least-squares loss function. This paper proposes a new Support Vector Machine for which the FLSA is the training algorithm—the Forward Least Squares Approximation SVM (FLSA-SVM). A major novelty of this new FLSA-SVM is that the number of support vectors is the regularization parameter for tuning the tradeoff between the generalization ability and the training cost. The FLSA-SVMs can also detect the linear dependencies in vectors of the input Gramian matrix. These attributes together contribute to its extreme sparseness. Experiments on benchmark datasets are presented which show that, compared to various SVM algorithms, the FLSA-SVM is extremely compact, while maintaining a competitive generalization ability.

Study on Prediction of Chaotic Time Series Using Least Squares Support Vector Machines

2014 ◽  
Vol 1061-1062 ◽  
pp. 935-938
Author(s):  
Xin You Wang ◽  
Guo Fei Gao ◽  
Zhan Qu ◽  
Hai Feng Pu
Keyword(s):  
Time Series ◽  
Support Vector Machine ◽  
Support Vector Machines ◽  
Least Squares ◽  
Prediction Accuracy ◽  
Chaotic Time Series ◽  
Support Vector ◽  
Vector Machines ◽  
Online Prediction ◽  
Better Than

The predictions of chaotic time series by applying the least squares support vector machine (LS-SVM), with comparison with the traditional-SVM and-SVM, were specified. The results show that, compared with the traditional SVM, the prediction accuracy of LS-SVM is better than the traditional SVM and more suitable for time series online prediction.

Optimal Reduced-Set Vectors for Support Vector Machines with a Quadratic Kernel

2004 ◽  
Vol 16 (9) ◽  
pp. 1769-1777 ◽  
Author(s):  
Thorsten Thies ◽  
Frank Weber
Keyword(s):  
Support Vector Machine ◽  
Support Vector Machines ◽  
Discriminant Function ◽  
Explicit Solution ◽  
Computational Cost ◽  
One Dimension ◽  
Support Vector ◽  
Homogeneous Kernel ◽  
Vector Machines

To reduce computational cost, the discriminant function of a support vector machine (SVM) should be represented using as few vectors as possible. This problem has been tackled in different ways. In this article, we develop an explicit solution in the case of a general quadratic kernel k(x, x′) = (C + Dx⊺x′)2. For a given number of vectors, this solution provides the best possible approximation and can even recover the discriminant function if the number of used vectors is large enough. The key idea is to express the inhomogeneous kernel as a homogeneous kernel on a space having one dimension more than the original one and to follow the approach of Burges (1996).

SUPPORT VECTOR MACHINES FOR THAI PHONEME RECOGNITION

2001 ◽  
Vol 09 (06) ◽  
pp. 803-813 ◽  
Author(s):  
NUTTAKORN THUBTHONG ◽  
BOONSERM KIJSIRIKUL
Keyword(s):  
Support Vector Machine ◽  
Dimensional Space ◽  
High Dimensional ◽  
Support Vector ◽  
Phoneme Recognition ◽  
Classification Technique ◽  
Separating Hyperplane ◽  
Vector Machines ◽  
Tone Recognition ◽  
Vowel Recognition

The Support Vector Machine (SVM) has recently been introduced as a new pattern classification technique. It learns the boundary regions between samples belonging to two classes by mapping the input samples into a high dimensional space, and seeking a separating hyperplane in this space. This paper describes an application of SVMs to two phoneme recognition problems: 5 Thai tones, and 12 Thai vowels spoken in isolation. The best results on tone recognition are 96.09% and 90.57% for the inside test and outside test, respectively, and on vowel recognition are 95.51% and 87.08% for the inside test and outside test, respectively.

Sign in / Sign up

Export Citation Format

Share Document