• The Korean Journal of Applied Statistics
• /
• v.26 no.3
• /
• pp.389-399
• /
• 2013

This article introduces Gaussian process regression and shows its application with time-course microarray gene expression data. Gene screening for yeast cell cycle microarray expression data is accomplished with a ratio of log marginal likelihood that uses Gaussian process regression with a squared exponential covariance kernel function. Gaussian process regression fitting with each gene is done and shown with the nine top ranking genes. With the screened data the Gaussian model-based clustering is done and its silhouette values are calculated for cluster validity.

• KIPS Transactions on Computer and Communication Systems
• /
• v.13 no.1
• /
• pp.1-9
• /
• 2024

In the development and mass production of polymers, there are many uncontrollable variables. Even small changes in chemical composition, structure, and processing conditions can lead to large variations in properties. Therefore, Traditional linear modeling techniques that assume a general environment often produce significant errors when applied to field data. In this study, we propose a new modeling method (GPR-SEM) that combines Structural Equation Modeling (SEM) and Gaussian Process Regression (GPR) to study the Friction-Coefficient and Flexural-Strength properties of Polyacetal resin, an engineering plastic, in order to meet the recent trend of using plastics in industrial drive components. And we also consider the possibility of using it for materials modeling with nonlinearity.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.34 no.6
• /
• pp.315-324
• /
• 2022

The experimental data obtained in a wave flume were analyzed using machine learning techniques to establish a model that predicts the input wave height of the wavemaker based on the waves that have experienced wave shoaling and to verify the performance of the established model. For this purpose, artificial neural network (NN), the most representative machine learning technique, and Gaussian process regression (GPR), one of the non-parametric regression analysis methods, were applied respectively. Then, the predictive performance of the two models was compared. The analysis was performed independently for the case of using all the data at once and for the case by classifying the data with a criterion related to the occurrence of wave breaking. When the data were not classified, the error between the input wave height at the wavemaker and the measured value was relatively large for both the NN and GPR models. On the other hand, if the data were divided into non-breaking and breaking conditions, the accuracy of predicting the input wave height was greatly improved. Among the two models, the overall performance of the GPR model was better than that of the NN model.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1021-1028
• /
• 2005

The general solution for classification and regression problems can be found by matching and modifying matrices with the information in real world and then these matrices are teaming in neural networks. This paper treats primary space as a real world, and dual space that Primary space matches matrices using kernel. In practical study, there are two kinds of problems, complete system which can get an answer using inverse matrix and ill-posed system or singular system which cannot get an answer directly from inverse of the given matrix. Further more the problems are often given by the latter condition; therefore, it is necessary to find regularization parameter to change ill-posed or singular problems into complete system. This paper compares each performance under both classification and regression problems among GCV, L-Curve, which are well known for getting regularization parameter, and kernel methods. Both GCV and L-Curve have excellent performance to get regularization parameters, and the performances are similar although they show little bit different results from the different condition of problems. However, these methods are two-step solution because both have to calculate the regularization parameters to solve given problems, and then those problems can be applied to other solving methods. Compared with UV and L-Curve, kernel methods are one-step solution which is simultaneously teaming a regularization parameter within the teaming process of pattern weights. This paper also suggests dynamic momentum which is leaning under the limited proportional condition between learning epoch and the performance of given problems to increase performance and precision for regularization. Finally, this paper shows the results that suggested solution can get better or equivalent results compared with GCV and L-Curve through the experiments using Iris data which are used to consider standard data in classification, Gaussian data which are typical data for singular system, and Shaw data which is an one-dimension image restoration problems.