• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.249-265
• /
• 1995

본 논문에서는 확률분포가 알려져 있지 않은 두 모집단 중 어느 하나로 새로운 관측치를 분류할 때 오분류확률이 분석자에 의해 사전에 정해진 수준에 부합할 수 있도록 커널 판별함수의 임계치를 결정하였다. 정해진 오분류확률을 만족시키기 위한 판별함수의 임계치는 붓스트랩(bootstrap)기법을 판별 함수에 적용시켜 계산된다. 본 논문에서 제시도된 방법은 모집단에 대한 모수적 가정이 없으므로 어느 분포에도 적용가능하며, 모집단이 정규분포, 대수정규분포, 이산형과 연속형 변수가 혼합된 분포의 경우 모의실험을 통하여 그 성능에 대한 검증을 하였다.

• Journal for History of Mathematics
• /
• v.17 no.2
• /
• pp.15-20
• /
• 2004

We investigate the unbiasedness and consistency as the statistical properties of density estimators. We show histogram, kernel density estimation, and local adaptive smoothing as density smoothing in this paper. Also, the early and recent research on nonparametric density estimation is described and discussed.

• 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}$이 됨을 보였다. 그리고 모의실험을 통하여 소 표본에서도 삽입방법이 교차타당성 방법보다 우수함을 입증하였다.

• The Korean Journal of Applied Statistics
• /
• v.13 no.2
• /
• pp.447-455
• /
• 2000

We propose a weighted kernel pattern recognition method using the K -means clustering algorithm to reduce computation and storage required for the full kernel classifier. This technique finds a set of reference vectors and weights which are used to approximate the kernel classifier. Since the hierarchical clustering method implemented in the 'Weighted Parzen Window (WP\V) classifier is not able to rearrange the proper clusters, we adopt the K -means algorithm to find reference vectors and weights from the more properly rearranged clusters \Ve find that the proposed method outperforms the \VP\V method for the repre~entativeness of the reference vectors and the data reduction.

• The Korean Journal of Applied Statistics
• /
• v.11 no.1
• /
• pp.193-204
• /
• 1998

It is quite that we have to estimate the derivative of the regression function. The Bezier curve, rarely known to statisticians, is very popular in computer graphics area. In this paper, we use nonparametric method via the Bezier curve, and apply this method to real data set. This method seems to be very easy to compute and can be easily applied to other smoothing techniques.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.739-748
• /
• 2012

In this paper we propose a mixed effects least squares support vector machine (LS-SVM) for the censored data which are observed from different groups. We use weights by which the randomly right censoring is taken into account in the nonlinear regression. The weights are formed with Kaplan-Meier estimates of censoring distribution. In the proposed model a random effects term representing inter-group variation is included. Furthermore generalized cross validation function is proposed for the selection of the optimal values of hyper-parameters. Experimental results are then presented which indicate the performance of the proposed LS-SVM by comparing with a standard LS-SVM for the censored data.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.1
• /
• pp.55-63
• /
• 2019

In engineering problems, many random variables have correlation, and the correlation of input random variables has a great influence on reliability analysis results of the mechanical systems. However, correlated variables are often treated as independent variables or modeled by specific parametric joint distributions due to difficulty in modeling joint distributions. Especially, when there are insufficient correlated data, it becomes more difficult to correctly model the joint distribution. In this study, multivariate kernel density estimation with bounded data is proposed to estimate various types of joint distributions with highly nonlinearity. Since it combines given data with bounded data, which are generated from confidence intervals of uniform distribution parameters for given data, it is less sensitive to data quality and number of data. Thus, it yields conservative statistical modeling and reliability analysis results, and its performance is verified through statistical simulation and engineering examples.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1093-1101
• /
• 2009

Quantile regression has become a more widely used technique to describe the distribution of a response variable given a set of explanatory variables. This paper proposes a novel modelfor quantile regression using doubly penalized kernel machine with support vector machine iteratively reweighted least squares (SVM-IRWLS). To make inference about the shape of a population distribution, the widely popularregression, would be inadequate, if the distribution is not approximately Gaussian. We present a likelihood-based approach to the estimation of the regression quantiles that uses the asymmetric Laplace density.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.749-756
• /
• 2012

An approach widely used for small area estimation is based on linear mixed models. However, when the functional form of the relationship between the response and the input variables is not linear, it may lead to biased estimators of the small area parameters. In this paper we propose M-quantile kernel regression for small area mean estimation allowing nonlinearities in the relationship between the response and the input variables. Numerical studies are presented that show the sample properties of the proposed estimation method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.15-21
• /
• 2015

In support vector machine, the values of parameters included in kernels affect strongly generalization ability. It is often difficult to determine appropriate values of those parameters in advance. It has been observed through our studies that the burden for deciding the values of those parameters in support vector regression can be reduced by utilizing ensemble learning. However, the straightforward application of the method to large scale problems is too time consuming. In this paper, we propose a method in which the original data set is decomposed into a certain number of sub data set in order to reduce the burden for parameter tuning in support vector regression with large scale data sets and imbalanced data set, particularly.