Empirical Testing of Fast Kernel Density Estimation Algorithms
نویسندگان
چکیده
We present results of experiments testing the Fast Gauss Transform, Improved Fast Gauss Transform, and Dual-Tree methods (using kd-tree and Anchors Hierarchy data structures) for fast Kernel Density Estimation (KDE). We examine the performance of these methods with respect to data set size, dimension, allowable error, and data set structure (“clumpiness”), measured in terms of CPU time and memory usage. This is the first multi-method comparison in the literature. The results are striking, challenging several claims that are commonly made about these methods. The results are useful for researchers considering fast methods for KDE problems. Along the way, we provide a corrected error bound and a parameter-selection regime for the IFGT algorithm.
منابع مشابه
Moment Inequalities for Supremum of Empirical Processes of U-Statistic Structure and Application to Density Estimation
We derive moment inequalities for the supremum of empirical processes of U-Statistic structure and give application to kernel type density estimation and estimation of the distribution function for functions of observations.
متن کاملInsights on Fast Kernel Density Estimation Algorithms
We present results of experiments testing the Fast Gauss Transform, Improved Fast Gauss Transform, and Dual-Tree methods (using kd-tree and Anchors Hierarchy data structures) for fast Kernel Density Estimation (KDE). We examine the performance of these methods with respect to data set size, dimension, allowable error, and data set structure (“clumpiness”), measured in terms of CPU time and memo...
متن کاملA Berry-Esseen Type Bound for a Smoothed Version of Grenander Estimator
In various statistical model, such as density estimation and estimation of regression curves or hazard rates, monotonicity constraints can arise naturally. A frequently encountered problem in nonparametric statistics is to estimate a monotone density function f on a compact interval. A known estimator for density function of f under the restriction that f is decreasing, is Grenander estimator, ...
متن کاملFast Kernel Density Independent Component Analysis
We develop a super-fast kernel density estimation algorithm (FastKDE) and based on this a fast kernel independent component analysis algorithm (KDICA). FastKDE calculates the kernel density estimator exactly and its computation only requires sorting n numbers plus roughly 2n evaluations of the exponential function, where n is the sample size. KDICA converges as quickly as parametric ICA algorit...
متن کاملFast Algorithms for the Solution of Stochastic Partial Differential Equations
Title of dissertation: FAST ALGORITHMS FOR THE SOLUTION OF STOCHASTIC PARTIAL DIFFERENTIAL EQUATIONS Christopher W. Miller, Doctor of Philosophy, 2012 Dissertation directed by: Professor Howard Elman Department of Computer Science Institute for Advanced Computer Studies We explore the performance of several algorithms for the solution of stochastic partial differential equations including the s...
متن کامل