SSVM: A Smooth Support Vector Machine for Classification

Human Development Index (HDI) is measuring achievements of human development based on basic components of quality of life. Human development index is low score if HDI is less than 60, moderate HDI between 60 to less than 70, high HDI between 70 to less than 80, and equal to 80 and more than 80 belong to high HDI. Smooth Support Vector Machine (SSVM) is a classification technique that is new. The algorithm used is Newton Armijo with linear kernel, polynomial kernel, and Radial Basis Function (RBF) kernel. The result of classification of human development index with SSVM method with linear kernel shows the prediction accuracy 84.77%, polynomial kernel 61.65%, and RBF kernel 100%. Radial Base Function Kernel (RBF) is the most accurate kernel in predicting human development index.

Imbalanced data learning is one of the most active and important fields in machine learning research. The existing class imbalance learning methods can make Support Vector Machines (SVMs) less sensitive to class imbalance; they still suffer from the disturbance of outliers and noise present in the datasets. A kind of Fuzzy Smooth Support Vector Machines (FSSVMs) are proposed based on the Smooth Support Vector Machine (SSVM) of O. L. Mangasarian. SSVM can be computed by the Broyden‐Fletcher‐Goldfarb‐Shanno (BFGS) algorithm or the Newton‐Armijo algorithm easily. Two kinds of fuzzy memberships and three smooth functions can be chosen in the algorithms. The fuzzy memberships consider the contribution rate of each sample to the optimal separating hyperplane. The polynomial smooth functions can make the optimization problem more accurate at the inflection point. Those changes play the active effects on trials. The results of the experiments show that the FSSVMs can gain the better accuracy and the shorter time than the SSVMs and some of the other methods.

Support vector machine (SVM) is a supervised machine learning approach that was recognized as a statistical learning apotheosis for the small-sample database. SVM has shown its excellent learning and generalization ability and has been extensively employed in many areas. This paper presents a performance analysis of six types of SVMs for the diagnosis of the classical Wisconsin breast cancer problem from a statistical point of view. The classification performance of standard SVM (St-SVM) is analyzed and compared with those of the other modified classifiers such as proximal support vector machine (PSVM) classifiers, Lagrangian support vector machines (LSVM), finite Newton method for Lagrangian support vector machine (NSVM), Linear programming support vector machines (LPSVM), and smooth support vector machine (SSVM). The experimental results reveal that these SVM classifiers achieve very fast, simple, and efficient breast cancer diagnosis. The training results indicated that LSVM has the lowest accuracy of 95.6107 %, while St-SVM performed better than other methods for all performance indices (accuracy = 97.71 %) and is closely followed by LPSVM (accuracy = 97.3282). However, in the validation phase, the overall accuracies of LPSVM achieved 97.1429 %, which was superior to LSVM (95.4286 %), SSVM (96.5714 %), PSVM (96 %), NSVM (96.5714 %), and St-SVM (94.86 %). Value of ROC and MCC for LPSVM achieved 0.9938 and 0.9369, respectively, which outperformed other classifiers. The results strongly suggest that LPSVM can aid in the diagnosis of breast cancer.

The inclusion in workplaces of video display terminals has brought multiple benefits for the organization of work. Nevertheless, it also implies a series of risks for the health of the workers, since it can cause ocular and visual disorders, among others. In this research, a group of eye and vision-related problems associated with prolonged computer use (known as computer vision syndrome) are studied. The aim is to select the characteristics of the subject that are most relevant for the occurrence of this syndrome, and then, to develop a classification model for its prediction. The estimate of this problem is made by means of support vector machines for classification. This machine learning technique will be trained with the support of a genetic algorithm. This provides the training of the support vector machine with different patterns of parameters, improving its performance. The model performance is verified in terms of the area under the ROC curve, which leads to a model with high accuracy in the classification of the syndrome.

Valley-loss regular simplex support vector machine for robust multiclass classification

In the standard support vector machines for classification, training sets with uneven class sizes results in classification biases towards the class with the large training size. That is to say, the larger the training sample size for one class is, the smaller its corresponding classification error rate is, while the smaller the sample size, the larger the classification error rate. The main causes lie in that the penalty of misclassification for each training sample is considered equally. Weighted support vector machines for classification are proposed in this paper where penalty of misclassification for each training sample is different. By setting the equal penalty for the training samples belonging to same class, and setting the ratio of penalties for different classes to the inverse ratio of the training class sizes, the obtained weighted support vector machines compensate for the undesirable effects caused by the uneven training class size, and the classification accuracy for the class with small training size is improved. Experimental simulations on breast cancer diagnosis show the effectiveness of the proposed methods.

Bond rating is regarded as an important event for measuring financial risk of companies and for determining the investment returns of investors. As a result, it has been a popular research topic for researchers to predict companies' credit ratings by applying statistical and machine learning techniques. The statistical techniques, including multiple regression, multiple discriminant analysis (MDA), logistic models (LOGIT), and probit analysis, have been traditionally used in bond rating. However, one major drawback is that it should be based on strict assumptions. Such strict assumptions include linearity, normality, independence among predictor variables and pre-existing functional forms relating the criterion variablesand the predictor variables. Those strict assumptions of traditional statistics have limited their application to the real world. Machine learning techniques also used in bond rating prediction models include decision trees (DT), neural networks (NN), and Support Vector Machine (SVM). Especially, SVM is recognized as a new and promising classification and regression analysis method. SVM learns a separating hyperplane that can maximize the margin between two categories. SVM is simple enough to be analyzed mathematical, and leads to high performance in practical applications. SVM implements the structuralrisk minimization principle and searches to minimize an upper bound of the generalization error. In addition, the solution of SVM may be a global optimum and thus, overfitting is unlikely to occur with SVM. In addition, SVM does not require too many data sample for training since it builds prediction models by only using some representative sample near the boundaries called support vectors. A number of experimental researches have indicated that SVM has been successfully applied in a variety of pattern recognition fields. However, there are three major drawbacks that can be potential causes for degrading SVM's performance. First, SVM is originally proposed for solving binary-class classification problems. Methods for combining SVMs for multi-class classification such as One-Against-One, One-Against-All have been proposed, but they do not improve the performance in multi-class classification problem as much as SVM for binary-class classification. Second, approximation algorithms (e.g. decomposition methods, sequential minimal optimization algorithm) could be used for effective multi-class computation to reduce computation time, but it could deteriorate classification performance. Third, the difficulty in multi-class prediction problems is in data imbalance problem that can occur when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. SVM ensemble learning is one of machine learning methods to cope with the above drawbacks. Ensemble learning is a method for improving the performance of classification and prediction algorithms. AdaBoost is one of the widely used ensemble learning techniques. It constructs a composite classifier by sequentially training classifiers while increasing weight on the misclassified observations through iterations. The observations that are incorrectly predicted by previous classifiers are chosen more often than examples that are correctly predicted. Thus Boosting attempts to produce new classifiers that are better able to predict examples for which the current ensemble's performance is poor. In this way, it can reinforce the training of the misclassified observations of the minority class. This paper proposes a multiclass Geometric Mean-based Boosting (MGM-Boost) to resolve multiclass prediction problem. Since MGM-Boost introduces the notion of geometric mean into AdaBoost, it can perform learning process considering the geometric mean-based accuracy and errors of multiclass. This study applies MGM-Boost to the real-world bond rating case for Korean companies to examine the feasibility of MGM-Boost. 10-fold cross validations for threetimes with different random seeds are performed in order to ensure that the comparison among three different classifiers does not happen by chance. For each of 10-fold cross validation, the entire data set is first partitioned into tenequal-sized sets, and then each set is in turn used as the test set while the classifier trains on the other nine sets. That is, cross-validated folds have been tested independently of each algorithm. Through these steps, we have obtained the results for classifiers on each of the 30 experiments. In the comparison of arithmetic mean-based prediction accuracy between individual classifiers, MGM-Boost (52.95%) shows higher prediction accuracy than both AdaBoost (51.69%) and SVM (49.47%). MGM-Boost (28.12%) also shows the higher prediction accuracy than AdaBoost (24.65%) and SVM (15.42%)in terms of geometric mean-based prediction accuracy. T-test is used to examine whether the performance of each classifiers for 30 folds is significantly different. The results indicate that performance of MGM-Boost is significantly different from AdaBoost and SVM classifiers at 1% level. These results mean that MGM-Boost can provide robust and stable solutions to multi-classproblems such as bond rating.

Support vector machine for classification based on fuzzy training data

Deep convolutional cross-connected kernel mapping support vector machine based on SelectDropout

The Covid-19 pandemic that has hit the world, including Indonesia, has affected various aspects of life. This has also led to various new policies by the Indonesian government to limit the spread of Covid-19, one of which is the use of masks while on the move. This study aims to apply machine learning to government policy recommendations in allowing people to move without masks. The method used in this research is SVM (Support Vector Machine) for classification and ANN (Artificial Neural Network) for forecasting. The results of this study are MSE (Mean Squared Error) of 4.62 and MAE (Mean Absolute Error) of 0.97, and this study predicts the Covid-19 pandemic will decrease in February 2022 but will tend to rise again in March 2022. Next, in April 2022, cases will decrease. Based on the study results, the implementation of the policy can be carried out in April 2022 regarding community activities without masks.

Power transmission lines are extremely important for the power system to deliver energy of electricity from the plant to the load. The short circuit of fault often occurs in the transmission line and may lead to disconnecting the power supply to the load. This study implements a hybrid technique that is Discrete Wavelet Transformation (DWT) and Support Vector Machine (SVM) for classification of fault in the transmission line. The DWT was created to extract the detailed signal of transient D8 and D9 (order of 4) at 50 kHz for sampling frequency. The value of Root Mean Square (RMS) will be determined by the coefficients D8 and D9 for training and test data using SVM technique. Furthermore, SVM is utilized to detect the fault for each phase and the ground is discovered in the type of fault. The SVM technique has been run using parameter C and kernel scale to achieve the great results of classification of the fault. Type of simulating fault has a variation of location of the fault, fault of resistance and initial angle. The training and test data run for the Test System of Riau, Indonesia. The test result for the classification of fault reaches the highest accuracy of 100%.

The research compares the performance of support vector machine (SVM) and random forest algorithms in identifying songs suitable for relaxation in patients with stress problems. The dataset comprises both Thai and international songs categorized into therapy and non-therapy groups. The results demonstrate that the support vector machine achieves an accuracy of 78%, outperforming the random forest with an accuracy of 72%. Precision and F1-score metrics further emphasize the superiority of the support vector machine in classification. Notably, the support vector machine has recall rates of 50% and 100% for therapy and non-therapy classes, respectively, while the random forest has recall from class therapy of 38% and class non-therapy of 100%. The findings suggest that providing individuals with stress issues the opportunity to listen to stress-reducing music can be a viable approach to reducing the need for psychiatric therapy. The support vector machine is a better algorithm than the random forest for classifying songs for relaxation because it is more accurate, precise, and has more even recall rates.

This paper presents a new support vector machine for simultaneous gene selection and microarray classification. By introducing the adaptive elastic net penalty which is a convex combination of weighted 1-norm penalty and weighted 2-norm penalty, the proposed support vector machine can encourage an adaptive grouping effect and reduce the shrinkage bias for the large coefficients. According to a reasonable correlation between the two regularization parameters, the optimal coefficient paths are shown to be piecewise linear and the corresponding solving algorithm is developed. Experiments are performed on leukaemia data that verify the research results.

The diagnosis of cardiac dysfunctions requires the analysis of long-term ECG signal recordings, often containing hundreds to thousands of heartbeats. The purpose of this work is to propose a diagnostic system for modelling and classification of heartbeat, by use of time features and Support vector machines (SVM) classification algorithm. Neural Networks learning allow us to select a features of each heart beat on the basis of Generalized Orthogonal Forward Regression (GOFR) algorithm and a library of 132 Gaussians with different standard deviations and different means, each beat is represented by five Gaussians with different amplitudes. The parameters of this system are determined and its performance is evaluated for the MIT-BIH arrhythmia database. For a database of 364 normal heartbeats and 1148 abnormal heartbeats, we apply the SVM algorithm with Radial Basis Function kernel. Our results demonstrate that the testing performance of the neural network and SVM diagnostic system is found to be very satisfactory with a recognition rate of 99.67%.

This paper presents a novel method for Face Recognition (FR) by applying Support Vector Machine (SVM) in addressing this Computer Vision (CV) problem. The SVM is a capable learning classifier capable of training polynomials, neural networks and RBFs. Singular Value Decomposition (SVD) are used for feature extraction and while SVM for classification. The proposed algorithm is tested on four databases, viz., FERET, FRGC Ver. 2.0, CMU-PIE and Indian Face Database. The singular values are filtered, sampled and classified using Gaussian RBF kernal for SVM. The results are compared with other known methods to establish the advantage of SV-M/D. The recall rate for the proposed system is about 90%. The colossal augmentation is due to the simple but efficient feature extraction and the ability to learn in a high dimensional space.