Kernel Density Estimation with Generalized Binning

We propose kernel density estimators based on prebinned data. We use generalized binning schemes based on the quantiles points of a certain auxiliary distribution function. Therein the uniform distribution corresponds to usual binning. The statistical accuracy of the resulting kernel estimators is studied, i.e. we derive mean squared error results for the closeness of these estimators to both the true function and the kernel estimator based on the original data set. Our results show the influence of the choice of the auxiliary density on the binned kernel estimators and they reveal that non-uniform binning can be worthwhile.     

Kernel Density Estimation on a Linear Network

This paper develops a statistically principled approach to kernel density estimation on a network of lines, such as a road network. Existing heuristic techniques are reviewed, and their weaknesses are identified. The correct analogue of the Gaussian kernel is the ‘heat kernel’, the occupation density of Brownian motion on the network. The corresponding kernel estimator satisfies the classical time‐dependent heat equation on the network. This ‘diffusion estimator’ has good statistical properties that follow from the heat equation. It is mathematically similar to an existing heuristic technique, in that both can be expressed as sums over paths in the network. However, the diffusion estimate is an infinite sum, which cannot be evaluated using existing algorithms. Instead, the diffusion estimate can be computed rapidly by numerically solving the time‐dependent heat equation on the network. This also enables bandwidth selection using cross‐validation. The diffusion estimate with automatically selected bandwidth is demonstrated on road accident data.     

Robust Likelihood Cross-Validation for Kernel Density Estimation

Likelihood cross-validation for kernel density estimation is known to be sensitive to extreme observations and heavy-tailed distributions. We propose a robust likelihood-based cross-validation method to select bandwidths in multivariate density estimations. We derive this bandwidth selector within the framework of robust maximum likelihood estimation. This method establishes a smooth transition from likelihood cross-validation for nonextreme observations to least squares cross-validation for extreme observations, thereby combining the efficiency of likelihood cross-validation and the robustness of least-squares cross-validation. We also suggest a simple rule to select the transition threshold. We demonstrate the finite sample performance and practical usefulness of the proposed method via Monte Carlo simulations and a real data application on Chinese air pollution.     

Cross-validation Bandwidth Matrices for Multivariate Kernel Density Estimation

Abstract.  The performance of multivariate kernel density estimates depends crucially on the choice of bandwidth matrix, but progress towards developing good bandwidth matrix selectors has been relatively slow. In particular, previous studies of cross-validation (CV) methods have been restricted to biased and unbiased CV selection of diagonal bandwidth matrices. However, for certain types of target density the use of full (i.e. unconstrained) bandwidth matrices offers the potential for significantly improved density estimation. In this paper, we generalize earlier work from diagonal to full bandwidth matrices, and develop a smooth cross-validation (SCV) methodology for multivariate data. We consider optimization of the SCV technique with respect to a pilot bandwidth matrix. All the CV methods are studied using asymptotic analysis, simulation experiments and real data analysis. The results suggest that SCV for full bandwidth matrices is the most reliable of the CV methods. We also observe that experience from the univariate setting can sometimes be a misleading guide for understanding bandwidth selection in the multivariate case.     

基于核密度估计的非线性时间序列聚类

本文研究的是时间序列的聚类问题。由于现实世界中时间序列多数是非线性的,而现有的时间序列聚类问题大都是基于线性时间序列模型进行聚类的,本文提出了可以用于非线性时间序列的聚类方法。以时间序列的二维核密度估计之间的相似性作为非线性时间序列的距离度量,该距离度量方式是一种非参数的距离度量方法,考虑到了时间序列自相关结构的差异,能够粗糙地识别时间序列形状和动态相关结构的相似性。与理论研究结果相一致,我们的模拟实验结果也验证了这种距离度量的有效性。     

Bootstrap MISE Estimators to Obtain Bandwidth for Kernel Density Estimation

Research in the area of bandwidth selection was an active topic in the 1980s and 1990s, however, recently there has been little research in the area. We re-opened this investigation and have found a new method for estimating mean integrated squared error for kernel density estimators. We provide an overview of other methods to obtain optimal bandwidths and offer a comparison of these methods via a simulation study. In certain situations, our method of estimating an optimal bandwidth yields a smaller MISE than competing methods to compute bandwidths. This procedure is illustrated by an application to two data sets.     

Kernel Smoothing Density Estimation when Group Membership is Subject to Missing

Density function is a fundamental concept in data analysis. Non-parametric methods including kernel smoothing estimate are available if the data is completely observed. However, in studies such as diagnostic studies following a two-stage design the membership of some of the subjects may be missing. Simply ignoring those subjects with unknown membership is valid only in the MCAR situation. In this paper, we consider kernel smoothing estimate of the density functions, using the inverse probability approaches to address the missing values. We illustrate the approaches with simulation studies and real study data in mental health.     

基于核密度估计对VaR值计算方法的改进

文章从VaR方法的定义出发,首先对VaR值的两种基本计算方法进行阐述,进而基于核密度估计,提出一种改进的VaR值计算方法.该改进方法将蒙特卡罗模拟法引入到核密度估计规则,并且考虑四分位距来构造核密度估计的窗宽,对股市收益率的变异性以及高峰厚尾现象进行了更好地刻画.实证验证了改进的VaR值计算方法的有效性及优越性.     

Kernel Estimation of the Spectral Density of Stationary Random Closed Sets

A non‐parametric kernel estimator of the spectral density of stationary random closed sets is studied. Conditions are derived under which this estimator is asymptotically unbiased and mean‐square consistent. For the planar Boolean model with isotropic compact and convex grains, an averaged version of the kernel estimator is compared with the theoretical spectral density.     

Optimal False Discovery Rate Control with Kernel Density Estimation in a Microarray Experiment

Most of current false discovery rate (FDR) procedures in a microarray experiment assume restrictive dependence structures, resulting in being less reliable. FDR controlling procedure under suitable dependence structures based on Poisson distributional approximation is shown. Unlike other procedures, the distribution of false null hypotheses is estimated by using kernel density estimation allowing for dependent structures among the genes. Furthermore, we develop an FDR framework that minimizes the false nondiscovery rate (FNR) with a constraint on the controlled level of the FDR. The performance of the proposed FDR procedure is compared with that of other existing FDR controlling procedures, with an application to the microarray study of simulated data.     

Kernel Method Starting with Half-Normal Detection Function for Line Transect Density Estimation

In this article, we introduce the nonparametric kernel method starting with half-normal detection function using line transect sampling. The new method improves bias from O(h ²), as the smoothing parameter h → 0, to O(h ³) and in some cases to O(h ⁴). Properties of the proposed estimator are derived and an expression for the asymptotic mean square error (AMSE) of the estimator is given. Minimization of the AMSE leads to an explicit formula for an optimal choice of the smoothing parameter. Small-sample properties of the estimator are investigated and compared with the traditional kernel estimator by using simulation technique. A numerical results show that improvements over the traditional kernel estimator often can be realized even when the true detection function is far from the half-normal detection function.     

Jackknifing in Categorical Data Analysis

Estimation of nonlinear functions of a multinomial parameter vector is necessary in many categorical data problems. The first and second order jackknife are explored for the purpose of reduction of bias. The second order jackknife of a function g(.) of a multinomial parameter is shown to be asymptotically normal if all second order partials ?²g( p )?dp_i?p_j obey a Hölder condition with exponent α>1/2. Numerical results for the estimation of the log odds ratio in a 2times2 table demonstrate the efficiency of the jackknife method for reduction of mean-square-error and the construction of approximate confidence intervals.     

Boundary and Bias Correction in Kernel Hazard Estimation

A new class of local linear hazard estimators based on weighted least square kernel estimation is considered. The class includes the kernel hazard estimator of Ramlau-Hansen (1983), which has the same boundary correction property as the local linear regression estimator (see Fan & Gijbels, 1996). It is shown that all the local linear estimators in the class have the same pointwise asymptotic properties. We derive the multiplicative bias correction of the local linear estimator. In addition we propose a new bias correction technique based on bootstrap estimation of additive bias. This latter method has excellent theoretical properties. Based on an extensive simulation study where we compare the performance of competing estimators, we also recommend the use of the additive bias correction in applied work.     

中国城镇化的地域非均衡及其动态演进——来自基尼系数及核密度估计的经验证据

基于中国1995-2013年省域数据,采用基尼系数及其分解、核密度估计方法,从人口和土地城镇化入手,系统分析了中国城镇化的地域非均衡及其动态演化规律。结果发现,1.中国人口和土地城镇化分布均呈现出由东往西逐渐降低的规律,城镇化非均衡主要体现在土地城镇化,而人口城镇化则未出现明显分异。2.全国尺度人口城镇化基尼系数随时间不断下降,城镇化非均衡逐渐减小;土地城镇化基尼系数则呈倒"U"型,城镇化非均衡先增后减。3.东中西三大区域内人口城镇化基尼系数均呈直线下降,区域间非均衡东部最大,西部次之,中部最小;土地城镇化非均衡则是东部大于中部和西部,但近年来西部已超过东部。4.人口城镇化非均衡在1995-2001年间主要来自地区间重叠,而后2002-2013年主要由地区间差异驱动;土地城镇化非均衡则主要来源于地区间差异。5.核密度估计显示人口城镇化增速较快,波动较小,而土地城镇化则极化趋势明显,波动较大。新型城镇化的协调推进宜从人口和土地城镇化两方面着手,特别要注意土地城镇化的失衡发展问题。     

Inversion Theorem Based Kernel Density Estimation for the Ordinary Least Squares Estimator of a Regression Coefficient

The traditional confidence interval associated with the ordinary least squares estimator of linear regression coefficient is sensitive to non-normality of the underlying distribution. In this article, we develop a novel kernel density estimator for the ordinary least squares estimator via utilizing well-defined inversion based kernel smoothing techniques in order to estimate the conditional probability density distribution of the dependent random variable. Simulation results show that given a small sample size, our method significantly increases the power as compared with Wald-type CIs. The proposed approach is illustrated via an application to a classic small data set originally from Graybill (1961 Graybill, F.A. (1961). Introduction to Linear Statistical Models. Vol. 1. New York: McGraw-Hill Book Company. [Google Scholar]).     

Multiplicative Bias Correction in Kernel Hazard Estimation

A multiplicative bias reducing technique is introduced for kernel hazard estimation. Similar methods were introduced by Linton & Nielsen (1994) in non-parametric regression and Jones et al . (1995) in non-parametric density estimation. A simulation study indicates good performance of the method. An application is provided on the development of Danish mortality.     

Generalized Kernel Estimators for the Weibull-Tail Coefficient

We introduce new families of estimators for the Weibull-tail coefficient, obtained from a weighted sum of a power transformation of excesses over a high random threshold. Asymptotic normality of the estimators is proven for an intermediate sequence of upper order statistics, and under classical regularity conditions for L-statistics and a second-order condition on the tail behavior of the underlying distribution. The small sample performance of two specific examples of kernel functions is evaluated in a simulation study.     

Kernel Density Estimator From Ranked Set Samples

We study kernel density estimator from the ranked set samples (RSS). In the kernel density estimator, the selection of the bandwidth gives strong influence on the resulting estimate. In this article, we consider several different choices of the bandwidth and compare their asymptotic mean integrated square errors (MISE). We also propose a plug-in estimator of the bandwidth to minimize the asymptotic MISE. We numerically compare the MISE of the proposed kernel estimator (having the plug-in bandwidth estimator) to its simple random sampling counterpart. We further propose two estimators for a symmetric distribution, and show that they outperform in MISE all other estimators not considering symmetry. We finally apply the methods in this article to analyzing the tree height data from Platt et al. (1988 Platt, W.J., Evans, G.M., Rathbun, S.L. (1988). The population dynamics of long-lived conifer (Pinus plaustris) (1988). Amer. Natrualist 131:491–525.[Crossref], [Web of Science ®] , [Google Scholar]) and Chen et al. (2003 Chen, Z., Bai, Z., Sinha, B.K. (2003). Ranked Set Sampling: Theory and Applications. New York: Springer. [Google Scholar]).     

Gamma Kernel Intensity Estimation in Temporal Point Processes

In this article, we propose a nonparametric approach for estimating the intensity function of temporal point processes based on kernel estimators. In particular, we use asymmetric kernel estimators characterized by the gamma distribution, in order to describe features of observed point patterns adequately. Some characteristics of these estimators are analyzed and discussed both through simulated results and applications to real data from different seismic catalogs.     

Goodness-of-fit Tests Based on the Kernel Density Estimator

Abstract.  Given an i.i.d. sample drawn from a density f on the real line, the problem of testing whether f is in a given class of densities is considered. Testing procedures constructed on the basis of minimizing the L ₁-distance between a kernel density estimate and any density in the hypothesized class are investigated. General non-asymptotic bounds are derived for the power of the test. It is shown that the concentration of the data-dependent smoothing factor and the 'size' of the hypothesized class of densities play a key role in the performance of the test. Consistency and non-asymptotic performance bounds are established in several special cases, including testing simple hypotheses, translation/scale classes and symmetry. Simulations are also carried out to compare the behaviour of the method with the Kolmogorov-Smirnov test and an L ₂ density-based approach due to Fan [ Econ. Theory 10 (1994) 316].