A comparative assessment of data standardization on support vector machine for classification problems

2015 ◽  
Vol 19 (3) ◽  
pp. 529-546 ◽  
Author(s):  
Dah-Chin Luor
Keyword(s):  
Support Vector Machine ◽  
Comparative Assessment ◽  
Support Vector ◽  
Classification Problems ◽  
Data Standardization

scholarly journals A Novel Hybrid Model Based on TVIW-PSO-GSA Algorithm and Support Vector Machine for Classification Problems

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 27789-27801 ◽  
Author(s):  
Hongxin Xue ◽  
Yanping Bai ◽  
Hongping Hu ◽  
Ting Xu ◽  
Haijian Liang
Keyword(s):  
Support Vector Machine ◽  
Hybrid Model ◽  
Support Vector ◽  
Classification Problems ◽  
Model Based

Shape-restricted support vector machine (SR-SVM): a SVM classifier taking supplementary shape information of input

2021 ◽  
Vol 40 (1) ◽  
pp. 1481-1494
Author(s):  
Geng Deng ◽  
Yaoguo Xie ◽  
Xindong Wang ◽  
Qiang Fu
Keyword(s):  
Support Vector Machine ◽  
Classification Performance ◽  
Research Literature ◽  
Support Vector ◽  
Svm Classifier ◽  
Classification Problems ◽  
Active Set ◽  
Shape Information ◽  
Convex Optimization Problem ◽  
Shape Restrictions

Many classification problems contain shape information from input features, such as monotonic, convex, and concave. In this research, we propose a new classifier, called Shape-Restricted Support Vector Machine (SR-SVM), which takes the component-wise shape information to enhance classification accuracy. There exists vast research literature on monotonic classification covering monotonic or ordinal shapes. Our proposed classifier extends to handle convex and concave types of features, and combinations of these types. While standard SVM uses linear separating hyperplanes, our novel SR-SVM essentially constructs non-parametric and nonlinear separating planes subject to component-wise shape restrictions. We formulate SR-SVM classifier as a convex optimization problem and solve it using an active-set algorithm. The approach applies basis function expansions on the input and effectively utilizes the standard SVM solver. We illustrate our methodology using simulation and real world examples, and show that SR-SVM improves the classification performance with additional shape information of input.

scholarly journals Developing Support Vector Machine with New Fuzzy Selection for the Infringement of a Patent Rights Problem

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1263
Author(s):  
Chih-Yao Chang ◽  
Kuo-Ping Lin
Keyword(s):  
Support Vector Machine ◽  
Data Quality ◽  
Classification Performance ◽  
Patent Infringement ◽  
Classification Method ◽  
Training Dataset ◽  
Support Vector ◽  
Classification Problems ◽  
Data Quality Management ◽  
Patent Rights

Classification problems are very important issues in real enterprises. In the patent infringement issue, accurate classification could help enterprises to understand court decisions to avoid patent infringement. However, the general classification method does not perform well in the patent infringement problem because there are too many complex variables. Therefore, this study attempts to develop a classification method, the support vector machine with new fuzzy selection (SVMFS), to judge the infringement of patent rights. The raw data are divided into training and testing sets. However, the data quality of the training set is not easy to evaluate. Effective data quality management requires a structural core that can support data operations. This study adopts new fuzzy selection based on membership values, which are generated from fuzzy c-means clustering, to select appropriate data to enhance the classification performance of the support vector machine (SVM). An empirical example based on the SVMFS shows that the proposed SVMFS can obtain a superior accuracy rate. Moreover, the new fuzzy selection also verifies that it can effectively select the training dataset.

Feature selection for damage degree classification of planetary gearboxes using support vector machine

2011 ◽  
Vol 225 (9) ◽  
pp. 2250-2264 ◽  
Author(s):  
J Qu ◽  
Z Liu ◽  
M J Zuo ◽  
H-Z Huang
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Planetary Gear ◽  
Support Vector ◽  
Classification Problems ◽  
Damage Degree ◽  
Binary Model ◽  
Benchmark Datasets ◽  
Degree Classification ◽  
Feature Dimension

Feature selection is an effective way of improving classification, reducing feature dimension, and speeding up computation. This work studies a reported support vector machine (SVM) based method of feature selection. Our results reveal discrepancies in both its feature ranking and feature selection schemes. Modifications are thus made on which our SVM-based method of feature selection is proposed. Using the weighting fusion technique and the one-against-all approach, our binary model has been extensively updated for multi-class classification problems. Three benchmark datasets are employed to demonstrate the performance of the proposed method. The multi-class model of the proposed method is also used for feature selection in planetary gear damage degree classification. The results of all datasets exhibit the consistently effective classification made possible by the proposed method.

A tutorial on support vector machine-based methods for classification problems in chemometrics

2010 ◽  
Vol 665 (2) ◽  
pp. 129-145 ◽  
Author(s):  
Jan Luts ◽  
Fabian Ojeda ◽  
Raf Van de Plas ◽  
Bart De Moor ◽  
Sabine Van Huffel ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Support Vector ◽  
Classification Problems

scholarly journals An Improvement Of Least Square - Twin Support Vector Machine

2021 ◽  
pp. 8-13
Author(s):  
Thế Cường Nguyễn ◽  
Thanh Vi Nguyen
Keyword(s):  
Support Vector Machine ◽  
Binary Classification ◽  
Least Square ◽  
Twin Support Vector Machine ◽  
Support Vector ◽  
Classification Problems ◽  
Training Time ◽  
Data Points

In binary classification problems, two classes of data seem to be different from each other. It is expected to bemore complicated due to the number of data points of clusters in each class also be different. Traditional algorithmsas Support Vector Machine (SVM), Twin Support Vector Machine (TSVM), or Least Square Twin Support VectorMachine (LSTSVM) cannot sufficiently exploit information about the number of data points in each cluster of the data.Which may be effect to the accuracy of classification problems. In this paper, we propose a new Improvement LeastSquare - Support Vector Machine (called ILS-SVM) for binary classification problems with a class-vs-clusters strategy.Experimental results show that the ILS-SVM training time is faster than that of TSVM, and the ILS-SVM accuracy isbetter than LSTSVM and TSVM in most cases.

Sign in / Sign up

Export Citation Format

Share Document