scholarly journals Piecewise-Smooth Support Vector Machine for Classification

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Qing Wu ◽  
Wenqing Wang

Support vector machine (SVM) has been applied very successfully in a variety of classification systems. We attempt to solve the primal programming problems of SVM by converting them into smooth unconstrained minimization problems. In this paper, a new twice continuously differentiable piecewise-smooth function is proposed to approximate the plus function, and it issues a piecewise-smooth support vector machine (PWSSVM). The novel method can efficiently handle large-scale and high dimensional problems. The theoretical analysis demonstrates its advantages in efficiency and precision over other smooth functions. PWSSVM is solved using the fast Newton-Armijo algorithm. Experimental results are given to show the training speed and classification performance of our approach.

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Chia-Hui Huang ◽  
Keng-Chieh Yang ◽  
Han-Ying Kao

Big data is a new trend at present, forcing the significant impacts on information technologies. In big data applications, one of the most concerned issues is dealing with large-scale data sets that often require computation resources provided by public cloud services. How to analyze big data efficiently becomes a big challenge. In this paper, we collaborate interval regression with the smooth support vector machine (SSVM) to analyze big data. Recently, the smooth support vector machine (SSVM) was proposed as an alternative of the standard SVM that has been proved more efficient than the traditional SVM in processing large-scale data. In addition the soft margin method is proposed to modify the excursion of separation margin and to be effective in the gray zone that the distribution of data becomes hard to be described and the separation margin between classes.


2019 ◽  
Vol 28 (07) ◽  
pp. 1950020
Author(s):  
Amine Besrour ◽  
Riadh Ksantini

Support Vector Machine (SVM) is a very competitive linear classifier based on convex optimization problem, were support vectors fully describe decision boundary. Hence, SVM is sensitive to data spread and does not take into account the existence of class subclasses, nor minimizes data dispersion for classification performance improvement. Thus, Kernel subclass SVM (KSSVM) was proposed to handle multimodal data and to minimize data dispersion. Nevertheless, KSSVM has difficulties in classifying sequentially obtained data and handling large scale datasets, since it is based on batch learning. For this reason, we propose a novel incremental KSSVM (iKSSVM) which handles dynamic and large data in a proper manner. The iKSSVM is still based on convex optimization problem and minimizes data dispersion within and between data subclasses incrementally, in order to improve discriminative power and classification performance. An extensive comparative evaluation of the iKSSVM to batch KSSVM, as well as, other contemporary incremental classifiers, on real world datasets, has shown clearly its superiority in terms of classification accuracy.


2011 ◽  
Vol 148-149 ◽  
pp. 1438-1441 ◽  
Author(s):  
Shao Chao Sun ◽  
Dao Huang

In this paper, we propose a new type of ε-insensitive loss function, called as ε-insensitive Fair estimator. With this loss function we can obtain better robustness and sparseness. To enhance the learning speed ,we apply the smoothing techniques that have been used for solving the support vector machine for classification, to replace the ε-insensitive Fair estimator by an accurate smooth approximation. This will allow us to solve ε-SFSVR as an unconstrained minimization problem directly. Based on the simulation results, the proposed approach has fast learning speed and better generalization performance whether outliers exist or not.


2011 ◽  
Vol 181-182 ◽  
pp. 830-835
Author(s):  
Min Song Li

Latent Semantic Indexing(LSI) is an effective feature extraction method which can capture the underlying latent semantic structure between words in documents. However, it is probably not the most appropriate for text categorization to use the method to select feature subspace, since the method orders extracted features according to their variance,not the classification power. We proposed a method based on support vector machine to extract features and select a Latent Semantic Indexing that be suited for classification. Experimental results indicate that the method improves classification performance with more compact representation.


2014 ◽  
Vol 26 (01) ◽  
pp. 1450002 ◽  
Author(s):  
Hanguang Xiao

The early detection and intervention of artery stenosis is very important to reduce the mortality of cardiovascular disease. A novel method for predicting artery stenosis was proposed by using the input impedance of the systemic arterial tree and support vector machine (SVM). Based on the built transmission line model of a 55-segment systemic arterial tree, the input impedance of the arterial tree was calculated by using a recursive algorithm. A sample database of the input impedance was established by specifying the different positions and degrees of artery stenosis. A SVM prediction model was trained by using the sample database. 10-fold cross-validation was used to evaluate the performance of the SVM. The effects of stenosis position and degree on the accuracy of the prediction were discussed. The results showed that the mean specificity, sensitivity and overall accuracy of the SVM are 80.2%, 98.2% and 89.2%, respectively, for the 50% threshold of stenosis degree. Increasing the threshold of the stenosis degree from 10% to 90% increases the overall accuracy from 82.2% to 97.4%. Increasing the distance of the stenosis artery from the heart gradually decreases the overall accuracy from 97.1% to 58%. The deterioration of the stenosis degree to 90% increases the prediction accuracy of the SVM to more than 90% for the stenosis of peripheral artery. The simulation demonstrated theoretically the feasibility of the proposed method for predicting artery stenosis via the input impedance of the systemic arterial tree and SVM.


2021 ◽  
Vol 40 (1) ◽  
pp. 1481-1494
Author(s):  
Geng Deng ◽  
Yaoguo Xie ◽  
Xindong Wang ◽  
Qiang Fu

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.


2016 ◽  
Vol 79 (1) ◽  
Author(s):  
Suhail Khokhar ◽  
A. A. Mohd Zin ◽  
M. A. Bhayo ◽  
A. S. Mokhtar

The monitoring of power quality (PQ) disturbances in a systematic and automated way is an important issue to prevent detrimental effects on power system. The development of new methods for the automatic recognition of single and hybrid PQ disturbances is at present a major concern. This paper presents a combined approach of wavelet transform based support vector machine (WT-SVM) for the automatic classification of single and hybrid PQ disturbances. The proposed approach is applied by using synthetic models of various single and hybrid PQ signals. The suitable features of the PQ waveforms were first extracted by using discrete wavelet transform. Then SVM classifies the type of PQ disturbances based on these features. The classification performance of the proposed algorithm is also compared with wavelet based radial basis function neural network, probabilistic neural network and feed-forward neural network. The experimental results show that the recognition rate of the proposed WT-SVM based classification system is more accurate and much better than the other classifiers. 


Sign in / Sign up

Export Citation Format

Share Document