Selection of bandwidth for kernel regression

ABSTRACT

The most important factor in kernel regression is a choice of a bandwidth. Considerable attention has been paid to extension the idea of an iterative method known for a kernel density estimate to kernel regression. Data-driven selectors of the bandwidth for kernel regression are considered. The proposed method is based on an optimally balanced relation between the integrated variance and the integrated square bias. This approach leads to an iterative quadratically convergent process. The analysis of statistical properties shows the rationale of the proposed method. In order to see statistical properties of this method the consistency is determined. The utility of the method is illustrated through a simulation study and real data applications.     

Exponential Inequalities in Stochastic Inverse Problems Using an Iterative Method

We consider an iterative method in order to solve linear inverse problems. We establish exponential inequalities for the probability of the distance between the approximated solution and the exact one for a calibration problem. The approximate is given by an iterative method with Gaussian errors. We treat an operator equation of the form Ax = u, where A is a compact operator.     

Semiparametric inference on partially linear single-index model

ABSTRACT

We consider semiparametric inference on the partially linearsingle-index model (PLSIM). The generalized likelihood ratio (GLR) test is proposed to examine whether or not a family of new semiparametric models fits adequately our given data in the PLSIM. A new GLR statistic is established to deal with the testing of the index parameter α₀ in the PLSIM. The newly proposed statistic is shown to asymptotically follow a χ²-distribution with the scale constant and the degrees of freedom being independent of the nuisance parameters or function. Some finite sample simulations and a real example are used to illustrate our proposed methodology.     

Two new estimators of entropy for testing normality

ABSTRACT

We present two new estimators for estimating the entropy of absolutely continuous random variables. Some properties of them are considered, specifically consistency of the first is proved. The introduced estimators are compared with the existing entropy estimators. Also, we propose two new tests for normality based on the introduced entropy estimators and compare their powers with the powers of other tests for normality. The results show that the proposed estimators and test statistics perform very well in estimating entropy and testing normality. A real example is presented and analyzed.     

Semiparametric estimator for a secondary analysis with correlated outcomes

ABSTRACT

Researchers are often required to reuse data that have been collected and analyzed for other purposes. Issues may arise if the outcome of this secondary study is related to the outcome of the first study and traditional methods may fail to deliver a consistent estimate. Here we propose a semiparametric approach that takes this correlation into account and produces asymptotically consistent and normally distributed estimates. We discuss its performance through simulations and apply the proposed method to a real dataset.     

An asymptotic confidence interval for the process capability index Cpm

Abstract

The use of indices as an estimation tool of process capability is long-established among the statistical quality professionals. Numerous capability indices have been proposed in last few years. C_pm constitutes one of the most widely used capability indices and its estimation has attracted much interest. In this paper, we propose a new method for constructing an approximate confidence interval for the index C_pm. The proposed method is based on the asymptotic distribution of the index C_pm obtained by the Delta Method. Under some regularity conditions, the distribution of an estimator of the process capability index C_pm is asymptotically normal.     

A two-stage procedure for selecting the best of k exponential distributions

The problem of selecting the best of k exponential distributions with different guarantee times and the same unknown variance is considered. A two-stage procedure, similar to the one considered by Bechhofer, Dunnett and Sobel (1954), is given. Some specific guidelines for selecting the first-stage sample size are also given.     

A Combined Nonlinear Programming Model and Kibria Method for Choosing Ridge Parameter Regression

Ridge regression solves multicollinearity problems by introducing a biasing parameter that is called ridge parameter; it shrinks the estimates as well as their standard errors in order to reach acceptable results. Many methods are available for estimating a ridge parameter. This article has considered some of these methods and also proposed a combined nonlinear programming model and Kibria method. A simulation study has been made to evaluate the performance of the proposed estimators based on the minimum mean squared error criterion. The simulation study indicates that under certain conditions the proposed estimators outperform the least squares (LS) estimators and other popular existing estimators. Moreover, the new proposed model is applied on dataset that suffers also from the presence of heteroscedastic errors.     

A multiple-case deletion approach for detecting influential points in high-dimensional regression

ABSTRACT

In high-dimensional regression, the presence of influential observations may lead to inaccurate analysis results so that it is a prime and important issue to detect these unusual points before statistical regression analysis. Most of the traditional approaches are, however, based on single-case diagnostics, and they may fail due to the presence of multiple influential observations that suffer from masking effects. In this paper, an adaptive multiple-case deletion approach is proposed for detecting multiple influential observations in the presence of masking effects in high-dimensional regression. The procedure contains two stages. Firstly, we propose a multiple-case deletion technique, and obtain an approximate clean subset of the data that is presumably free of influential observations. To enhance efficiency, in the second stage, we refine the detection rule. Monte Carlo simulation studies and a real-life data analysis investigate the effective performance of the proposed procedure.