• Title/Summary/Keyword: Radial Basis Kernel

Search Result 43, Processing Time 0.023 seconds

An Early Warning Model for Student Status Based on Genetic Algorithm-Optimized Radial Basis Kernel Support Vector Machine

  • Hui Li;Qixuan Huang;Chao Wang
    • 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.

Elongated Radial Basis Function for Nonlinear Representation of Face Data

  • Kim, Sang-Ki;Yu, Sun-Jin;Lee, Sang-Youn
    • 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.

A Development of Markov Chain Monte Carlo History Matching Technique for Subsurface Characterization (지하 불균질 예측 향상을 위한 마르코프 체인 몬테 카를로 히스토리 매칭 기법 개발)

  • Jeong, Jina;Park, Eungyu
    • Journal of Soil and Groundwater Environment
    • /
    • v.20 no.3
    • /
    • pp.51-64
    • /
    • 2015
  • In the present study, we develop two history matching techniques based on Markov chain Monte Carlo method where radial basis function and Gaussian distribution generated by unconditional geostatistical simulation are employed as the random walk transition kernels. The Bayesian inverse methods for aquifer characterization as the developed models can be effectively applied to the condition even when the targeted information such as hydraulic conductivity is absent and there are transient hydraulic head records due to imposed stress at observation wells. The model which uses unconditional simulation as random walk transition kernel has advantage in that spatial statistics can be directly associated with the predictions. The model using radial basis function network shares the same advantages as the model with unconditional simulation, yet the radial basis function network based the model does not require external geostatistical techniques. Also, by employing radial basis function as transition kernel, multi-scale nested structures can be rigorously addressed. In the validations of the developed models, the overall predictabilities of both models are sound by showing high correlation coefficient between the reference and the predicted. In terms of the model performance, the model with radial basis function network has higher error reduction rate and computational efficiency than with unconditional geostatistical simulation.

Prediction of Remaining Useful Life of Lithium-ion Battery based on Multi-kernel Support Vector Machine with Particle Swarm Optimization

  • Gao, Dong;Huang, Miaohua
    • Journal of Power Electronics
    • /
    • v.17 no.5
    • /
    • pp.1288-1297
    • /
    • 2017
  • The estimation of the remaining useful life (RUL) of lithium-ion (Li-ion) batteries is important for intelligent battery management system (BMS). Data mining technology is becoming increasingly mature, and the RUL estimation of Li-ion batteries based on data-driven prognostics is more accurate with the arrival of the era of big data. However, the support vector machine (SVM), which is applied to predict the RUL of Li-ion batteries, uses the traditional single-radial basis kernel function. This type of classifier has weak generalization ability, and it easily shows the problem of data migration, which results in inaccurate prediction of the RUL of Li-ion batteries. In this study, a novel multi-kernel SVM (MSVM) based on polynomial kernel and radial basis kernel function is proposed. Moreover, the particle swarm optimization algorithm is used to search the kernel parameters, penalty factor, and weight coefficient of the MSVM model. Finally, this paper utilizes the NASA battery dataset to form the observed data sequence for regression prediction. Results show that the improved algorithm not only has better prediction accuracy and stronger generalization ability but also decreases training time and computational complexity.

On the Support Vector Machine with the kernel of the q-normal distribution

  • Joguchi, Hirofumi;Tanaka, Masaru
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.983-986
    • /
    • 2002
  • Support Vector Machine (SVM) is one of the methods of pattern recognition that separate input data using hyperplane. This method has high capability of pattern recognition by using the technique, which says kernel trick, and the Radial basis function (RBF) kernel is usually used as a kernel function in kernel trick. In this paper we propose using the q-normal distribution to the kernel function, instead of conventional RBF, and compare two types of the kernel function.

  • PDF

Arrow Diagrams for Kernel Principal Component Analysis

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.3
    • /
    • pp.175-184
    • /
    • 2013
  • Kernel principal component analysis(PCA) maps observations in nonlinear feature space to a reduced dimensional plane of principal components. We do not need to specify the feature space explicitly because the procedure uses the kernel trick. In this paper, we propose a graphical scheme to represent variables in the kernel principal component analysis. In addition, we propose an index for individual variables to measure the importance in the principal component plane.

Multi-Radial Basis Function SVM Classifier: Design and Analysis

  • Wang, Zheng;Yang, Cheng;Oh, Sung-Kwun;Fu, Zunwei
    • 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.

A Decision Support Model for Sustainable Collaboration Level on Supply Chain Management using Support Vector Machines (Support Vector Machines을 이용한 공급사슬관리의 지속적 협업 수준에 대한 의사결정모델)

  • Lim, Se-Hun
    • Journal of Distribution Research
    • /
    • v.10 no.3
    • /
    • pp.1-14
    • /
    • 2005
  • It is important to control performance and a Sustainable Collaboration (SC) for the successful Supply Chain Management (SCM). This research developed a control model which analyzed SCM performances based on a Balanced Scorecard (ESC) and an SC using Support Vector Machine (SVM). 108 specialists of an SCM completed the questionnaires. We analyzed experimental data set using SVM. This research compared the forecasting accuracy of an SCMSC through four types of SVM kernels: (1) linear, (2) polynomial (3) Radial Basis Function (REF), and (4) sigmoid kernel (linear > RBF > Sigmoid > Polynomial). Then, this study compares the prediction performance of SVM linear kernel with Artificial Neural Network. (ANN). The research findings show that using SVM linear kernel to forecast an SCMSC is the most outstanding. Thus SVM linear kernel provides a promising alternative to an SC control level. A company which pursues an SCM can use the information of an SC in the SVM model.

  • PDF

A study on the Time Series Prediction Using the Support Vector Machine (보조벡터 머신을 이용한 시계열 예측에 관한 연구)

  • 강환일;정요원;송영기
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.315-315
    • /
    • 2000
  • In this paper, we perform the time series prediction using the SVM(Support Vector Machine). We make use of two different loss functions and two different kernel functions; i) Quadratic and $\varepsilon$-insensitive loss function are used; ii) GRBF(Gaussian Radial Basis Function) and ERBF(Exponential Radial Basis Function) are used. Mackey-Glass time series are used for prediction. For both cases, we compare the results by the SVM to those by ANN(Artificial Neural Network) and show the better performance by SVM than that by ANN.

Performance Analysis of Kernel Function for Support Vector Machine (Support Vector Machine에 대한 커널 함수의 성능 분석)

  • Sim, Woo-Sung;Sung, Se-Young;Cheng, Cha-Keon
    • 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.

  • PDF