• Title/Summary/Keyword: Support Vector Machines, SVMs

Search Result 91, Processing Time 0.029 seconds

Weighted Support Vector Machines with the SCAD Penalty

  • Jung, Kang-Mo
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.6
    • /
    • pp.481-490
    • /
    • 2013
  • Classification is an important research area as data can be easily obtained even if the number of predictors becomes huge. The support vector machine(SVM) is widely used to classify a subject into a predetermined group because it gives sound theoretical background and better performance than other methods in many applications. The SVM can be viewed as a penalized method with the hinge loss function and penalty functions. Instead of $L_2$ penalty function Fan and Li (2001) proposed the smoothly clipped absolute deviation(SCAD) satisfying good statistical properties. Despite the ability of SVMs, they have drawbacks of non-robustness when there are outliers in the data. We develop a robust SVM method using a weight function with the SCAD penalty function based on the local quadratic approximation. We compare the performance of the proposed SVM with the SVM using the $L_1$ and $L_2$ penalty functions.

Adaptive Switching Median Filter for Impulse Noise Removal Based on Support Vector Machines

  • Lee, Dae-Geun;Park, Min-Jae;Kim, Jeong-Ok;Kim, Do-Yoon;Kim, Dong-Wook;Lim, Dong-Hoon
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.6
    • /
    • pp.871-886
    • /
    • 2011
  • This paper proposes a powerful SVM-ASM filter, the adaptive switching median(ASM) filter based on support vector machines(SVMs), to effectively reduce impulse noise in corrupted images while preserving image details and features. The proposed SVM-ASM filter is composed of two stages: SVM impulse detection and ASM filtering. SVM impulse detection determines whether the pixels are corrupted by noise or not according to an optimal discrimination function. ASM filtering implements the image filtering with a variable window size to effectively remove the noisy pixels determined by the SVM impulse detection. Experimental results show that the SVM-ASM filter performs significantly better than many other existing filters for denoising impulse noise even in highly corrupted images with regard to noise suppression and detail preservation. The SVM-ASM filter is also extremely robust with respect to various test images and various percentages of image noise.

Credit Risk Evaluations of Online Retail Enterprises Using Support Vector Machines Ensemble: An Empirical Study from China

  • LI, Xin;XIA, Han
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.9 no.8
    • /
    • pp.89-97
    • /
    • 2022
  • The e-commerce market faces significant credit risks due to the complexity of the industry and information asymmetries. Therefore, credit risk has started to stymie the growth of e-commerce. However, there is no reliable system for evaluating the creditworthiness of e-commerce companies. Therefore, this paper constructs a credit risk evaluation index system that comprehensively considers the online and offline behavior of online retail enterprises, including 15 indicators that reflect online credit risk and 15 indicators that reflect offline credit risk. This paper establishes an integration method based on a fuzzy integral support vector machine, which takes the factor analysis results of the credit risk evaluation index system of online retail enterprises as the input and the credit risk evaluation results of online retail enterprises as the output. The classification results of each sub-classifier and the importance of each sub-classifier decision to the final decision have been taken into account in this method. Select the sample data of 1500 online retail loan customers from a bank to test the model. The empirical results demonstrate that the proposed method outperforms a single SVM and traditional SVMs aggregation technique via majority voting in terms of classification accuracy, which provides a basis for banks to establish a reliable evaluation system.

Comparison of support vector machines enabled WAVELET algorithm, ANN and GP in construction of steel pallet rack beam to column connections: Experimental and numerical investigation

  • Hossein Hasanvand;Tohid Pourrostam;Javad Majrouhi Sardroud;Mohammad Hasan Ramasht
    • Structural Engineering and Mechanics
    • /
    • v.87 no.1
    • /
    • pp.19-28
    • /
    • 2023
  • This paper describes the experimental investigation of steel pallet rack beam-to-column connec-tions. Total behavior of moment-rotation (M-φ) curve and the effect of particular characteristics on the behavior of connection were studied and the associated load strain relationship and corre-sponding failure modes are presented. In this respect, an estimation of SPRBCCs moment and rotation are highly recommended in early stages of design and construction. In this study, a new approach based on Support Vector Machines (SVMs) coupled with discrete wavelet transform (DWT) is designed and adapted to estimate SPRBCCs moment and rotation according to four input parameters (column thickness, depth of connector and load, beam depth,). Results of SVM-WAVELET model was compared with genetic programming (GP) and artificial neural networks (ANNs) models. Following the results, SVM-WAVELET algorithm is helpful in order to enhance the accuracy compared to GP and ANN. It was conclusively observed that application of SVM-WAVELET is especially promising as an alternative approach to estimate the SPRBCCs moment and rotation.

LS-SVM for large data sets

  • Park, Hongrak;Hwang, Hyungtae;Kim, Byungju
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.2
    • /
    • pp.549-557
    • /
    • 2016
  • In this paper we propose multiclassification method for large data sets by ensembling least squares support vector machines (LS-SVM) with principal components instead of raw input vector. We use the revised one-vs-all method for multiclassification, which is one of voting scheme based on combining several binary classifications. The revised one-vs-all method is performed by using the hat matrix of LS-SVM ensemble, which is obtained by ensembling LS-SVMs trained using each random sample from the whole large training data. The leave-one-out cross validation (CV) function is used for the optimal values of hyper-parameters which affect the performance of multiclass LS-SVM ensemble. We present the generalized cross validation function to reduce computational burden of leave-one-out CV functions. Experimental results from real data sets are then obtained to illustrate the performance of the proposed multiclass LS-SVM ensemble.

Recognition of rolling bearing fault patterns and sizes based on two-layer support vector regression machines

  • Shen, Changqing;Wang, Dong;Liu, Yongbin;Kong, Fanrang;Tse, Peter W.
    • Smart Structures and Systems
    • /
    • v.13 no.3
    • /
    • pp.453-471
    • /
    • 2014
  • The fault diagnosis of rolling element bearings has drawn considerable research attention in recent years because these fundamental elements frequently suffer failures that could result in unexpected machine breakdowns. Artificial intelligence algorithms such as artificial neural networks (ANNs) and support vector machines (SVMs) have been widely investigated to identify various faults. However, as the useful life of a bearing deteriorates, identifying early bearing faults and evaluating their sizes of development are necessary for timely maintenance actions to prevent accidents. This study proposes a new two-layer structure consisting of support vector regression machines (SVRMs) to recognize bearing fault patterns and track the fault sizes. The statistical parameters used to track the fault evolutions are first extracted to condense original vibration signals into a few compact features. The extracted features are then used to train the proposed two-layer SVRMs structure. Once these parameters of the proposed two-layer SVRMs structure are determined, the features extracted from other vibration signals can be used to predict the unknown bearing health conditions. The effectiveness of the proposed method is validated by experimental datasets collected from a test rig. The results demonstrate that the proposed method is highly accurate in differentiating between fault patterns and determining their fault severities. Further, comparisons are performed to show that the proposed method is better than some existing methods.

Dynamic Nonlinear Prediction Model of Univariate Hydrologic Time Series Using the Support Vector Machine and State-Space Model (Support Vector Machine과 상태공간모형을 이용한 단변량 수문 시계열의 동역학적 비선형 예측모형)

  • Kwon, Hyun-Han;Moon, Young-Il
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.3B
    • /
    • pp.279-289
    • /
    • 2006
  • The reconstruction of low dimension nonlinear behavior from the hydrologic time series has been an active area of research in the last decade. In this study, we present the applications of a powerful state space reconstruction methodology using the method of Support Vector Machines (SVM) to the Great Salt Lake (GSL) volume. SVMs are machine learning systems that use a hypothesis space of linear functions in a Kernel induced higher dimensional feature space. SVMs are optimized by minimizing a bound on a generalized error (risk) measure, rather than just the mean square error over a training set. The utility of this SVM regression approach is demonstrated through applications to the short term forecasts of the biweekly GSL volume. The SVM based reconstruction is used to develop time series forecasts for multiple lead times ranging from the period of two weeks to several months. The reliability of the algorithm in learning and forecasting the dynamics is tested using split sample sensitivity analyses, with a particular interest in forecasting extreme states. Unlike previously reported methodologies, SVMs are able to extract the dynamics using only a few past observed data points (Support Vectors, SV) out of the training examples. Considering statistical measures, the prediction model based on SVM demonstrated encouraging and promising results in a short-term prediction. Thus, the SVM method presented in this study suggests a competitive methodology for the forecast of hydrologic time series.

Adaptive Kernel Function of SVM for Improving Speech/Music Classification of 3GPP2 SMV

  • Lim, Chung-Soo;Chang, Joon-Hyuk
    • ETRI Journal
    • /
    • v.33 no.6
    • /
    • pp.871-879
    • /
    • 2011
  • Because a wide variety of multimedia services are provided through personal wireless communication devices, the demand for efficient bandwidth utilization becomes stronger. This demand naturally results in the introduction of the variable bitrate speech coding concept. One exemplary work is the selectable mode vocoder (SMV) that supports speech/music classification. However, because it has severe limitations in its classification performance, a couple of works to improve speech/music classification by introducing support vector machines (SVMs) have been proposed. While these approaches significantly improved classification accuracy, they did not consider correlations commonly found in speech and music frames. In this paper, we propose a novel and orthogonal approach to improve the speech/music classification of SMV codec by adaptively tuning SVMs based on interframe correlations. According to the experimental results, the proposed algorithm yields improved results in classifying speech and music within the SMV framework.

Context Dependent Fusion with Support Vector Machines (Support Vector Machine을 이용한 문맥 민감형 융합)

  • Heo, Gyeongyong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.7
    • /
    • pp.37-45
    • /
    • 2013
  • Context dependent fusion (CDF) is a fusion algorithm that combines multiple outputs from different classifiers to achieve better performance. CDF tries to divide the problem context into several homogeneous sub-contexts and to fuse data locally with respect to each sub-context. CDF showed better performance than existing methods, however, it is sensitive to noise due to the large number of parameters optimized and the innate linearity limits the application of CDF. In this paper, a variant of CDF using support vector machines (SVMs) for fusion and kernel principal component analysis (K-PCA) for context extraction is proposed to solve the problems in CDF, named CDF-SVM. Kernel PCA can shape irregular clusters including elliptical ones through the non-linear kernel transformation and SVM can draw a non-linear decision boundary. Regularization terms is also included in the objective function of CDF-SVM to mitigate the noise sensitivity in CDF. CDF-SVM showed better performance than CDF and its variants, which is demonstrated through the experiments with a landmine data set.

Fault Classification for Rotating Machinery Using Support Vector Machines with Optimal Features Corresponding to Each Fault Type (결함유형별 최적 특징과 Support Vector Machine 을 이용한 회전기계 결함 분류)

  • Kim, Yang-Seok;Lee, Do-Hwan;Kim, Seong-Kook
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.11
    • /
    • pp.1681-1689
    • /
    • 2010
  • Several studies on the use of Support Vector Machines (SVMs) for diagnosing rotating machinery have been successfully carried out, but the fault classification depends on the input features as well as a multi-classification scheme, binary optimizer, kernel function, and the parameter to be used in the kernel function. Most of the published papers on multiclass SVM applications report the use of the same features to classify the faults. In this study, simple statistical features are determined on the basis of time domain vibration signals for various fault conditions, and the optimal features for each fault condition are selected. Then, the optimal features are used in the SVM training and in the classification of each fault condition. Simulation results using experimental data show that the results of the proposed stepwise classification approach with a relatively short training time are comparable to those for a single multi-class SVM.