• Korean Management Science Review
• /
• v.23 no.2
• /
• pp.75-91
• /
• 2006

The purpose of this paper is to propose a new software development cost estimation method using SVR(Support Vector Regression) SVR, one of machine learning techniques, has been attracting much attention for its theoretic clearness and food performance over other machine learning techniques. This paper may be the first study in which SVR is applied to the field of software cost estimation. To derive the new method, we analyze historical cost data including both well-known overseas and domestic software projects, and define cost drivers affecting software cost. Then, the SVR model is trained using the historical data and its estimation accuracy is compared with that of the linear regression model. Experimental results show that the SVR model produces more accurate prediction than the linear regression model.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.81-117
• /
• 2010

Semi-supervised learning incorporates unlabeled examples, whose labels are unknown, as well as labeled examples into learning process. Although transductive support vector machine (TSVM), one of semi-supervised learning models, was proposed about a decade ago, its application to large-scaled data has still been limited due to its high computational complexity. Our previous research addressed this limitation by introducing a branch-and-bound algorithm for finding an optimal solution to TSVM. In this paper, we propose three new techniques to enhance the performance of the branch-and-bound algorithm. The first one tightens min-cut bound, one of two bounding strategies. Another technique exploits a graph-based approximation to a support vector machine problem to avoid the most time-consuming step. The last one tries to fix the labels of unlabeled examples whose labels can be obviously predicted based on labeled examples. Experimental results are presented which demonstrate that the proposed techniques can reduce drastically the number of subproblems and eventually computational time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.354-357
• /
• 2011

Support Vector Machine (SVM)은 주어진 데이터 중에서 각 클래스를 잘 표현하는 Support Vector (SV)를 계산함으로써 새로운 데이터를 분류하는 알고리즘이다. SVM은 전체 데이터 분포를 고려하지 않기 때문에 잘못된 데이터에 의해 분류가 잘못될 가능성이 적다. 하지만, SV가 잘못되었을 경우에는 정확도가 감소하게 되는 문제점이 있다. 본 논문에서는 SV가 잘못 주어진 데이터일 가능성을 고려, 아웃라이어 검출 알고리즘인 Local Outlier Factor (LOF) 알고리즘을 이용해 주어진 데이터 중 잘못된 데이터를 제거함으로써 SVM의 분류 정확도를 높이는 알고리즘을 제안하였다. 추가적으로, Incremental LOF를 이용해 새로운 데이터 중 판단하기 어려운 데이터를 제거함으로써 SVM의 정확도를 보다 향상시켰다. 제안된 방법은 두 개의 클래스를 가진 데이터에 대해서 실험하였다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.4 s.38
• /
• pp.71-77
• /
• 2006

Support Vector Machine (SVM) which has roots in a statistical learning theory is a training algorithm based on structural risk minimization. Generally, SVM algorithm uses the kernel for determining a linearly non-separable boundary and classifying the data. But, classical kernels can not apply to effectively the hyperspectral image classification because it measures similarity using vector's dot-product or euclidian distance. So, This paper proposes the spectral similarity kernel to solve this problem. The spectral similariy kernel that calculate both vector's euclidian and angle distance is a local kernel, it can effectively consider a reflectance property of hyperspectral image. For validating our algorithm, SVM which used polynomial kernel, RBF kernel and proposed kernel was applied to land cover classification in Hyperion image. It appears that SVM classifier using spectral similarity kernel has the most outstanding result in qualitative and spatial estimation.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.405-407
• /
• 2009

SVM(Support Vector Machine) is a classification method which is recently watched in mechanical learning system. Vapnik, Osuna, Platt etc. had suggested methodology in order to solve needed QP(Quadratic Programming) to realize SVM so that have extended application field. SVM find hyperplane which classify into 2 class by converting from input space converter vector to characteristic space vector using Kernel Function. This is very systematic and theoretical more than neural network which is experiential study method. Although SVM has superior generalization characteristic, it depends on Kernel Function. There are three category in the Kernel Function as Polynomial Kernel, RBF(Radial Basis Function) Kernel, Sigmoid Kernel. This paper has analyzed performance of SVM against kernel using virtual data.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.49-57
• /
• 2008

In this paper, we propose a novel hierarchical distributed intrusion detection system, named HNHDIDS(Home Network Hierarchical Distributed Intrusion Detection System), which is not only based on the structure of distributed intrusion detection system, but also fully consider the environment of secure home networks service. The proposed system is hierarchically composed of the one-class support vector machine(support vector data description) and local agents, in which it is designed for optimizing for the environment of secure home networks service. We support our findings with computer experiments and analysis.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.67-74
• /
• 2003

Median regression analysis has robustness properties which make it an attractive alternative to regression based on the mean. Support vector machine (SVM) is used widely in real-world regression tasks. In this paper, we propose a new SV median regression based on check function. And we illustrate how this proposed SVM performs and compare this with the SVM based on absolute deviation loss function.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.218-221
• /
• 2006

본 논문은 인터넷의 대표적인 문제점중의 하나인 Adult Image 분류 연구에 대해 기술한다. 특히 우리는 이러한 Adult Image를 분류하기 위한 Data Set을 5가지 타입으로 구성한다. 이러한 각 Image에 대해 Color, Gradient, Edge Direction 특성의 Feature들을 추출하고 이를 Histogram으로 구성한다. 이렇게 구성된 Histogram을 Support Vector Machine에 적용하여 Adult Image를 분류한다. 그 결과, 우리는 8250개의 Test Set에 대하여 Recall(96.53%), Precision(97.33%), False Positive(2.96%), F-Measure(96.93%)의 성능 결과를 보여준다.

• Communications for Statistical Applications and Methods
• /
• v.19 no.5
• /
• pp.655-662
• /
• 2012

Classification is an important research field in pattern recognition with high-dimensional predictors. The support vector machine(SVM) is a penalized feature selector and classifier. It is based on the hinge loss function, the non-convex penalty function, and the smoothly clipped absolute deviation(SCAD) suggested by Fan and Li (2001). We developed the algorithm for the multiclass SVM with the SCAD penalty function using the local quadratic approximation. For multiclass problems we compared the performance of the SVM with the $L_1$, $L_2$ penalty functions and the developed method.

• 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의 결과와 비교할 때 학습시간과 시험 데이터의 분류률에서 더욱 우수한 성능이 있음을 확인할 수 있었다.