Algorithm AS 176: Kernel Density Estimation Using the Fast Fourier Transform
From MaRDI portal
Cited in
(49)- Graphics processing units in acceleration of bandwidth selection for kernel density estimation
- An Efficient Algorithm for the Least-Squares Cross-Validation with Symmetric and Polynomial Kernels
- Robust sparse kernel density estimation by inducing randomness
- A continuous Gaussian approximation to a nonparametric regression in two dimensions
- Testing multivariate normality by simulation
- The accuracy and the computational complexity of a multivariate binned kernel density estima\-tor.
- A geometric approach to non-parametric density estimation
- Fast Kernel Smoothing of Point Patterns on a Large Network using Two‐dimensional Convolution
- Testing for changes in spatial relative risk
- Accuracy of binned kernel functional approximations
- Multivariate locally adaptive density estimation.
- Fast nonparametric estimation for convolutions of densities
- Density estimation for data with rounding errors
- Computational aspects of nonparametric smoothing with illustrations from the \texttt{sm} library
- Fast and accurate computation for kernel estimators
- Fast computation of spatially adaptive kernel estimates
- Supervised dimension reduction of intrinsically low-dimensional data
- A note on prediction via estimation of the conditional mode function
- A parallel solver for generalised additive models
- Multi-dimensional functional principal component analysis
- Binned goodness-of-fit tests based on the empirical characteristic function
- A consistent nonparametric test for serial independence
- An independent component analysis algorithm through solving gradient equation combined with kernel density estimation
- AS 176
- Symmetric maximum kernel likelihood estimation
- Asymptotic normality of the deconvolution kernel density estimator under the vanishing error variance
- An optimal local bandwidth selector for kernel density estimation
- A practical guide to the probability density approximation (PDA) with improved implementation and error characterization
- Maximum likelihood method for bandwidth selection in kernel conditional density estimate
- Bias reduction of maximum likelihood estimators using kernel estimators
- An Efficient Algorithm for the Least-Squares Cross-Validation with Symmetric and Polynomial Kernels
- First- and Second-Order Characteristics of Spatio-Temporal Point Processes on Linear Networks
- Computing marginal likelihoods via the Fourier integral theorem and pointwise estimation of posterior densities
- On the discretisation error in the computation of the empirical characteristic function
- Noisy independent factor analysis model for density estimation and classification
- Probabilistic-statistical programs from ``Applied Statistics
- Stochastic distance transform: theory, algorithms and applications
- Contingent claims valuation when the security price is a combination of an Itō process and a random point process
- Kernel estimation with cross-validation using the fast Fourier transform
- Diffusion smoothing for spatial point patterns
- On the errors involved in computing the empirical characteristic function
- A comparison of two statistics for detecting clustering in one dimension
- On bin–based density estimation
- Modelling \((s,Q)\) inventory systems: Parametric versus non-parametric approximations for the lead time demand distribution
- On graphing estimated distributions using modified scatter diagrams
- Simulations and computations of nonparametric density estimates for the deconvolution problem
- Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
- FFT-based fast bandwidth selector for multivariate kernel density estimation
- Fast and simple scatterplot smoothing
This page was built for publication: Algorithm AS 176: Kernel Density Estimation Using the Fast Fourier Transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942224)
