Algorithm AS 176: Kernel Density Estimation Using the Fast Fourier Transform

From MaRDI portal
Publication:3942224

DOI10.2307/2347084zbMath0483.62032OpenAlexW2800501357MaRDI QIDQ3942224

Bernhard W. Silverman

Publication date: 1982

Published in: Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2347084




Related Items (48)

Multi-dimensional functional principal component analysisAccuracy of binned kernel functional approximationsA continuous Gaussian approximation to a nonparametric regression in two dimensionsA geometric approach to non-parametric density estimationContingent claims valuation when the security price is a combination of an Itō process and a random point processFirst- and Second-Order Characteristics of Spatio-Temporal Point Processes on Linear NetworksAn Efficient Algorithm for the Least-Squares Cross-Validation with Symmetric and Polynomial KernelsFFT-based fast bandwidth selector for multivariate kernel density estimationFast and accurate computation for kernel estimatorsBias reduction of maximum likelihood estimators using kernel estimatorsComputing marginal likelihoods via the Fourier integral theorem and pointwise estimation of posterior densitiesTesting multivariate normality by simulationAn Efficient Algorithm for the Least-Squares Cross-Validation with Symmetric and Polynomial KernelsAn independent component analysis algorithm through solving gradient equation combined with kernel density estimationFast Kernel Smoothing of Point Patterns on a Large Network using Two‐dimensional ConvolutionA practical guide to the probability density approximation (PDA) with improved implementation and error characterizationOn bin–based density estimationStochastic distance transform: theory, algorithms and applicationsFast computation of spatially adaptive kernel estimatesNoisy independent factor analysis model for density estimation and classificationProbabilistic-statistical programs from ``Applied StatisticsA comparison of two statistics for detecting clustering in one dimensionOn the discretisation error in the computation of the empirical characteristic functionThe accuracy and the computational complexity of a multivariate binned kernel density estima\-tor.A parallel solver for generalised additive modelsFast and simple scatterplot smoothingComputational aspects of nonparametric smoothing with illustrations from the \texttt{sm} libraryKernel estimation with cross-validation using the fast Fourier transformGraphics processing units in acceleration of bandwidth selection for kernel density estimationModelling \((s,Q)\) inventory systems: Parametric versus non-parametric approximations for the lead time demand distributionBinned goodness-of-fit tests based on the empirical characteristic functionSupervised Dimension Reduction of Intrinsically Low-Dimensional DataSimulations and computations of nonparametric density estimates for the deconvolution problemMaximum likelihood method for bandwidth selection in kernel conditional density estimateAsymptotic normality of the deconvolution kernel density estimator under the vanishing error varianceSymmetric maximum kernel likelihood estimationDensity estimation for data with rounding errorsFast and Stable Multivariate Kernel Density Estimation by Fast Sum UpdatingAS 176A note on prediction via estimation of the conditional mode functionDiffusion smoothing for spatial point patternsOn the errors involved in computing the empirical characteristic functionA consistent nonparametric test for serial independenceAn optimal local bandwidth selector for kernel density estimationRobust sparse kernel density estimation by inducing randomnessOn graphing estimated distributions using modified scatter diagramsFast nonparametric estimation for convolutions of densitiesMultivariate locally adaptive density estimation.




This page was built for publication: Algorithm AS 176: Kernel Density Estimation Using the Fast Fourier Transform