• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.469-471
• /
• 2000

본 논문에서는 모멘트 항을 추가한 수정된 kernel-adatron 알고리즘을 제안하고 이른 support vector machines의 학습기법으로 이용하였다. 이는 기울기상승법에서 일어나는 최적해로의 수렴에 따른 발진을 억제하여 그 수렴 속도를 좀더 개선시키는 모멘트의 장점과 kernel-adatron 알고리즘의 구현용이성을 그대로 살리기 위함이다. 제안된 학습기법의 SVM을 실제 200명의 암환자를 2부류(초기와 악성)로 분류하여 문제에 적용하여 시뮬레이션한 결과, Cambell등의 kernel-adatron 알고리즘을 이용한 SVM의 결과와 비교할 때 학습시간과 시험 데이터의 분류률에서 더욱 우수한 성능이 있음을 확인할 수 있었다.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.49-53
• /
• 2012

A novel method of transient stability analysis is presented in this paper. The proposed method extracts data points near the basin-of-attraction boundary and then builds a support vector machine (SVM) model learned from the generated data. The constructed SVM classifier has been shown to reduce dramatically the conservativeness of the estimated basin of attraction.

• Journal of the Korean Statistical Society
• /
• v.33 no.1
• /
• pp.25-34
• /
• 2004

In this paper we propose a prediction method on the regression model with randomly censored observations of the training data set. The least squares support vector machine regression is applied for the regression function prediction by incorporating the weights assessed upon each observation in the optimization problem. Numerical examples are given to show the performance of the proposed prediction method.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.821-830
• /
• 2006

This paper develops support vector based fuzzy linear and nonlinear regression models and applies it to forecasting the exchange rate. We use the result of Tanaka(1982, 1987) for crisp input and output. The model makes it possible to forecast the best and worst possible situation based on fewer than 50 observations. We show that the developed model is good through real data.

• IE interfaces
• /
• v.22 no.3
• /
• pp.252-262
• /
• 2009

It is crucial to prevent low yields in the semiconductor industry. Since many factors affect variation in yield and they are deeply related, preventing low yield is difficult. There have been substantial researches in the field of yield prediction. Many researchers had used the statistical methods. Many studies have shown that artificial neural network (ANN) achieved better performance than traditional statistical methods. However, despite ANN's superior performance some problems such as over-fitting and poor explanatory power arise. In order to overcome these limitations, a relatively new machine learning technique, support vector machine (SVM), is introduced to classify the yield. SVM is simple enough to be analyzed mathematically, and it leads to high performances in practical applications. This study presents a new efficient classification methodology, Stepwise-SVM (SSVM), for detecting high and low yields. SSVM is step-by-step adjustment of parameters to be precisely the classification for actual high and low yield lot. The objective of this paper is to examine the feasibility of SVM and SSVM in the yield classification. The experimental results show that SVM and SSVM provides a promising alternative to yield classification for the field data.

• The Korean Journal of Applied Statistics
• /
• v.17 no.1
• /
• pp.75-88
• /
• 2004

The Support Vector Machine(SVM) algorithm has paid attention on maximizing the shortest distance between sample points and discrimination hyperplane. This paper suggests the total margin algorithm which considers the distance between all data points and the separating hyperplane. The method extends existing support vector machine algorithm. In addition, this newly proposed method improves the generalization error bound. Numerical experiments show that the total margin algorithm provides good performance, comparing with the previous methods.

• Analytical Science and Technology
• /
• v.34 no.5
• /
• pp.231-239
• /
• 2021

Detection of fire accelerants from fire residues is critical to determine whether the case was arson or accidental fire. However, to develop a standardized model for determining the presence or absence of fire accelerants was not easy because of high temperature which cause disappearance or combustion of components of fire accelerants. In this study, logistic regression, random forest, and support vector machine models were trained and evaluated from a total of 728 GC-MS analysis data obtained from actual fire residues. Mean classification accuracies of the three models were 63 %, 81 %, and 84 %, respectively, and in particular, mean AU-PR values of the three models were evaluated as 0.68, 0.86, and 0.86, respectively, showing fine performances of random forest and support vector machine models.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.155-156
• /
• 2019

Traditional machine learning based emotion analysis methods such as Classification and Regression Tree (CART), Support Vector Machine (SVM), and k-nearest neighbor classification (kNN) are less accurate. In this paper, we propose an improved kNN classification method. Improved methods and data normalization achieve the goal of improving accuracy. Then, three classification algorithms and an improved algorithm were compared based on experimental data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.141-148
• /
• 2011

Support vector machines have been extensively studied and utilized in pattern recognition area for years. One of interesting applications of this technique is music/speech classification for a standardized codec such as 3GPP2 selectable mode vocoder. In this paper, we propose a novel approach that improves the speech/music classification of support vector machines. While conventional support vector machine optimization techniques apply during training phase, the proposed technique can be adopted in classification phase. In this regard, the proposed approach can be developed and employed in parallel with conventional optimizations, resulting in synergistic boost in classification performance. We first analyze the impact of kernel width parameter on the classifications made by support vector machines. From this analysis, we observe that we can fine-tune outputs of support vector machines with the kernel width parameter. To make the most of this capability, we identify strong correlation among neighboring input frames, and use this correlation information as a guide to adjusting kernel width parameter. According to the experimental results, the proposed algorithm is found to have potential for improving the performance of support vector machines.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.395-404
• /
• 2013

In order to classify a web page as being benign or malicious, we designed 14 basic and 16 extended features. The basic features that we implemented were selected to represent the essential characteristics of a web page. The system heuristically combines two basic features into one extended feature in order to effectively distinguish benign and malicious pages. The support vector machine can be trained to successfully classify pages by using these features. Because more and more malicious web pages are appearing, and they change so rapidly, classifiers that are trained by old data may misclassify some new pages. To overcome this problem, we selected an adaptive support vector machine (aSVM) as a classifier. The aSVM can learn training data and can quickly learn additional training data based on the support vectors it obtained during its previous learning session. Experimental results verified that the aSVM can classify malicious web pages adaptively.