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

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.267-270
• /
• 2002

본 논문에서는 Support Vector Machines (SVM) 을 이용하여, 빠르고 정확한 두 convex한 클러스터 간의 거리 측정 방법을 제시한다 제시된 방법에서는, SVM에 의해서 생성되는 최적 다차원 평면이 두 클러스터간의 최소 거리를 계산하는데 사용된다. 또한, 본 논문에서는 이러한 두 클러스터 간의 최적의 거리를 사용하여, Fuzzy Convex Clustering (FCC) 방법 (1) 에 의해서 생성되는 Convex 클러스터들을 묶어주는 효과적인 클러스터 결합 알고리즘을 제시하였다. 그러므로, 데이터의 부적절한 표현을 유발하지 않고도 클러스터들의 개수를 좀 더 줄일 수 있었다. 제시한 방법의 타당성을 위하여 여러 실험 결과를 제시하였다

• 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 Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.369-374
• /
• 2004

A cluster merging algorithm that merges convex clusters resulted by the Fuzzy Convex Clustering(FCC) method into non-convex clusters was proposed. This was achieved by proposing a fast and reliable distance measure between two convex clusters using Support Vector Machines(SVM) to improve accuracy and speed over other existing conventional methods. In doing so, it was possible to reduce cluster number without losing its representation of the data. In this paper, results for several data sets are given to show the validity of our distance measure and algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1569-1574
• /
• 2005

In this paper, I propose an intelligent credit rating system using a bankruptcy prediction model based on support vector machines (SVMs). SVMs are promising methods because they use a risk function consisting of the empirical error and a regularized term which is derived from the structural risk minimization principle. This study examines the feasibility of applying SVM in Predicting corporate bankruptcies by comparing it with other data mining techniques. In addition. this study presents architecture and prototype of intelligeht credit rating systems based on SVM models.

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

• Convergence Security Journal
• /
• v.7 no.4
• /
• pp.23-28
• /
• 2007

In this research, we suggest the unknown intrusion detection system with SVM(Support Vector Machines). At the system, at first, collected training-packets are processed through packet image creating module. And then, it is studied by the SVM module. Finally, the studied SVM module classifies the test-data unsing test-packet-image. This system's stability and efficient characteristic of security is far superior than the existing it.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1260-1270
• /
• 2005

Support Vector Machines (SVM) is well known for a representative learner as one of the kernel methods. SVM which is based on the statistical learning theory shows good generalization performance and has been applied to various pattern recognition problems. However, SVM is basically to deal with a two-class classification problem, so we cannot solve directly a multi-class problem with a binary SVM. One-Per-Class (OPC) and All-Pairs have been applied to solve the face recognition problem, which is one of the multi-class problems, with SVM. The two methods above are ones of the output coding methods, a general approach for solving multi-class problem with multiple binary classifiers, which decomposes a complex multi-class problem into a set of binary problems and then reconstructs the outputs of binary classifiers for each binary problem. In this paper, we introduce the output coding methods as an approach for extending binary SVM to multi-class SVM and propose new output coding schemes based on the Error-Correcting Output Codes (ECOC) which is a dominant theoretical foundation of the output coding methods. From the experiment on the face recognition, we give empirical results on the properties of output coding methods including our proposed ones.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.467-474
• /
• 2006

In this paper we present a weighted support vector machine(SVM) and a weighted least squares support vector machine(LS-SVM) for the prediction in the heteroscedastic regression model. By adding weights to standard SVM and LS-SVM the better fitting ability can be achieved when errors are heteroscedastic. In the numerical studies, we illustrate the prediction performance of the proposed procedure by comparing with the procedure which combines standard SVM and LS-SVM and wild bootstrap for the prediction.

• The Journal of Industrial Distribution & Business
• /
• v.13 no.10
• /
• pp.1-8
• /
• 2022

Purpose: Support vector machines (SVMs) ensemble has been proposed to improve classification performance of Credit risk recently. However, currently used fusion strategies do not evaluate the importance degree of the output of individual component SVM classifier when combining the component predictions to the final decision. To deal with this problem, this paper designs a support vector machines (SVMs) ensemble method based on fuzzy integral, which aggregates the outputs of separate component SVMs with importance of each component SVM. Research design, data, and methodology: This paper designs a personal credit risk evaluation index system including 16 indicators and discusses a support vector machines (SVMs) ensemble method based on fuzzy integral for designing a credit risk assessment system to discriminate good creditors from bad ones. This paper randomly selects 1500 sample data of personal loan customers of a commercial bank in China 2015-2020 for simulation experiments. Results: By comparing the experimental result SVMs ensemble with the single SVM, the neural network ensemble, the proposed method outperforms the single SVM, and neural network ensemble in terms of classification accuracy. Conclusions: The results show that the method proposed in this paper has higher classification accuracy than other classification methods, which confirms the feasibility and effectiveness of this method.