• Communications for Statistical Applications and Methods
• /
• v.15 no.4
• /
• pp.543-549
• /
• 2008

Inspired by using a robust loss function in the support vector machine regression to control training error and the idea of robust template matching with M-estimator, Chen (2004) applies M-estimator techniques to gaussian radial basis functions and form a new class of robust kernels for the support vector machines. We are specially interested in the shape of the Huber's M-estimator in this context and propose a way to find the shape parameter of the Huber's M-estimating function. For simplicity, only the two-class classification problem is considered.

• Journal of Industrial Convergence
• /
• v.16 no.4
• /
• pp.33-46
• /
• 2018

Personal credit scoring is an effective tool for banks to properly guide decision profitably on granting loans. Recently, many classification algorithms and models are used in personal credit scoring. Personal credit scoring technology is usually divided into statistical method and non-statistical method. Statistical method includes linear regression, discriminate analysis, logistic regression, and decision tree, etc. Non-statistical method includes linear programming, neural network, genetic algorithm and support vector machine, etc. But for the development of the credit scoring model, there is no consistent conclusion to be drawn regarding which method is the best. In this paper, we will compare the performance of the most common scoring techniques such as logistic regression, neural network, and support vector machines using personal credit data of the financial institution in China. Specifically, we build three models respectively, classify the customers and compare analysis results. According to the results, support vector machine has better performance than logistic regression and neural networks.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.765-766
• /
• 2010

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.6
• /
• pp.1889-1893
• /
• 2008

This paper explores the classification performance of applying to support vector machines (SVMs) for the image classification problems. In this study, we extract the color, texture and shape features of natural images and compare the performance of image classification using each individual feature and integrated features. The experiment results show that classification accuracy on the basis of color feature is better than that based on texture and shape features and the results of the integrating features also provides a better and more robust performance than individual feature. In additions, we show that the proposed classifier of SVM based approach outperforms BPNN to corporate the image classification problems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.799-803
• /
• 2007

In this paper, we propose a new fuzzy membership function for FSVM(Fuzzy Support Vector Machines). We apply a fuzzy membership to each input point of SVM and reformulate SVM into fuzzy SVM (FSVM) such that different input points can make different contributions to the learning of decision surface. The proposed method enhances the SVM in reducing the effect of outliers and noises in data points. This paper compares classification and estimated performance of SVM, FSVM(1), and FSVM(2) model that are getting into the spotlight in time series prediction.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.327-330
• /
• 2000

In this paper, we describe an intelligent method to detect types of vehicles using Support Vector Machines focused to the Intelligent Transportation System (ITS) applications such as in the CCD based Electronic Toll Collection System (ETCS). This algorithm can be used the various fields of ITS applications. Support Vector Machines employed in this paper has been recently proposed as a very effective method for 3D image recognition. And our proposed feature extraction method using the singluar values that directly come from pixels at input images. Consequently, The low calculation load and the high recognition rate in spite of image rotation and various noises are one of merits of proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.4
• /
• pp.379-384
• /
• 2009

A human gaze detection and tracing method is importantly required for HMI(Human-Machine-Interface) like a Human-Serving robot. This paper proposed a novel three-dimension (3D) human gaze estimation method by using a face recognition, an orientation estimation and SVMs (Support Vector Machines). 2,400 images with the pan orientation range of $-90^{\circ}{\sim}90^{\circ}$ and tilt range of $-40^{\circ}{\sim}70^{\circ}$ with intervals unit of $10^{\circ}$ were used. A stereo camera was used to obtain the global coordinate of the center point between eyes and Gabor filter banks of horizontal and vertical orientation with 4 scales were used to extract the facial features. The experiment result shows that the error rate of proposed method is much improved than Liddell's.

• Communications for Statistical Applications and Methods
• /
• v.23 no.1
• /
• pp.71-83
• /
• 2016

In this paper we discuss a deconvolution density estimator obtained using the support vector machines (SVM) and Tikhonov's regularization method solving ill-posed problems in reproducing kernel Hilbert space (RKHS). A remarkable property of SVM is that the SVM leads to sparse solutions, but the support vector deconvolution density estimator does not preserve sparsity as well as we expected. Thus, in section 3, we propose another support vector deconvolution estimator (method II) which leads to a very sparse solution. The performance of the deconvolution density estimators based on the support vector method is compared with the classical kernel deconvolution density estimator for important cases of Gaussian and Laplacian measurement error by means of a simulation study. In the case of Gaussian error, the proposed support vector deconvolution estimator shows the same performance as the classical kernel deconvolution density estimator.

• The Korean Journal of Applied Statistics
• /
• v.16 no.2
• /
• pp.261-271
• /
• 2003

Support Vector Machines (SVMs) provide a powerful performance of the learning system. Generally, SVMs tend to make overfitting. For the purpose of overcoming this difficulty, the definition of soft margin has been introduced. In this case, it causes another difficulty to decide the weight for slack variables reflecting soft margin classifiers. Especially, the error of soft margin algorithm can be bounded by a target margin and some norms of the slack vector. In this paper, we formulate a new soft margin algorithm considering the bound of corruption by noise in data directly. Additionally, through a numerical example, we compare the proposed method with a conventional soft margin algorithm.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.263-266
• /
• 2009

Comments are short and not use spacing words or comma more than general document. We convert the 7-gram into 3-gram and select key features using topic signature. Topic signature is widely used for selecting features in document classification and summarization. We use the SVM(Support Vector Machines) as a classifier. From the result of experiments, we can see that the proposed method is outstanding over the previous methods. The proposed system can also apply to other languages.