• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.663-670
• /
• 2019

Corrective thermal performance analysis is required for power plants' turbine cycles to determine the performance status of the cycle and improve the economic operation of the power plant. We developed a sectional classification method for the main feed-water flow to make precise corrections for the performance analysis based on the Performance Test Code (PTC) of the American Society of Mechanical Engineers (ASME). The method was developed for the estimation of the turbine cycle performance in a classified section. The classification is based on feature identification of the correlation status of the main feed-water flow measurements. We also developed predictive algorithms for the corrected main feed-water through a Kernel Regression (KR) model for each classified feature area. The method was compared with estimation using an Artificial Neural Network (ANN). The feature classification and predictive model provided more practical and reliable methods for the corrective thermal performance analysis of a turbine cycle.

• The Korean Journal of Applied Statistics
• /
• v.34 no.5
• /
• pp.697-710
• /
• 2021

Relative error prediction is preferred over ordinary prediction methods when relative/percentile errors are regarded as important, especially in econometrics, software engineering and government official statistics. The relative error prediction techniques have been developed in linear/nonlinear regression, nonparametric regression using kernel regression smoother, and stationary time series models. However, random effect models have not been used in relative error prediction. The purpose of this article is to extend relative error prediction to some of generalized linear mixed model (GLMM) with panel data, which is the random effect models based on gamma, lognormal, or inverse gaussian distribution. For better understanding, the real auto insurance data is used to predict the claim size, and the best predictor and the best relative error predictor are comparatively illustrated.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.6
• /
• pp.533-541
• /
• 2000

본 논문에서는 독립변수들의 차원을 감소시켜 일반회귀 신경망의 성능을 개선하는 방법을 제안하였다. 제안된 방법에서는 적응적 학습 알고리즘의 주요성분분석 기법을 이용하여 독립변수 패턴의 특징을 추출하고 이를 일반회귀 신경망의 학습데이터로 이용하였다. 이는 주요성분분석 기법이 가지는 대용량의 입력 데이터를 통계적으로 독립인 특징들의 집합으로 변환시키는 속성을 살려 학습데이터의 차원을 감소시킴으로서 고차원의 학습데이터에 따른 일반회귀 신경망이 가지는 제약을 해결하기 위함이다. 제안된 기법의 일반회귀 신경망을 3개의 독립변수 패턴을 가진 암모니아 제조공정문제와 10개의 독립변수 패턴을 가진 자동차 연비문제에 각각 적용하여 시뮬레이션한 결과, 기존의 일반회귀 신경망에 의한 결과와 비교할 때 더욱 우수한 학습성능과 회귀성능이 있음을 확인할 수 있었다. 그리고 커널함수의 평활요소 설정 면에서도 우수한 특성이 있음을 확인할 수 있었다.

• The Korean Journal of Applied Statistics
• /
• v.6 no.2
• /
• pp.227-235
• /
• 1993

Calibration relates the estimation of independent variable which rquires more effort or expense than dependent variable does. It would be provided with high accuracy because a little change of the result of independent variable cn cause a serious effect to the human being. Usual statistical analysis assumes the normality of error distribution or linearity of data. It is desirable to analyze the data without those assumptions for the accuracy of the calibration. In this paper, we calibrated the data nonparametrically without those assumptions and derived confidence interval estimate for the independent variable. As a method, we used kernel method which is popular in modern statistical branch. We derived bootstrap confidence interval estimate from the bootstrap confidence band.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.679-683
• /
• 2007

Statistical learning theory by Vapnik consists of support vector machine(SVM), support vector regression(SVR), and support vector clustering(SVC) for classification, regression, and clustering respectively. In this algorithms, SVC is good clustering algorithm using support vectors based on Gaussian kernel function. But, similar to SVM and SVR, SVC needs to determine kernel parameters and regularization constant optimally. In general, the parameters have been determined by the arts of researchers and grid search which is demanded computing time heavily. In this paper, we propose a differential evolution based SVC(DESVC) which combines differential evolution into SVC for efficient selection of kernel parameters and regularization constant. To verify improved performance of our DESVC, we make experiments using the data sets from UCI machine learning repository and simulation.

• The Journal of the Korea Contents Association
• /
• v.22 no.7
• /
• pp.55-62
• /
• 2022

The perovskite solar cell is an active part of research in renewable energy fields such as solar energy, wind, hydroelectric power, marine energy, bioenergy, and hydrogen energy to replace fossil fuels such as oil, coal, and natural gas, which will gradually disappear as power demand increases due to the increase in use of the Internet of Things and Virtual environments due to the 4th industrial revolution. The perovskite solar cell is a solar cell device using an organic-inorganic hybrid material having a perovskite structure, and has advantages of replacing existing silicon solar cells with high efficiency, low cost solutions, and low temperature processes. In order to optimize the light absorption layer thin film predicted by the existing empirical method, reliability must be verified through device characteristics evaluation. However, since it costs a lot to evaluate the characteristics of the light-absorbing layer thin film device, the number of tests is limited. In order to solve this problem, the development and applicability of a clear and valid model using machine learning or artificial intelligence model as an auxiliary means for optimizing the light absorption layer thin film are considered infinite. In this study, to estimate the light absorption layer thin-film optimization of perovskite solar cells, the regression models of the support vector machine's linear kernel, R.B.F kernel, polynomial kernel, and sigmoid kernel were compared to verify the accuracy difference for each kernel function.

• Communications for Statistical Applications and Methods
• /
• v.3 no.1
• /
• pp.39-49
• /
• 1996

비모수적 커널 회귀함수 추정법에서 평활량(bandwidth of smoothing parameter)의 선택은 아주 중요한 문제이다. 교차타당성(cross-validation) 방법에 의한 평활량은 최적평활량으로의 상대적 수렴속도(relative convergence rate)가 $n^{-1/10}$로 상당히 느리다는 것을 알고 있다. 본 연구는 삽입방법(plug-in method)에 의해 선택된 평활량의 상대적 수렴속도가 교차타당성 방법보다 더 빠른 $n^{-2/7}$이 됨을 보였다. 그리고 모의실험을 통하여 소 표본에서도 삽입방법이 교차타당성 방법보다 우수함을 입증하였다.

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

The purpose of this article is to present the application of Least Squares Support Vector Machine in analyzing the existing structure of brand. We estimate the parameters of the Market Share Attraction Model using a non-parametric technique for function estimation called Least Squares Support Vector Machine, which allows us to perform even nonlinear regression by constructing a linear regression function in a high dimensional feature space. Estimation by Least Squares Support Vector Machine technique makes it a good candidate for solving the Market Share Attraction Model. To illustrate the performance of the proposed method, we use the car sales data in South Korea's car market.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.5
• /
• pp.831-839
• /
• 2010

Least squares support vector machine (LS-SVM) is a kernel trick gaining a lot of popularities in the regression and classification problems. We use LS-SVM to propose a iterative algorithm for a nonlinear generalized autoregressive conditional heteroscedasticity model in the mean (GARCH-M) model to estimate the mean and the conditional volatility of stock market returns. The proposed method combines a weighted LS-SVM for the mean and unweighted LS-SVM for the conditional volatility. In this paper, we show that nonlinear GARCH-M models have a higher performance than the linear GARCH model and the linear GARCH-M model via real data estimations.

• Journal of Broadcast Engineering
• /
• v.27 no.6
• /
• pp.906-913
• /
• 2022

In this paper, we propose a new deep network architecture using nearest neighbor kernel for the estimation of dense depth map from its sparse map and corresponding color information. First, we propose to decompose the depth map signal into the structure and details for easier prediction. We then propose two separate subnetworks for prediction of both structure and details using classification and regression approaches, respectively. Moreover, the nearest neighboring kernel method has been newly proposed for accurate prediction of structure signal. As a result, the proposed method showed better results than other methods quantitatively and qualitatively.