• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.55-74
• /
• 2005

Bankruptcy prediction has drawn a lot of research interests in previous literature, and recent studies have shown that machine learning techniques achieved better performance than traditional statistical ones. This paper employs a relatively new machine learning technique, support vector machines (SVMs). to bankruptcy prediction problem in an attempt to suggest a new model with better explanatory power and stability. To serve this purpose, we use grid search technique using 5-fold cross-validation to find out the optimal values of the parameters of kernel function of SVM. In addition, to evaluate the prediction accuracy of SVM. we compare its performance with multiple discriminant analysis (MDA), logistic regression analysis (Logit), and three-layer fully connected back-propagation neural networks (BPNs). The experiment results show that SVM outperforms the other methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.428-430
• /
• 2003

인유두종바이러스(human papillomavirus: HPV)는 감염되었을 때 각종 악성 종양을 유발할 수 있는 작은 DNA 바이러스이다. 고위험군에 속하는 HPV의 감염은 암으로 진행될 수 있는 가능성이 크다. 본 논문은 HPV를 분류할 수 있는 기계 학습 기법을 제안하고자 한다. 제안된 학습 기법은 단백질 서열을 효과적으로 분류할 수 있는 커널(kernel) 방법에 기반을 두고 있다. 위험군 분류는 감염의 메커니즘의 이해와 유전자칩과 같은 새로운 의학 도구의 개발 등에 있어서 중요한 정보를 제공해 줄 수 있다. 실험 결과는 중요한 부위의 탐색에 의한 커널 기반의 학습 방법이 우수한 성능을 보이는 것으로 나타났다.

• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.973-984
• /
• 2020

This paper is devoted to study the reproducing property on 2-inner product Hilbert spaces. We focus on a new structure to produce reproducing kernel Hilbert and Banach spaces. According to multi variable computing, this structures play the key role in probability, mathematical finance and machine learning.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.679-683
• /
• 2007

Statistical learning theory by Vapnik consists of support vector machine(SVM), support vector regression(SVR), and support vector clustering(SVC) for classification, regression, and clustering respectively. In this algorithms, SVC is good clustering algorithm using support vectors based on Gaussian kernel function. But, similar to SVM and SVR, SVC needs to determine kernel parameters and regularization constant optimally. In general, the parameters have been determined by the arts of researchers and grid search which is demanded computing time heavily. In this paper, we propose a differential evolution based SVC(DESVC) which combines differential evolution into SVC for efficient selection of kernel parameters and regularization constant. To verify improved performance of our DESVC, we make experiments using the data sets from UCI machine learning repository and simulation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.109-113
• /
• 2002

In this paper, we propose a new intrusion detection algorithm based on clustering: Kernel-ART, which is composed of the on-line clustering algorithm, ART (adaptive resonance theory), combining with mercer-kernel and concept vector. Kernel-ART is not only satisfying all desirable characteristics in the context of clustering-based 105 but also alleviating drawbacks associated with the supervised learning IDS. It is able to detect various types of intrusions in real-time by means of generating clusters incrementally.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.428-434
• /
• 2011

Recently, subspace analysis has raised its performance to a higher level through the adoption of kernel-based nonlinearity. Especially, the radial basis function, based on its nonparametric nature, has shown promising results in face recognition. However, due to the endemic small sample size problem of face data, the conventional kernel-based feature extraction methods have difficulty in data representation. In this paper, we introduce a novel variant of the RBF kernel to alleviate this problem. By adopting the concept of the nearest feature line classifier, we show both effectiveness and generalizability of the proposed method, particularly regarding the small sample size issue.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.263-272
• /
• 2024

A model based on genetic algorithm optimization, GA-SVM, is proposed to warn university students of their status. This model improves the predictive effect of support vector machines. The genetic optimization algorithm is used to train the hyperparameters and adjust the kernel parameters, kernel penalty factor C, and gamma to optimize the support vector machine model, which can rapidly achieve convergence to obtain the optimal solution. The experimental model was trained on open-source datasets and validated through comparisons with random forest, backpropagation neural network, and GA-SVM models. The test results show that the genetic algorithm-optimized radial basis kernel support vector machine model GA-SVM can obtain higher accuracy rates when used for early warning in university learning.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.987-994
• /
• 2020

In this paper, we studied the effect of kernel size of CNN layer on performance in acoustic noise attenuators. This system uses a deep learning algorithm using a neural network adaptive prediction filter instead of using the existing adaptive filter. Speech is estimated from a single input speech signal containing noise using a 100-neuron, 16-filter CNN filter and an error back propagation algorithm. This is to use the quasi-periodic property in the voiced sound section of the voice signal. In this study, a simulation program using Tensorflow and Keras libraries was written and a simulation was performed to verify the performance of the noise attenuator for the kernel size. As a result of the simulation, when the kernel size is about 16, the MSE and MAE values are the smallest, and when the size is smaller or larger than 16, the MSE and MAE values increase. It can be seen that in the case of an speech signal, the features can be best captured when the kernel size is about 16.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.2
• /
• pp.237-242
• /
• 2003

In this paper, we propose a new adaptive intrusion detection algorithm based on clustering: Kernel-ART, which is composed of the on-line clustering algorithm, ART (adaptive resonance theory), combining with mercer-kernel and concept vector. Kernel-ART is not only satisfying all desirable characteristics in the context of clustering-based IDS but also alleviating drawbacks associated with the supervised learning IDS. It is able to detect various types of intrusions in real-time by means of generating clusters incrementally.