Density based fuzzy support vector machine: application to diabetes dataset

2021 ◽  
Vol 8 (4) ◽  
pp. 747-760
Author(s):  
A. El Ouissari ◽  
◽  
K. El Moutaouakil ◽  
Keyword(s):  
Support Vector Machine ◽  
Clinical Data ◽  
Optimization Model ◽  
Prediction Accuracy ◽  
Experimental Results ◽  
Support Vector ◽  
Data Sets ◽  
Fuzzy Support Vector Machine ◽  
Optimization Program ◽  
Support Vectors

In this work, we propose a deep prediction diabetes system based on a new version of the support vector machine optimization model. First, we determine three types of patients (noisy, cord, and interior) basing on specific parameters. Second, we equilibrate the clinical data sets by suppressing noisy and cord patients. Third, we determine the support vectors by solving an optimization program with a reasonable size. Our system is performed on the well-known diabetes dataset PIMA. The experimental results show that the proposed method improves the prediction accuracy and the proposed system significantly outperforms all other versions of SVM as well as literature methods of classification.

Affinity and class probability-based fuzzy support vector machine for imbalanced data sets

2020 ◽  
Vol 122 ◽  
pp. 289-307 ◽  
Author(s):  
Xinmin Tao ◽  
Qing Li ◽  
Chao Ren ◽  
Wenjie Guo ◽  
Qing He ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Imbalanced Data ◽  
Support Vector ◽  
Data Sets ◽  
Fuzzy Support Vector Machine ◽  
Imbalanced Data Sets ◽  
Class Probability

A New Fuzzy Support Vector Machine for Credit Scoring

2011 ◽  
Vol 109 ◽  
pp. 636-640
Author(s):  
Bo Tang ◽  
Min Xia
Keyword(s):  
Support Vector Machine ◽  
Economic Development ◽  
Prediction Accuracy ◽  
Credit Scoring ◽  
Fuzzy Membership ◽  
Support Vector ◽  
Good Prediction ◽  
Support Vector Machine Algorithm ◽  
Fuzzy Support Vector Machine ◽  
Good Prediction Accuracy

With China's rapid economic development, credit scoring has become very important. This paper presents a new fuzzy support vector machine algorithm used to solve the problems of credit scoring. The empirical results show that the proposed fuzzy membership model is valid ,the algorithm has good prediction accuracy and anti-noise ability.

An New Fuzzy Support Vector Machine for Binary Classification

2012 ◽  
Vol 433-440 ◽  
pp. 2856-2861 ◽  
Author(s):  
Rui Zhang ◽  
Tong Bo Liu ◽  
Ming Wen Zheng
Keyword(s):  
Support Vector Machine ◽  
Binary Classification ◽  
Experimental Results ◽  
New Method ◽  
Support Vector ◽  
Fuzzy Support Vector Machine

In this paper, we proposed a new fuzzy support vector machine(called L2–FSVM here), which error part of object is L2–norm.Meanwhile we introduce a new method of generating fuzzy memberships so as to reduce to effects of outliers. The experimental results demonstrate that the L2-FSVM method provides improved ability to reduce to effects of outliers in comparison with traditional SVMs and FSVMs, and claim that L2–FSVM is the best way to solve the binary classification in the three methods stated above.

scholarly journals Support vector machine and its difficulties from control field of view

2021 ◽  
pp. 014233122097743
Author(s):  
Maryam Yalsavar ◽  
Paknoosh Karimaghaei ◽  
Akbar Sheikh-Akbari ◽  
Pancham Shukla ◽  
Peyman Setoodeh
Keyword(s):  
Support Vector Machine ◽  
Large Scale ◽  
Regularization Parameter ◽  
Experimental Results ◽  
Support Vector ◽  
Support Vectors ◽  
Kernel Parameter ◽  
Wide Range ◽  
Benchmark Datasets ◽  
Training Error

The application of the support vector machine (SVM) classification algorithm to large-scale datasets is limited due to its use of a large number of support vectors and dependency of its performance on its kernel parameter. In this paper, SVM is redefined as a control system and iterative learning control (ILC) method is used to optimize SVM’s kernel parameter. The ILC technique first defines an error equation and then iteratively updates the kernel function and its regularization parameter using the training error and the previous state of the system. The closed loop structure of the proposed algorithm increases the robustness of the technique to uncertainty and improves its convergence speed. Experimental results were generated using nine standard benchmark datasets covering a wide range of applications. Experimental results show that the proposed method generates superior or very competitive results in term of accuracy than those of classical and state-of-the-art SVM based techniques while using a significantly smaller number of support vectors.

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.

DIESEL ENGINE MODELLING USING EXTREME LEARNING MACHINE UNDER SCARCE AND EXPONENTIAL DATA SETS

2013 ◽  
Vol 21 (supp02) ◽  
pp. 87-98 ◽  
Author(s):  
PAK KIN WONG ◽  
CHI MAN VONG ◽  
CHUN SHUN CHEUNG ◽  
KA IN WONG
Keyword(s):  
Support Vector Machine ◽  
Diesel Engine ◽  
Extreme Learning Machine ◽  
Prediction Accuracy ◽  
Logarithmic Transformation ◽  
Training Data ◽  
Support Vector ◽  
Data Sets ◽  
Sample Data ◽  
Learning Machine

To predict the performance of a diesel engine, current practice relies on the use of black-box identification where numerous experiments must be carried out in order to obtain numerical values for model training. Although many diesel engine models based on artificial neural networks (ANNs) have already been developed, they have many drawbacks such as local minima, user burden on selection of optimal network structure, large training data size and poor generalization performance, making themselves difficult to be put into practice. This paper proposes to use extreme learning machine (ELM), which can overcome most of the aforementioned drawbacks, to model the emission characteristics and the brake-specific fuel consumption of the diesel engine under scarce and exponential sample data sets. The resulting ELM model is compared with those developed using popular ANNs such as radial basis function neural network (RBFNN) and advanced techniques such as support vector machine (SVM) and its variants, namely least squares support vector machine (LS-SVM) and relevance vector machine (RVM). Furthermore, some emission outputs of diesel engines suffer from the problem of exponentiality (i.e., the output y grows up exponentially along input x) that will deteriorate the prediction accuracy. A logarithmic transformation is therefore applied to preprocess and post-process the sample data sets in order to improve the prediction accuracy of the model. Evaluation results show that ELM with the logarithmic transformation is better than SVM, LS-SVM, RVM and RBFNN with/without the logarithmic transformation, regardless the model accuracy and training time.

A Computational Method for the Identification of Endolysins and Autolysins

2020 ◽  
Vol 27 (4) ◽  
pp. 329-336 ◽  
Author(s):  
Lei Xu ◽  
Guangmin Liang ◽  
Baowen Chen ◽  
Xu Tan ◽  
Huaikun Xiang ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Cell Wall ◽  
Experimental Results ◽  
Computational Method ◽  
Lytic Enzyme ◽  
Support Vector ◽  
Lytic Enzymes ◽  
Data Set ◽  
Optimal Feature ◽  
Better Than

Background: Cell lytic enzyme is a kind of highly evolved protein, which can destroy the cell structure and kill the bacteria. Compared with antibiotics, cell lytic enzyme will not cause serious problem of drug resistance of pathogenic bacteria. Thus, the study of cell wall lytic enzymes aims at finding an efficient way for curing bacteria infectious. Compared with using antibiotics, the problem of drug resistance becomes more serious. Therefore, it is a good choice for curing bacterial infections by using cell lytic enzymes. Cell lytic enzyme includes endolysin and autolysin and the difference between them is the purpose of the break of cell wall. The identification of the type of cell lytic enzymes is meaningful for the study of cell wall enzymes. Objective: In this article, our motivation is to predict the type of cell lytic enzyme. Cell lytic enzyme is helpful for killing bacteria, so it is meaningful for study the type of cell lytic enzyme. However, it is time consuming to detect the type of cell lytic enzyme by experimental methods. Thus, an efficient computational method for the type of cell lytic enzyme prediction is proposed in our work. Method: We propose a computational method for the prediction of endolysin and autolysin. First, a data set containing 27 endolysins and 41 autolysins is built. Then the protein is represented by tripeptides composition. The features are selected with larger confidence degree. At last, the classifier is trained by the labeled vectors based on support vector machine. The learned classifier is used to predict the type of cell lytic enzyme. Results: Following the proposed method, the experimental results show that the overall accuracy can attain 97.06%, when 44 features are selected. Compared with Ding's method, our method improves the overall accuracy by nearly 4.5% ((97.06-92.9)/92.9%). The performance of our proposed method is stable, when the selected feature number is from 40 to 70. The overall accuracy of tripeptides optimal feature set is 94.12%, and the overall accuracy of Chou's amphiphilic PseAAC method is 76.2%. The experimental results also demonstrate that the overall accuracy is improved by nearly 18% when using the tripeptides optimal feature set. Conclusion: The paper proposed an efficient method for identifying endolysin and autolysin. In this paper, support vector machine is used to predict the type of cell lytic enzyme. The experimental results show that the overall accuracy of the proposed method is 94.12%, which is better than some existing methods. In conclusion, the selected 44 features can improve the overall accuracy for identification of the type of cell lytic enzyme. Support vector machine performs better than other classifiers when using the selected feature set on the benchmark data set.

Sign in / Sign up

Export Citation Format

Share Document