• Communications for Statistical Applications and Methods
• /
• v.23 no.4
• /
• pp.355-362
• /
• 2016

Ensemble methods often help increase prediction ability in various predictive models by combining multiple weak learners and reducing the variability of the final predictive model. In this work, we demonstrate that ensemble methods also enhance the accuracy of prediction under kernel ridge regression and kernel logistic regression classification. Here we apply bagging and random forests to two kernel-based predictive models; and present the procedure of how bagging and random forests can be embedded in kernel-based predictive models. Our proposals are tested under numerous synthetic and real datasets; subsequently, they are compared with plain kernel-based predictive models and their subsampling approach. Numerical studies demonstrate that ensemble approach outperforms plain kernel-based predictive models.

• IE interfaces
• /
• v.23 no.3
• /
• pp.229-238
• /
• 2010

Virtual metrology (VM), a critical component of semiconductor manufacturing, is an efficient way of assessing the quality of wafers not actually measured. This is done based on a model between equipment sensor data (obtained for all wafers) and the quality characteristics of wafers actually measured. This paper considers principal component regression (PCR), partial least squares regression (PLSR), kernel PCR (KPCR), and kernel PLSR (KPLSR) as VM models. For each regression model, two cases are considered. One utilizes all explanatory variables in developing a model, and the other selects significant variables using the genetic algorithm (GA). The prediction performances of 8 regression models are compared for the short- and long-term etch process data. It is found among others that the GA-KPLSR model performs best for both types of data. Especially, its prediction ability is within the requirement for the short-term data implying that it can be used to implement VM for real etch processes.

• Computers and Concrete
• /
• v.24 no.1
• /
• pp.7-17
• /
• 2019

The complex phenomenon of the bond formation in geopolymer is not well understood and therefore, difficult to model. This paper present applied statistical models for evaluating the compressive strength of geopolymer. The applied statistical models studied are divided into three different categories - linear regression [least absolute shrinkage and selection operator (LASSO) and elastic net], tree regression [decision and bagging tree] and kernel methods (support vector regression (SVR), kernel ridge regression (KRR), Gaussian process regression (GPR), relevance vector machine (RVM)]. The performance of the methods is compared in terms of error indices, computational effort, convergence and residuals. Based on the present study, kernel based methods (GPR and KRR) are recommended for evaluating compressive strength of Geopolymer concrete.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.5
• /
• pp.949-954
• /
• 2009

The autoregressive process is applied in this paper to kernel regression in order to infer nonlinear models for predicting responses. We propose a kernel method for the autoregressive data which estimates the mean function by kernel machines. We also present the model selection method which employs the cross validation techniques for choosing the hyper-parameters which affect the performance of kernel regression. Artificial and real examples are provided to indicate the usefulness of the proposed method for the estimation of mean function in the presence of autocorrelation between data.

• MALSORI
• /
• no.66
• /
• pp.105-116
• /
• 2008

In this research, we propose a speaker identification system using a kernel method which is expected to model the non-linearity of speech features well. We have been using principal component analysis (PCA) successfully, and extended to kernel PCA, which is used for many pattern recognition tasks such as face recognition. However, we cannot use kernel PCA for speaker identification directly because the storage required for the kernel matrix grows quadratically, and the computational cost grows linearly (computing eigenvector of $l{\times}l$ matrix) with the number of training vectors I. Therefore, we use greedy kernel PCA which can approximate kernel PCA with small representation error. In the experiments, we compare the accuracy of the greedy kernel PCA with the baseline Gaussian mixture models using MFCCs and PCA. As the results with limited enrollment data show, the greedy kernel PCA outperforms conventional methods.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.419-425
• /
• 2010

Kernel machine learning is gaining a lot of popularities in analyzing large or high dimensional nonlinear data. We use this technique to estimate a GARCH model for predicting the conditional volatility of stock market returns. GARCH models are usually estimated using maximum likelihood (ML) procedures, assuming that the data are normally distributed. In this paper, we show that GARCH models can be estimated using kernel machine learning and that kernel machine has a higher predicting ability than ML methods and support vector machine, when estimating volatility of financial time series data with fat tail.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.835-844
• /
• 2007

This paper considers the problem of estimating the error distribution function in nonparametric regression models. Sufficient conditions are given under which the kernel estimator of the error distribution function based on nonparametric residuals satisfies the law of iterated logarithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.35-40
• /
• 2011

The complex-valued blind algorithm based on a set of randomly generated symbols and Euclidean distance can take advantage of information theoretic learning and cope with the channel phase rotation problems. On the algorithm, in this paper, the effect of kernel size has been studied and a kernel-modified version of the algorithm that rearranges the forces between the information potentials by kernel-modification has been proposed. In simulation results for 16 QAM and complex-channel models, the proposed algorithm show significantly enhanced performance of symbol-point concentration and no phase rotation problems caused by the complex channel models.

• Journal of Korean Society of Disaster and Security
• /
• v.8 no.1
• /
• pp.15-19
• /
• 2015

In rainfall-runoff models employed in hydrological applications, runoff amount is estimated through temporal delay of effective precipitation based on a linear system. Its amount is resulted from the linearized ratio by analyzing the convolution multiplier. Furthermore, in case of kernel density estimate (KDE) used in probabilistic analysis, the definition of the kernel comes from the convolution multiplier. Individual data values are smoothed through the kernel to derive KDE. In the current study, the roles of the convolution multiplier for KDE and rainfall-runoff models were revisited and their similarity and dissimilarity were investigated to discover the mathematical applicability of the convolution multiplier.

• Journal of Biosystems Engineering
• /
• v.23 no.1
• /
• pp.49-56
• /
• 1998

The objectives of this study were to develop models to predict the contents of moisture and protein of single kernel of brown rice based on visible/NIR (near-infrared) spectroscopic technique. The reflectance spectra of rice were obtained in the range of the wavelength 400 to 2,500 nm with 2 nm intervals. Multiple linear regression(MLR) and partial least squares (PLS) were used to develop the models. The MLR model using the first derivative spectra(10 nm of gap) with Standard Normal Variate and Detrending (SNV and Drt.) preprocessing showed the best results to predict moisture content of the sin린e kernel brown rice. To predict the protein content of a single kernel of brown ricer the PLS model used the raw spectra with multiplicative scatter correction(MSC) preprocessing over the wavelength of 1,100~1,500 nm.