Abstract
The computational cost of multivariate kernel density estimation can be reduced by prebinning the data. The data are discretized to a grid and a weighted kernel estimator is computed. We report results on the accuracy of such a binned kernel estimator and discuss the computational complexity of the estimator as measured by its average number of nonzero terms. © 2000 Academic Press.
Author supplied keywords
Cite
CITATION STYLE
APA
Holmström, L. (2000). The Accuracy and the Computational Complexity of a Multivariate Binned Kernel Density Estimator. Journal of Multivariate Analysis, 72(2), 264–309. https://doi.org/10.1006/jmva.1999.1863
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free