• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1145-1156
• /
• 2013

In this paper, a kind of modified $q$-Bernstein-Schurer operators is introduced. The Korovkin type statistical approximation property of these operators is investigated. Then the rates of statistical convergence of these operators are also studied by means of modulus of continuity and the help of functions of the Lipschitz class. Furthermore, a Voronovskaja type result for these operators is given.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.673-683
• /
• 2017

The least absolute shrinkage and selection operator (LASSO) has been a popular regression estimator with simultaneous variable selection. However, LASSO does not have the oracle property and its robust version is needed in the case of heavy-tailed errors or serious outliers. We propose a robust penalized regression estimator which provide a simultaneous variable selection and estimator. It is based on the rank regression and the non-convex penalty function, the smoothly clipped absolute deviation (SCAD) function which has the oracle property. The proposed method combines the robustness of the rank regression and the oracle property of the SCAD penalty. We develop an efficient algorithm to compute the proposed estimator that includes a SCAD estimate based on the local linear approximation and the tuning parameter of the penalty function. Our estimate can be obtained by the least absolute deviation method. We used an optimal tuning parameter based on the Bayesian information criterion and the cross validation method. Numerical simulation shows that the proposed estimator is robust and effective to analyze contaminated data.

• The Korean Journal of Applied Statistics
• /
• v.30 no.1
• /
• pp.1-12
• /
• 2017

Many stochastic processes satisfy the Markov property exactly or at least approximately. An interested property in the Markov process is the first passage time. Since the sequential analysis by Wald, the approximation of the first passage time has been studied extensively. The Statistical computing technique due to the development of high-speed computers made it possible to calculate the values of the properties close to the true ones. This article introduces an exponentially weighted moving average (EWMA) control chart as an example of the Markov process, and studied how to calculate the average run length with problematic issues that should be cautioned for correct calculation. The results derived for approximation of the first passage time in this research can be applied to any of the Markov processes. Especially the approximation of the continuous time Markov process to the discrete time Markov chain is useful for the studies of the properties of the stochastic process and makes computational approaches easy.

• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.33-47
• /
• 2015

We consider an $M/E_n/1$ queueing model where customers arrive at a facility with a single server according to a Poisson process with customer service times assumed to be independent and identically distributed with Erlang distribution. We concentrate on the overshoot of the workload process in the queue. The overshoot means the excess over a threshold at the moment where the workload process exceeds the threshold. The approximation of the distribution of the overshoot was proposed by Bae et al. (2011); however, but the accuracy of the approximation was unsatisfactory. We derive an advanced approximation using the property of the Erlang distribution. Finally the newly proposed approximation is compared with the results of the previous study.

• Communications for Statistical Applications and Methods
• /
• v.15 no.3
• /
• pp.465-481
• /
• 2008

Item response theory(IRT) estimates latent ability of a subject based on the property of item and item parameters using item characteristics curve(ICC) of each item case. The initial value and another problems occurs when we try to estimate item parameters of IRT(e.g. the maximum likelihood estimate). Thus, we propose the asymptotic approximation method(AAM) to solve the above mentioned problems. We notice that the proposed method can be thought as an alternative to estimate item parameters when we have small size of data or need to estimate items with local fluctuations. We developed 'Any Assess' and tested reliability of the system result by simulating a practical use possibility.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.190-198
• /
• 2012

An adaptive correlation noise model (CNM) construction algorithm is proposed in this paper to increase the efficiency of parity bits for correcting errors of the side information in transform domain Wyner-Ziv (WZ) video coding. The proposed algorithm introduces two techniques to improve the accuracy of the CNM. First, it calculates the mean of direct current (DC) coefficients of the original WZ frame at the encoder and uses it to assist the decoder to calculate the CNM parameters. Second, by considering the statistical property of the transform domain correlation noise and the motion characteristic of the frame, the algorithm adaptively models the DC coefficients of the correlation noise with the Gaussian distribution for the low motion frames and the Laplacian distribution for the high motion frames, respectively. With these techniques, the proposed algorithm is able to make a more accurate approximation to the real distribution of the correlation noise at the expense of a very slight increment to the coding complexity. The simulation results show that the proposed algorithm can improve the average peak signal-to-noise ratio of the decoded WZ frames by 0.5 dB to 1.5 dB.