• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1047-1054
• /
• 2009

Local smoothing jump detection procedure is a popular method for detecting jump locations and the performance of the jump detector heavily depends on the choice of the bandwidth. However, little work has been done on this issue. In this paper, we propose the bootstrap bandwidth selection method which can be used for any kernel-based or local polynomial-based jump detector. The proposed bandwidth selection method is fully data-adaptive and its performance is evaluated through a simulation study and a real data example.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.84-94
• /
• 2011

In this paper, we propose a method to provide the distribution of option price under local volatility model when market-provided implied volatility data are given. The local volatility model is one of the most widely used smile-consistent models. In local volatility model, the volatility is a deterministic function of the random stock price. Before estimating local volatility surface (LVS), we need to estimate implied volatility surfaces (IVS) from market data. To do this we use local polynomial smoothing method. Then we apply the Dupire formula to estimate the resulting LVS. However, the result is dependent on the bandwidth of kernel function employed in local polynomial smoothing method and to solve this problem, the proposed method in this paper makes use of model averaging approach by means of bandwidth priors, and then produces a robust local volatility surface estimation with a confidence interval. After constructing LVS, we price barrier option with the LVS estimation through Monte Carlo simulation. To show the merits of our proposed method, we have conducted experiments on simulated and market data which are relevant to KOSPI200 call equity linked warrants (ELWs.) We could show by these experiments that the results of the proposed method are quite reasonable and acceptable when compared to the previous works.

• Journal of the Korean Statistical Society
• /
• v.33 no.4
• /
• pp.435-447
• /
• 2004

In additive nonparametric regression, Linton and Nielsen (1995) showed that the marginal integration when applied to the local linear smoother produces a rate-optimal estimator of each univariate component function for the case where the dimension of the predictor is two. In this paper we give new formulas for the bias and variance of the marginal integration regression estimators which are valid for boundary areas as well as fixed interior points, and show the local linear marginal integration estimator is in fact rate-optimal when the dimension of the predictor is less than or equal to four. We extend the results to the case of the local polynomial smoother, too.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.3
• /
• pp.579-585
• /
• 2012

Many different semi-supervised learning algorithms have been proposed for use wit unlabeled data. However, most of them focus on classification problems. In this paper we propose a semi-supervised regression algorithm called the semi-supervised local constant estimator (SSLCE), based on the local constant estimator (LCE), and reveal the asymptotic properties of SSLCE. We also show that the SSLCE has a faster convergence rate than that of the LCE when a well chosen weighting factor is employed. Our experiment with synthetic data shows that the SSLCE can improve performance with unlabeled data, and we recommend its use with the proper size of unlabeled data.

• Korean Journal of Agricultural Science
• /
• v.41 no.3
• /
• pp.169-175
• /
• 2014

Objective of this study was to investigate effects of pre-processing method and number of sampling leaves on stability of the reflectance measurement for Chinese cabbage and kale leaves. Chinese cabbage and kale were transplanted and cultivated in a plant factory. Leaf samples of the kale and cabbage were collected at 4 weeks after transplanting of the seedlings. Spectra data were collected with an UV/VIS/NIR spectrometer in the wavelength region from 190 to 1130 nm. All leaves (mature and young leaves) were measured on 9 and 12 points in the blade part in the upper area for kale and cabbage leaves, respectively. To reduce the spectral noise, the raw spectral data were preprocessed by different methods: i) moving average, ii) Savitzky-Golay filter, iii) local regression using weighted linear least squares and a $1^{st}$ degree polynomial model (lowess), iv) local regression using weighted linear least squares and a $2^{nd}$ degree polynomial model (loess), v) a robust version of 'lowess', vi) a robust version of 'loess', with 7, 11, 15 smoothing points. Effects of number of sampling leaves were investigated by reflectance difference (RD) and cross-correlation (CC) methods. Results indicated that the contribution of the spectral data collected at 4 sampling leaves were good for both of the crops for reflectance measurement that does not change stability of measurement much. Furthermore, moving average method with 11 smoothing points was believed to provide reliable pre-processed data for further analysis.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.574-574
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Communications for Statistical Applications and Methods
• /
• v.7 no.2
• /
• pp.575-583
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.713-727
• /
• 2005

Among different regression approaches, nonparametric procedures perform well under different conditions. In practice it is very hard to identify which is the best procedure for the data at hand, thus model combination is of practical importance. In this paper, we focus on one dimensional regression with fixed design. Polynomial regression, local regression, and smoothing spline are considered. The data are split into two parts, one part is used for estimation and the other part is used for prediction. Prediction performances are used to assign weights to different regression procedures. Simulation results show that the combined estimator performs better or similarly compared with the estimator chosen by cross validation. The combined estimator generates a similar risk to the best candidate procedure for the data.

• Journal of Medicine and Life Science
• /
• v.20 no.3
• /
• pp.107-114
• /
• 2023

Epidemiological control of coronavirus disease 2019 (COVID-19) is needed to estimate the infection period of confirmed cases and identify potential cases. The present study, targeting confirmed cases for which the time of COVID-19 symptom onset was disclosed, aimed to investigate the relationship between intervals (day) from symptom onset to testing the cycle threshold (CT) values of real-time reverse transcription-polymerase chain reaction. Of the COVID-19 confirmed cases, those for which the date of suspected symptom onset in the epidemiological investigation was specifically disclosed were included in this study. Interval was defined as the number of days from symptom onset (as disclosed by the patient) to specimen collection for testing. A locally weighted regression smoothing (LOWESS) curve was applied, with intervals as explanatory variables and CT values (CTR for RdRp gene and CTE for E gene) as outcome variables. After finding its non-linear relationship, a polynomial regression model was applied to estimate the 95% confidence interval values of CTR and CTE by interval. The application of LOWESS in 331 patients identified a U-shaped curve relationship between the CTR and CTE values according to the number of interval days, and both CTR and CTE satisfied the quadratic model for interval days. Active application of these results to epidemiological investigations would minimize the chance of failing to identify individuals who are in contact with COVID-19 confirmed cases, thereby reducing the potential transmission of the virus to local communities.