• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.817-821
• /
• 2001

In this paper, a new learning methodology for kernel methods that results in a sparse representation of kernel space from the training patterns for classification problems is suggested. Among the traditional algorithms of linear discriminant function, this paper shows that the relaxation procedure can obtain the maximum margin separating hyperplane of linearly separable pattern classification problem as SVM(Support Vector Machine) classifier does. The original relaxation method gives only the necessary condition of SV patterns. We suggest the sufficient condition to identify the SV patterns in the learning epoches. For sequential learning of kernel methods, extended SVM and kernel discriminant function are defined. Systematic derivation of learning algorithm is introduced. Experiment results show the new methods have the higher or equivalent performance compared to the conventional approach.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.8
• /
• pp.578-584
• /
• 2004

The CSVM(Current Support Vector Machine) that is a digital architecture performing all phases of recognition process including kernel computing, learning, and recall of SVM(Support Vector Machine) on a chip is proposed. Concurrent operation by parallel architecture of elements generates high speed and throughput. The classification problems of bio data having high dimension are solved fast and easily using the CSVM. Quadratic programming in original SVM learning algorithm is not suitable for hardware implementation, due to its complexity and large memory consumption. Hardware-friendly SVM learning algorithms, kernel adatron and kernel perceptron, are embedded on a chip. Experiments on fixed-point algorithm having quantization error are performed and their results are compared with floating-point algorithm. CSVM implemented on FPGA chip generates fast and accurate results on high dimensional cancer data.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.3
• /
• pp.216-221
• /
• 2010

In this paper, we propose speaker verification method using Support Vector Machine (SVM) kernel with Gaussian Mixture Model (GMM)-supervector based on the Mahalanobis distance. The proposed GMM-supervector SVM kernel method is combined GMM with SVM. The GMM-supervectors are generated by GMM parameters of speaker and other speaker utterances. A speaker verification threshold of GMM-supervectors is decided by SVM kernel based on Mahalanobis distance to improve speaker verification accuracy. The experimental results for text-independent speaker verification using 20 speakers demonstrates the performance of the proposed method compared to GMM, SVM, GMM-supervector SVM kernel based on Kullback-Leibler (KL) divergence, and GMM-supervector SVM kernel based on Bhattacharyya distance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.655-660
• /
• 2003

In general, Support Vector Machine has a good performance in binary classification, but it has the limitation on multi-pattern classification. So, we proposed an Import Vector Voting model for two or more labels classification. This model applied kernel bagging strategy to Import Vector Machine by Zhu. The proposed model used a voting strategy which averaged optimal kernel function from many kernel functions. In experiments, not only binary but multi-pattern classification problems, our proposed Import Vector Voting model showed good performance for given machine learning data.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.93-96
• /
• 2000

본 논문에서는 SVM의 학습성 개선을 위해 모멘트와 kernel-adatron 기법이 조합된 하이브리드 학습알고리즘을 제안하였다. 제안된 학습알고리즘은 SVM의 학습기법인 기울기상승법에서 발생하는 최적해로의 수렴에 따른 발진을 억제하여 그 수렴속도를 좀 더 개선시키는 모멘트의 장점과 비선형 특징공간에서의 동작과 구현의 용이성을 가진 kernel-adatron 알고리즘의 장점을 그대로 살리는 것이다. 제안된 알고리즘을 비선형 함수 회귀에 적용해 본 결과 학습속도에 있어서 QP와 기존의 kernel-adatron 알고리즘보다 더 우수한 성능이 있음을 확인하였다

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.1009-1019
• /
• 2001

We introduce the concepts of TL-finite state machine, TL-kernel and TL-subfinite state machines, TL-kernel and TL-subfinite state machine and obtain some results concerning them.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3076-3092
• /
• 2020

An IKPCA-ELM-based intrusion detection method is developed to address the problem of the low accuracy and slow speed of intrusion detection caused by redundancies and high dimensions of data in the network. First, in order to reduce the effects of uneven sample distribution and sample attribute differences on the extraction of KPCA features, the sample attribute mean and mean square error are introduced into the Gaussian radial basis function and polynomial kernel function respectively, and the two improved kernel functions are combined to construct a hybrid kernel function. Second, an improved particle swarm optimization (IPSO) algorithm is proposed to determine the optimal hybrid kernel function for improved kernel principal component analysis (IKPCA). Finally, IKPCA is conducted to complete feature extraction, and an extreme learning machine (ELM) is applied to classify common attack type detection. The experimental results demonstrate the effectiveness of the constructed hybrid kernel function. Compared with other intrusion detection methods, IKPCA-ELM not only ensures high accuracy rates, but also reduces the detection time and false alarm rate, especially reducing the false alarm rate of small sample attacks.

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

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2511-2520
• /
• 2018

In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

• Smart Structures and Systems
• /
• v.30 no.3
• /
• pp.303-315
• /
• 2022

The degradation of wheel tread may result in serious hazards in the railway operation system. Therefore, timely wheel defect diagnosis of in-service trains to avoid tragic events is of particular importance. The focus of this study is to develop a novel wheel defect detection approach based on the relevance vector machine (RVM) which enables online detection of potentially defective wheels with trackside monitoring data acquired under different running-speed conditions. With the dynamic strain responses collected by a trackside monitoring system, the cumulative Fourier amplitudes (CFA) characterizing the effect of individual wheels are extracted to formulate multiple probabilistic regression models (MPRMs) in terms of multi-kernel RVM, which accommodate both variables of vibration frequency and running speed. Compared with the general single-kernel RVM-based model, the proposed multi-kernel MPRM approach bears better local and global representation ability and generalization performance, which are prerequisite for reliable wheel defect detection by means of data acquired under different running-speed conditions. After formulating the MPRMs, we adopt a Bayesian null hypothesis indicator for wheel defect identification and quantification, and the proposed method is demonstrated by utilizing real-world monitoring data acquired by an FBG-based trackside monitoring system deployed on a high-speed trial railway. The results testify the validity of the proposed method for wheel defect detection under different running-speed conditions.