Optimal covariance estimation of discrete-time locally self-similar processes in time-scale and ambiguity domains

This paper investigates the optimal estimate of the covariance function in the sense of mean-square of errors, for the class of discrete-time locally self-similar processes. The covariance function is estimated in time-scale and ambiguity domains. Since the class of estimators is completely characterized in terms of kernels, the problem is reduced to finding the optimal kernel, which is obtained in time-scale domain. Also, the optimal kernel is computed for two classes of discrete-time locally self-similar and locally self-similar chirp processes. Furthermore, it is shown that the proposed method gives more accurate estimate than the ordinary methods for non stationary processes.     

Multivariate boundary kernels and a continuous least squares principle

Whereas there are many references on univariate boundary kernels, the construction of boundary kernels for multivariate density and curve estimation has not been investigated in detail. The use of multivariate boundary kernels ensures global consistency of multivariate kernel estimates as measured by the integrated mean-squared error or sup-norm deviation for functions with compact support. We develop a class of boundary kernels which work for any support, regardless of the complexity of its boundary. Our construction yields a boundary kernel for each point in the boundary region where the function is to be estimated. These boundary kernels provide a natural continuation of non-negative kernels used in the interior onto the boundary. They are obtained as solutions of the same kernel-generating variational problem which also produces the kernel function used in the interior as its solution. We discuss the numerical implementation of the proposed boundary kernels and their relationship to locally weighted least squares. Along the way we establish a continuous least squares principle and a continuous analogue of the Gauss–Markov theorem.     

New compactly supported spatiotemporal covariance functions from SPDEs

Potential theory and Dirichlet’s priciple constitute the basic elements of the well-known classical theory of Markov processes and Dirichlet forms. This paper presents new classes of fractional spatiotemporal covariance models, based on the theory of non-local Dirichlet forms, characterizing the fundamental solution, Green kernel, of Dirichlet boundary value problems for fractional pseudodifferential operators. The elements of the associated Gaussian random field family have compactly supported non-separable spatiotemporal covariance kernels admitting a parametric representation. Indeed, such covariance kernels are not self-similar but can display local self-similarity, interpolating regular and fractal local behavior in space and time. The associated local fractional exponents are estimated from the empirical log-wavelet variogram. Numerical examples are simulated for illustrating the properties of the space–time covariance model class introduced.     

Gaussian-based kernels

We derive a class of higher-order kernels for estimation of densities and their derivatives, which can be viewed as an extension of the second-order Gaussian kernel. These kernels have some attractive properties such as smoothness, manageable convolution formulae, and Fourier transforms. One important application is the higher-order extension of exact calculations of the mean integrated squared error. The proposed kernels also have the advantage of simplifying computations of common window-width selection algorithms such as least-squares cross-validation. Efficiency calculations indicate that the Gaussian-based kernels perform almost as well as the optimal polynomial kernels when die order of the derivative being estimated is low.     

Bandwidth selection in pre-smoothed particle filters

For the purpose of maximum likelihood estimation of static parameters, we apply a kernel smoother to the particles in the standard SIR filter for non-linear state space models with additive Gaussian observation noise. This reduces the Monte Carlo error in the estimates of both the posterior density of the states and the marginal density of the observation at each time point. We correct for variance inflation in the smoother, which together with the use of Gaussian kernels, results in a Gaussian (Kalman) update when the amount of smoothing turns to infinity. We propose and study of a criterion for choosing the optimal bandwidth h in the kernel smoother. Finally, we illustrate our approach using examples from econometrics. Our filter is shown to be highly suited for dynamic models with high signal-to-noise ratio, for which the SIR filter has problems.     

Kernel density estimation on the torus

Kernel density estimation for multivariate, circular data has been formulated only when the sample space is the sphere, but theory for the torus would also be useful. For data lying on a d-dimensional torus (d?1), we discuss kernel estimation of a density, its mixed partial derivatives, and their squared functionals. We introduce a specific class of product kernels whose order is suitably defined in such a way to obtain L₂-risk formulas whose structure can be compared to their Euclidean counterparts. Our kernels are based on circular densities; however, we also discuss smaller bias estimation involving negative kernels which are functions of circular densities. Practical rules for selecting the smoothing degree, based on cross-validation, bootstrap and plug-in ideas are derived. Moreover, we provide specific results on the use of kernels based on the von Mises density. Finally, real-data examples and simulation studies illustrate the findings.     

Self-similarity index estimation via wavelets for locally self-similar processes

Many naturally occurring phenomena can be effectively modeled using self-similar processes. In such applications, accurate estimation of the scaling exponent is vital, since it is this index which characterizes the nature of the self-similarity. Although estimation of the scaling exponent has been extensively studied, previous work has generally assumed that this parameter is constant. Such an assumption may be unrealistic in settings where it is evident that the nature of the self-similarity changes as the phenomenon evolves. For such applications, the scaling exponent must be allowed to vary as a function of time, and a procedure must be available which provides a statistical characterization of this progression. In what follows, we propose and describe such a procedure. Our method uses wavelets to construct local estimates of time-varying scaling exponents for locally self-similar processes. We establish a consistency result for these estimates. We investigate the effectiveness of our procedure in a simulation study, and demonstrate its applicability in the analyses of a hydrological and a geophysical time series, each of which exhibit locally self-similar behavior.     

Computationally efficient classes of higher-order kernel functions

Classes of higher-order kernels for estimation of a probability density are constructed by iterating the twicing procedure. Given a kernel K of order l, we build a family of kernels K_m of orders l(m + 1) with the attractive property that their Fourier transforms are simply 1 — {1 —$(.)}^m+1, where ? is the Fourier transform of K. These families of higher-order kernels are well suited when the fast Fourier transform is used to speed up the calculation of the kernel estimate or the least-squares cross-validation procedure for selection of the window width. We also compare the theoretical performance of the optimal polynomial-based kernels with that of the iterative twicing kernels constructed from some popular second-order kernels.     

Clustering of gamma-ray bursts through kernel principal component analysis

We consider the problem related to clustering of gamma-ray bursts (from “BATSE” catalogue) through kernel principal component analysis in which our proposed kernel outperforms results of other competent kernels in terms of clustering accuracy and we obtain three physically interpretable groups of gamma-ray bursts. The effectivity of the suggested kernel in combination with kernel principal component analysis in revealing natural clusters in noisy and nonlinear data while reducing the dimension of the data is also explored in two simulated data sets.     

A family of kernels and their associated deconvolving kernels for normally distributed measurement errors

A family of kernels (with the sinc kernel as the simplest member) is introduced for which the associated deconvolving kernels (assuming normally distributed measurement errors) can be represented by relatively simple analytic functions. For this family, deconvolving kernel density estimation is not more sophisticated than ordinary kernel density estimation. Application examples suggest that it may be advantageous to overestimate the measurement error, because the resulting deconvolving kernels can partially compensate for the blurring inherent to the density estimation itself. A corollary of this proposition is that, even without error, it may be rational to use deconvolving rather than ordinary kernels.     

Local Adaptivity of Kernel Estimates with Plug-in Local Bandwidth Selectors

In non-parametric function estimation selection of a smoothing parameter is one of the most important issues. The performance of smoothing techniques depends highly on the choice of this parameter. Preferably the bandwidth should be determined via a data-driven procedure. In this paper we consider kernel estimators in a white noise model, and investigate whether locally adaptive plug-in bandwidths can achieve optimal global rates of convergence. We consider various classes of functions: Sobolev classes, bounded variation function classes, classes of convex functions and classes of monotone functions. We study the situations of pilot estimation with oversmoothing and without oversmoothing. Our main finding is that simple local plug-in bandwidth selectors can adapt to spatial inhomogeneity of the regression function as long as there are no local oscillations of high frequency. We establish the pointwise asymptotic distribution of the regression estimator with local plug-in bandwidth.     

A new non parametric estimator for Pdf based on inverse gamma distribution

ABSTRACT

The non parametric approach is considered to estimate probability density function (Pdf) which is supported on(0, ∞). This approach is the inverse gamma kernel. We show that it has same properties as gamma, reciprocal inverse Gaussian, and inverse Gaussian kernels such that it is free of the boundary bias, non negative, and it achieves the optimal rate of convergence for the mean integrated squared error. Also some properties of the estimator were established such as bias and variance. Comparison of the bandwidth selection methods for inverse gamma kernel estimation of Pdf is done.     

A new class of boundary kernels for distribution function estimation

In this note we introduce a new class of boundary kernels for distribution function estimation which shows itself to be especially performing when the classical kernel distribution function estimator suffers from severe boundary problems.     

Deconvolution boundary kernel method in nonparametric density estimation

This paper considers the nonparametric deconvolution problem when the true density function is left (or right) truncated. We propose to remove the boundary effect of the conventional deconvolution density estimator by using a special class of kernels: the deconvolution boundary kernels. Methods for constructing such kernels are provided. The mean squared error properties, including the rates of convergence, are investigated for supersmooth and ordinary smooth errors. Numerical simulations show that the deconvolution boundary kernel estimator successfully removes the boundary effects of the conventional deconvolution density estimator.     

Discrete associated kernels method and extensions

Discrete kernel estimation of a probability mass function (p.m.f.), often mentioned in the literature, has been far less investigated in comparison with continuous kernel estimation of a probability density function (p.d.f.). In this paper, we are concerned with a general methodology of discrete kernels for smoothing a p.m.f. f. We give a basic of mathematical tools for further investigations. First, we point out a generalizable notion of discrete associated kernel which is defined at each point of the support of f and built from any parametric discrete probability distribution. Then, some properties of the corresponding estimators are shown, in particular pointwise and global (asymptotical) properties. Other discrete kernels are constructed from usual discrete probability distributions such as Poisson, binomial and negative binomial. For small samples sizes, underdispersed discrete kernel estimators are more interesting than the empirical estimator; thus, an importance of discrete kernels is illustrated. The choice of smoothing bandwidth is classically investigated according to cross-validation and, novelly, to excess of zeros methods. Finally, a unification way of this method concerning the general probability function is discussed.     

Kernel estimation in transect sampiing withoyt the shoulder condition

We consider the estiinution of wildlife population density based on line transect data. Nonparametric kernel method is employed, without the usual assumption that the detection curve has a shoulder at distance zero, with the help of a special class of kernels called boundary kernels. Asymptotic distribution results are included. It is pointed out that the boundery kernel of Zhang and Karunamuni (1998) (see also Müller and Wang (1994)) performs better (for asmyptotic mean square error consideration) than that of the boundary kernel of M¨ller (1991). But both of these kernels are clearly superior to the half-nonnal and one-sided Epanechnikov kernel when the shoulder condition fails to hold. In practice, however, for small to moderate sample sizes, caution should be exercised in using bounrlary kernels in that the density estimate might become negative. A Monte Carlo study is also presented, comparing the performance of four kernels applied to detection data, with and without the shoulder condition, Two bundary kernels for deriatives are also included for the point transect case.     

Kernel naive Bayes discrimination for high‐dimensional pattern recognition

Kernel discriminant analysis translates the original classification problem into feature space and solves the problem with dimension and sample size interchanged. In high‐dimension low sample size (HDLSS) settings, this reduces the ‘dimension’ to that of the sample size. For HDLSS two‐class problems we modify Mika's kernel Fisher discriminant function which – in general – remains ill‐posed even in a kernel setting; see Mika et al. (1999). We propose a kernel naive Bayes discriminant function and its smoothed version, using first‐ and second‐degree polynomial kernels. For fixed sample size and increasing dimension, we present asymptotic expressions for the kernel discriminant functions, discriminant directions and for the error probability of our kernel discriminant functions. The theoretical calculations are complemented by simulations which show the convergence of the estimators to the population quantities as the dimension grows. We illustrate the performance of the new discriminant rules, which are easy to implement, on real HDLSS data. For such data, our results clearly demonstrate the superior performance of the new discriminant rules, and especially their smoothed versions, over Mika's kernel Fisher version, and typically also over the commonly used naive Bayes discriminant rule.     

Density estimation using asymmetric kernels and Bayes bandwidths with censored data

We propose a modification to the regular kernel density estimation method that use asymmetric kernels to circumvent the spill over problem for densities with positive support. First a pivoting method is introduced for placement of the data relative to the kernel function. This yields a strongly consistent density estimator that integrates to one for each fixed bandwidth in contrast to most density estimators based on asymmetric kernels proposed in the literature. Then a data-driven Bayesian local bandwidth selection method is presented and lognormal, gamma, Weibull and inverse Gaussian kernels are discussed as useful special cases. Simulation results and a real-data example illustrate the advantages of the new methodology.     

Discrete triangular associated kernel and bandwidth choices in semiparametric estimation for count data

This work deals with semiparametric kernel estimator of probability mass functions which are assumed to be modified Poisson distributions. This semiparametric approach is based on discrete associated kernel method appropriated for modelling count data; in particular, the famous discrete symmetric triangular kernels are used. Two data-driven bandwidth selection procedures are investigated and an explicit expression of optimal bandwidth not available until now is provided. Moreover, some asymptotic properties of the cross-validation criterion adapted for discrete semiparametric kernel estimation are studied. Finally, to measure the performance of semiparametric estimator according to each type of bandwidth parameter, some applications are realized on three real count data-sets from sociology and biology.     

Posterior consistency of logistic Gaussian process priors in density estimation

We establish weak and strong posterior consistency of Gaussian process priors studied by Lenk [1988. The logistic normal distribution for Bayesian, nonparametric, predictive densities. J. Amer. Statist. Assoc. 83 (402), 509–516] for density estimation. Weak consistency is related to the support of a Gaussian process in the sup-norm topology which is explicitly identified for many covariance kernels. In fact we show that this support is the space of all continuous functions when the usual covariance kernels are chosen and an appropriate prior is used on the smoothing parameters of the covariance kernel. We then show that a large class of Gaussian process priors achieve weak as well as strong posterior consistency (under some regularity conditions) at true densities that are either continuous or piecewise continuous.