scholarly journals DA-Based Parameter Optimization of Combined Kernel Support Vector Machine for Cancer Diagnosis

Processes ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 263 ◽  
Author(s):  
Tao Xie ◽  
Jun Yao ◽  
Zhiwei Zhou
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Cancer Diagnosis ◽  
Classification Accuracy ◽  
Cancer Classification ◽  
Support Vector ◽  
Svm Classifier ◽  
Data Sets ◽  
Dragonfly Algorithm ◽  
Cancer Data

As is well known, the correct diagnosis for cancer is critical to save patients’ lives. Support vector machine (SVM) has already made an important contribution to the field of cancer classification. However, different kernel function configurations and their parameters will significantly affect the performance of SVM classifier. To improve the classification accuracy of SVM classifier for cancer diagnosis, this paper proposed a novel cancer classification algorithm based on the dragonfly algorithm and SVM with a combined kernel function (DA-CKSVM) which was constructed from a radial basis function (RBF) kernel and a polynomial kernel. Experiments were performed on six cancer data sets from University of California, Irvine (UCI) machine learning repository and two cancer data sets from Cancer Program Legacy Publication Resources to evaluate the validity of the proposed algorithm. Compared with four well-known algorithms: dragonfly algorithm-SVM (DA-SVM), particle swarm optimization-SVM (PSO-SVM), bat algorithm-SVM (BA-SVM), and genetic algorithm-SVM (GA-SVM), the proposed algorithm was able to find the optimal parameters of SVM classifier and achieved better classification accuracy on cancer datasets.

Linguistic Rule Extraction from Support Vector Machine Classifiers

2008 ◽  
pp. 1269-1279
Author(s):  
Xiuju Fu ◽  
Lipo Wang ◽  
GihGuang Hung ◽  
Liping Goh
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Rule Extraction ◽  
Support Vector ◽  
Svm Classifier ◽  
Data Sets ◽  
Linear Kernel ◽  
Linguistic Rule ◽  
Linguistic Rules ◽  
Rbf Kernel

Classification decisions from linguistic rules are more desirable compared to complex mathematical formulas from support vector machine (SVM) classifiers due to the explicit explanation capability of linguistic rules. Linguistic rule extraction has been attracting much attention in explaining knowledge hidden in data. In this chapter, we show that the decisions from an SVM classifier can be decoded into linguistic rules based on the information provided by support vectors and decision function. Given a support vector of a certain class, cross points between each line, which is extended from the support vector along each axis, and an SVM decision hyper-curve are searched first. A hyper-rectangular rule is derived from these cross points. The hyper-rectangle is tuned by a tuning phase in order to exclude those out-class data points. Finally, redundant rules are merged to produce a compact rule set. Simultaneously, important attributes could be highlighted in the extracted rules. Rule extraction results from our proposed method could follow SVM classifier decisions very well. We compare the rule extraction results from SVM with RBF kernel function and linear kernel function. Experiment results show that rules extracted from SVM with RBF nonlinear kernel function are with better accuracy than rules extracted from SVM with linear kernel function. Comparisons between our method and other rule extraction methods are also carried out on several benchmark data sets. Higher rule accuracy is obtained in our method with fewer number of premises in each rule.

Linguistic Rule Extraction from Support Vector Machine Classifiers

2007 ◽  
pp. 276-290
Author(s):  
Xiuju Fu ◽  
Lipo Wang ◽  
GihGuang Hung ◽  
Liping Goh
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Rule Extraction ◽  
Support Vector ◽  
Svm Classifier ◽  
Data Sets ◽  
Linear Kernel ◽  
Linguistic Rule ◽  
Linguistic Rules ◽  
Rbf Kernel

Classification decisions from linguistic rules are more desirable compared to complex mathematical formulas from support vector machine (SVM) classifiers due to the explicit explanation capability of linguistic rules. Linguistic rule extraction has been attracting much attention in explaining knowledge hidden in data. In this chapter, we show that the decisions from an SVM classifier can be decoded into linguistic rules based on the information provided by support vectors and decision function. Given a support vector of a certain class, cross points between each line, which is extended from the support vector along each axis, and an SVM decision hyper-curve are searched first. A hyper-rectangular rule is derived from these cross points. The hyper-rectangle is tuned by a tuning phase in order to exclude those out-class data points. Finally, redundant rules are merged to produce a compact rule set. Simultaneously, important attributes could be highlighted in the extracted rules. Rule extraction results from our proposed method could follow SVM classifier decisions very well. We compare the rule extraction results from SVM with RBF kernel function and linear kernel function. Experiment results show that rules extracted from SVM with RBF nonlinear kernel function are with better accuracy than rules extracted from SVM with linear kernel function. Comparisons between our method and other rule extraction methods are also carried out on several benchmark data sets. Higher rule accuracy is obtained in our method with fewer number of premises in each rule.

Financial Distress Prediction Based on Support Vector Machine with a Modified Kernel Function

2016 ◽  
Vol 25 (3) ◽  
pp. 417-429
Author(s):  
Chong Wu ◽  
Lu Wang ◽  
Zhe Shi
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Financial Distress ◽  
Classification Accuracy ◽  
Feature Space ◽  
Support Vector ◽  
Input Space ◽  
Financial Distress Prediction ◽  
Support Vectors ◽  
Distress Prediction

AbstractFor the financial distress prediction model based on support vector machine, there are no theories concerning how to choose a proper kernel function in a data-dependent way. This paper proposes a method of modified kernel function that can availably enhance classification accuracy. We apply an information-geometric method to modifying a kernel that is based on the structure of the Riemannian geometry induced in the input space by the kernel. A conformal transformation of a kernel from input space to higher-dimensional feature space enlarges volume elements locally near support vectors that are situated around the classification boundary and reduce the number of support vectors. This paper takes the Gaussian radial basis function as the internal kernel. Additionally, this paper combines the above method with the theories of standard regularization and non-dimensionalization to construct the new model. In the empirical analysis section, the paper adopts the financial data of Chinese listed companies. It uses five groups of experiments with different parameters to compare the classification accuracy. We can make the conclusion that the model of modified kernel function can effectively reduce the number of support vectors, and improve the classification accuracy.

Feature Selection Method Based on Mutual Information and Support Vector Machine

2021 ◽  
pp. 2150021
Author(s):  
Gang Liu ◽  
Chunlei Yang ◽  
Sen Liu ◽  
Chunbao Xiao ◽  
Bin Song
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Mutual Information ◽  
Classification Accuracy ◽  
Feature Selection Method ◽  
Selection Method ◽  
Support Vector ◽  
Svm Classifier ◽  
Standard Data ◽  
Feature Dimension

A feature selection method based on mutual information and support vector machine (SVM) is proposed in order to eliminate redundant feature and improve classification accuracy. First, local correlation between features and overall correlation is calculated by mutual information. The correlation reflects the information inclusion relationship between features, so the features are evaluated and redundant features are eliminated with analyzing the correlation. Subsequently, the concept of mean impact value (MIV) is defined and the influence degree of input variables on output variables for SVM network based on MIV is calculated. The importance weights of the features described with MIV are sorted by descending order. Finally, the SVM classifier is used to implement feature selection according to the classification accuracy of feature combination which takes MIV order of feature as a reference. The simulation experiments are carried out with three standard data sets of UCI, and the results show that this method can not only effectively reduce the feature dimension and high classification accuracy, but also ensure good robustness.

scholarly journals Whale optimized mixed kernel function of support vector machine for colorectal cancer diagnosis

2019 ◽  
Vol 92 ◽  
pp. 103124 ◽  
Author(s):  
Dandan Zhao ◽  
Hong Liu ◽  
Yuanjie Zheng ◽  
Yanlin He ◽  
Dianjie Lu ◽  
...  
Keyword(s):  
Colorectal Cancer ◽  
Support Vector Machine ◽  
Kernel Function ◽  
Cancer Diagnosis ◽  
Support Vector

scholarly journals Eye-Tracking Analysis for Emotion Recognition

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Paweł Tarnowski ◽  
Marcin Kołodziej ◽  
Andrzej Majkowski ◽  
Remigiusz Jan Rak
Keyword(s):  
Support Vector Machine ◽  
Eye Movements ◽  
Eye Tracking ◽  
Emotion Recognition ◽  
Classification Accuracy ◽  
Pupil Diameter ◽  
Support Vector ◽  
Svm Classifier ◽  
High Arousal ◽  
Validation Method

This article reports the results of the study related to emotion recognition by using eye-tracking. Emotions were evoked by presenting a dynamic movie material in the form of 21 video fragments. Eye-tracking signals recorded from 30 participants were used to calculate 18 features associated with eye movements (fixations and saccades) and pupil diameter. To ensure that the features were related to emotions, we investigated the influence of luminance and the dynamics of the presented movies. Three classes of emotions were considered: high arousal and low valence, low arousal and moderate valence, and high arousal and high valence. A maximum of 80% classification accuracy was obtained using the support vector machine (SVM) classifier and leave-one-subject-out validation method.

Multiclass Contour-Preserving Classification with Support Vector Machine (SVM)

2017 ◽  
Vol 26 (2) ◽  
pp. 323-334 ◽  
Author(s):  
Piyabute Fuangkhon
Keyword(s):  
Support Vector Machine ◽  
Classification Accuracy ◽  
University Of California ◽  
Support Vector ◽  
Data Sets ◽  
Feed Forward Neural Network ◽  
Real World Data ◽  
Data Set ◽  
The University ◽  
Training Sets

AbstractMulticlass contour-preserving classification (MCOV) has been used to preserve the contour of the data set and improve the classification accuracy of a feed-forward neural network. It synthesizes two types of new instances, called fundamental multiclass outpost vector (FMCOV) and additional multiclass outpost vector (AMCOV), in the middle of the decision boundary between consecutive classes of data. This paper presents a comparison on the generalization of an inclusion of FMCOVs, AMCOVs, and both MCOVs on the final training sets with support vector machine (SVM). The experiments were carried out using MATLAB R2015a and LIBSVM v3.20 on seven types of the final training sets generated from each of the synthetic and real-world data sets from the University of California Irvine machine learning repository and the ELENA project. The experimental results confirm that an inclusion of FMCOVs on the final training sets having raw data can improve the SVM classification accuracy significantly.

scholarly journals Feature Extraction and Classification of MRI Using Hybrid RBF Kernel and SVM

2021 ◽  
pp. 418-426
Author(s):  
Suhas S ◽  
Dr. C. R. Venugopal
Keyword(s):  
Support Vector Machine ◽  
Image Retrieval ◽  
Classification Accuracy ◽  
Kernel Functions ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Svm Classifier ◽  
Mr Images ◽  
Rbf Kernel

An enhanced classification system for classification of MR images using association of kernels with support vector machine is developed and presented in this paper along with the design and development of content-based image retrieval (CBIR) system. Content of image retrieval is the process of finding relevant image from large collection of image database using visual queries. Medical images have led to growth in large image collection. Oriented Rician Noise Reduction Anisotropic Diffusion filter is used for image denoising. A modified hybrid Otsu algorithm termed is used for image segmentation. The texture features are extracted using GLCM method. Genetic algorithm with Joint entropy is adopted for feature selection. The classification is done by support vector machine along with various kernels and the performance is validated. A classification accuracy of 98.83% is obtained using SVM with GRBF kernel. Various features have been extracted and these features are used to classify MR images into five different categories. Performance of the MC-SVM classifier is compared with different kernel functions. From the analysis and performance measures like classification accuracy, it is inferred that the brain and spinal cord MRI classification is best done using MC- SVM with Gaussian RBF kernel function than linear and polynomial kernel functions. The proposed system can provide best classification performance with high accuracy and low error rate.

scholarly journals Improved Cost-Sensitive Support Vector Machine Classifier for Breast Cancer Diagnosis

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Na Liu ◽  
Jiang Shen ◽  
Man Xu ◽  
Dan Gan ◽  
Er-Shi Qi ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Support Vector Machine ◽  
Cancer Diagnosis ◽  
Classification Accuracy ◽  
Support Vector Machine Classifier ◽  
Treatment Plan ◽  
Breast Cancer Diagnosis ◽  
Support Vector ◽  
Classification Models ◽  
Misclassification Costs

As one of the most prevalent cancers among women worldwide, breast cancer has attracted the most attention by researchers. It has been verified that an accurate and early detection of breast cancer can increase the chances for the patients to take the right treatment plan and survive for a long time. Nowadays, numerous classification methods have been utilized for breast cancer diagnosis. However, most of these classification models have concentrated on maximum the classification accuracy, failed to take into account the unequal misclassification costs for the breast cancer diagnosis. To the best of our knowledge, misclassifying the cancerous patient as non-cancerous has much higher cost compared to misclassifying the non-cancerous as cancerous. Consequently, in order to tackle this deficiency and further improve the classification accuracy of the breast cancer diagnosis, we propose an improved cost-sensitive support vector machine classifier (ICS-SVM) for the diagnosis of breast cancer. In the proposed approach, we take full account of unequal misclassification costs of breast cancer intelligent diagnosis and provide more reasonable results over previous works and conventional classification models. To evaluate the performance of the proposed approach, Wisconsin Breast Cancer (WBC) and Wisconsin Diagnostic Breast Cancer (WDBC) breast cancer datasets obtained from the University of California at Irvine (UCI) machine learning repository have been studied. The experimental results demonstrate that the proposed hybrid algorithm outperforms all the existing methods. Promisingly, the proposed method can be regarded as a useful clinical tool for breast cancer diagnosis and could also be applied to other illness diagnosis.

Kernel Parameter Selection for SVM Classification

2011 ◽  
pp. 44-55
Author(s):  
Manju Bala ◽  
R. K. Agrawal
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Classification Accuracy ◽  
Parameter Selection ◽  
Kernel Functions ◽  
Gaussian Kernel ◽  
Support Vector ◽  
Svm Classification ◽  
Kernel Parameter ◽  
Benchmark Datasets

The choice of kernel function and its parameter is very important for better performance of support vector machine. In this chapter, the authors proposed few new kernel functions which satisfy the Mercer’s conditions and a robust algorithm to automatically determine the suitable kernel function and its parameters based on AdaBoost to improve the performance of support vector machine. The performance of proposed algorithm is evaluated on several benchmark datasets from UCI repository. The experimental results for different datasets show that the Gaussian kernel is not always the best choice to achieve high generalization of support vector machine classifier. However, with the proper choice of kernel function and its parameters using proposed algorithm, it is possible to achieve maximum classification accuracy for all datasets.

Sign in / Sign up

Export Citation Format

Share Document