• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1032-1035
• /
• 2003

The field of handwriting recognition has been researched for many years. A hybrid classifier has been proven to be able to increase the recognition rate compared with a single classifier. In this paper, we combine support vector machine (SVM) and hidden Markov model (HMM) for offline handwritten numeral recognition. To improve the performance, we extract features adapted for each classifier and propose the modified SVM decision structure. The experimental results show that the proposed method can achieve improved recognition rate for handwritten numeral recognition.

• Communications for Statistical Applications and Methods
• /
• v.16 no.5
• /
• pp.881-889
• /
• 2009

Support vector machines(SVMs) are known as flexible and efficient classifier of multivariate observations, producing a hyperplane or hyperdimensional curved surface in multidimensional feature space that best separates training samples by known groups. As various methodological extensions are made for SVM classifiers in recent years, it becomes more difficult to understand the constructed model intuitively. The aim of this paper is to visualize various SVM classifications tuned by several parameters in reduced dimensions, so that data analysts secure the tangible image of the products that the machine made.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.315-315
• /
• 2000

In this paper, we perform the time series prediction using the SVM(Support Vector Machine). We make use of two different loss functions and two different kernel functions; i) Quadratic and $\varepsilon$-insensitive loss function are used; ii) GRBF(Gaussian Radial Basis Function) and ERBF(Exponential Radial Basis Function) are used. Mackey-Glass time series are used for prediction. For both cases, we compare the results by the SVM to those by ANN(Artificial Neural Network) and show the better performance by SVM than that by ANN.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.477-478
• /
• 2007

This paper proposes a new concept of support vector machine (SVM) based voltage stability classifier using time-series phasor data. The classifier, based on a linear SVM, can provide very effective signals for identification of long-term voltage stability. In addition, the SVM output is applicable as an voltage stability indicator when an amount of corrective controls are performed just to make the system reach around at the maximum deliverable point.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.5
• /
• pp.471-476
• /
• 2009

In this paper, we apply a discriminative weight training to a support vector machine (SVM) based speech/music classification for the selectable mode vocoder (SMV) of 3GPP2. In our approach, the speech/music decision rule is expressed as the SVM discriminant function by incorporating optimally weighted features of the SMV based on a minimum classification error (MCE) method which is different from the previous work in that different weights are assigned to each the feature of SMV. The performance of the proposed approach is evaluated under various conditions and yields better results compared with the conventional scheme in the SVM.

• Journal of the Korean Society of Safety
• /
• v.32 no.1
• /
• pp.115-120
• /
• 2017

The aim of this study is to develop construction safety and health management cost prediction model using support vector machine (SVM). To this end, theoretical concept of SVM is investigated to formulate the cost prediction model. Input and output variables have been selected by analyzing the balancing accounts for the completed construction project. In order to train and validate the proposed prediction model, 150 data sets have been gathered from field. Effects of SVM parameters on prediction accuracy are analyzed and from which the optimal parameter values have been determined. The prediction performance tests are conducted to confirm the applicability of the proposed model. Based on the results, it is concluded that the proposed SVM model can effectively be used to predict the construction safety and health management cost.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.557-560
• /
• 2003

Voice is one of the promising biometrics because it is one of the most convenient ways human would distinguish someone from others. The target of speaker verification is to divide the client from imposters. Support Vector Machine(SVM) is in the limelight as a binary classifier, so it can work well in speaker verification. In this paper, we combined SVM with genetic algorithm(GA) to reduce the dimensionality of input feature. Experiments were conducted with Korean connected digit database using different feature dimensions. The verification accuracy of SVM with GA is slightly lower than that of SVM, but the proposed algorithm has greater strength in the memory limited systems.

• 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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.182-188
• /
• 2013

In this paper, we propose a complex-valued support vector machine (SVM) classifier which process the complex valued signal measured by pulse doppler radar (PDR) to identify moving targets from the background. SVM is widely applied in the field of pattern recognition, but features which used to classify are almost real valued data. Proposed complex-valued SVM can classify the moving target using real valued data, imaginary valued data, and cross-information data. To design complex-valued SVM, we consider slack variables of real and complex axis, and use the KKT (Karush-Kuhn-Tucker) conditions for complex data. Also we apply radial basis function (RBF) as a kernel function which use a distance of complex values. To evaluate the performance of the complex-valued SVM, complex valued data from PDR were classified using real-valued SVM and complex-valued SVM. The proposed complex-valued SVM classification was improved compared to real-valued SVM for dog and human, respectively 8%, 10%, have been improved.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.115-116
• /
• 2019

SVM (Support Vector Machine)은 견고성으로 인해 다양한 분류 문제에 적용 할 수 있는 효율적인 기계 학습 기술이다. 그러나 훈련 데이터의 수가 증가함에 따라 시간 복잡도가 급격히 증가하므로 대규모 데이터 세트의 경우 SVM이 비실용적이다. 본 논문에서는 SVM을 사용하여 중복 된 학습 데이터를 효율적으로 제거하는 새로운 병렬 평면(Parallel Hyperplane) 기법을 소개한다. 제안 기법에서 PH는 재귀 적으로 형성되는 반면 PH의 외부에 있는 데이터 포인트의 클러스터는 매 반복마다 제거된다. 시뮬레이션 결과 제안 기법은 기존의 클러스터링 기반 감축 기법과 SMO 기법에 비해 학습 시간을 크게 단축시키면서 데이터 축소 없이 분류의 정확성을 높일 수 있음을 확인 하였다.