我国农村居民消费与收入动态关系的非参数回归分析

本文认为我国农村居民消费行为在不同时期存在显著的差异,而传统的计量经济模型是无法解释的。于是尝试将非参数估计理论引入到回归模型中来,通过建立非参数回归模型及普通的线性回归模型对我国农村居民可支配收入及消费支出之间的关系进行比较研究。并且分析了反映可支配收入与消费支出关系的时间变边际消费倾向及弹性系数。     

MulticlusterKDE: a new algorithm for clustering based on multivariate kernel density estimation

In this paper, we propose the MulticlusterKDE algorithm applied to classify elements of a database into categories based on their similarity. MulticlusterKDE is centered on the multiple optimization of the kernel density estimator function with multivariate Gaussian kernel. One of the main features of the proposed algorithm is that the number of clusters is an optional input parameter. Furthermore, it is very simple, easy to implement, well defined and stops at a finite number of steps and it always converges regardless of the data set. We illustrate our findings by implementing the algorithm in R software. The results indicate that the MulticlusterKDE algorithm is competitive when compared to K-means, K-medoids, CLARA, DBSCAN and PdfCluster algorithms. Features such as simplicity and efficiency make the proposed algorithm an attractive and promising research field that can be used as basis for its improvement and also for the development of new density-based clustering algorithms.     

Statistical inference under imputation for proportional hazard model with missing covariates

Missing covariate data are common in biomedical studies. In this article, by using the non parametric kernel regression technique, a new imputation approach is developed for the Cox-proportional hazard regression model with missing covariates. This method achieves the same efficiency as the fully augmented weighted estimators (Qi et al. 2005. Journal of the American Statistical Association, 100:1250) and has a simpler form. The asymptotic properties of the proposed estimator are derived and analyzed. The comparisons between the proposed imputation method and several other existing methods are conducted via a number of simulation studies and a mouse leukemia data.     

Data‐driven choice of the smoothing parametrization for kernel density estimators

There are several levels of sophistication when specifying the bandwidth matrix H to be used in a multivariate kernel density estimator, including H to be a positive multiple of the identity matrix, a diagonal matrix with positive elements or, in its most general form, a symmetric positive‐definite matrix. In this paper, the author proposes a data‐based method for choosing the smoothing parametrization to be used in the kernel density estimator. The procedure is fully illustrated by a simulation study and some real data examples. The Canadian Journal of Statistics © 2009 Statistical Society of Canada     

Automatic and asymptotically optimal data sharpening for nonparametric regression

In this article we consider data-sharpening methods for nonparametric regression. In particular modifications are made to existing methods in the following two directions. First, we introduce a new tuning parameter to control the extent to which the data are to be sharpened, so that the amount of sharpening is adaptive and can be tuned to best suit the data at hand. We call this new parameter the sharpening parameter. Second, we develop automatic methods for jointly choosing the value of this sharpening parameter as well as the values of other required smoothing parameters. These automatic parameter selection methods are shown to be asymptotically optimal in a well defined sense. Numerical experiments were also conducted to evaluate their finite-sample performances. To the best of our knowledge, there is no bandwidth selection method developed in the literature for sharpened nonparametric regression.     

Optimal global rates of convergence for nonparametric regression with unbounded data

Estimation of regression functions from independent and identically distributed data is considered. The _L2$L_2$ error with integration with respect to the design measure is used as an error criterion. Usually in the analysis of the rate of convergence of estimates a boundedness assumption on the explanatory variable X$X$ is made besides smoothness assumptions on the regression function and moment conditions on the response variable Y$Y$. In this article we consider the kernel estimate and show that by replacing the boundedness assumption on X$X$ by a proper moment condition the same (optimal) rate of convergence can be shown as for bounded data. This answers Question 1 in Stone [1982. Optimal global rates of convergence for nonparametric regression. Ann. Statist., 10, 1040–1053].     

Adaptively varying-coefficient spatiotemporal models

Summary.  We propose an adaptive varying-coefficient spatiotemporal model for data that are observed irregularly over space and regularly in time. The model is capable of catching possible non-linearity (both in space and in time) and non-stationarity (in space) by allowing the auto-regressive coefficients to vary with both spatial location and an unknown index variable. We suggest a two-step procedure to estimate both the coefficient functions and the index variable, which is readily implemented and can be computed even for large spatiotemporal data sets. Our theoretical results indicate that, in the presence of the so-called nugget effect, the errors in the estimation may be reduced via the spatial smoothing—the second step in the estimation procedure proposed. The simulation results reinforce this finding. As an illustration, we apply the methodology to a data set of sea level pressure in the North Sea.     

Representative points for location-biased datasets

Representative points (RPs) are a set of points that optimally represents a distribution in terms of mean square error. When the prior data is location biased, the direct methods such as the k-means algorithm may be inefficient to obtain the RPs. In this article, a new indirect algorithm is proposed to search the RPs based on location-biased datasets. Such an algorithm does not constrain the parameter model of the true distribution. The empirical study shows that such algorithm can obtain better RPs than the k-means algorithm.     

Statistical inference in the partial linear models with the inverse gaussian kernel

Symmetric kernel smoothing is commonly used in estimating the nonparametric component in the partial linear regression models. In this article, we propose a new estimation method for the partial linear regression models using the inverse Gaussian kernel when the explanatory variable of the nonparametric component is non-negatively supported. As an asymmetric kernel function, the inverse Gaussian kernel is also supported on the non-negative half line. The asymptotic properties, including the asymptotic normality, uniform almost sure convergence, and the iterated logarithm laws, of the proposed estimators are thoroughly discussed for both homoscedastic and heteroscedastic cases. The simulation study is conducted to evaluate the finite sample performance of the proposed estimators.