DocumentCode
3632545
Title
Fast parzen window density estimator
Author
Xiaoxia Wang;Peter Tino;Mark A. Fardal;Somak Raychaudhury;Arif Babul
Author_Institution
School of Computer Science, University of Birmingham, UK
fYear
2009
Firstpage
3267
Lastpage
3274
Abstract
Parzen Windows (PW) is a popular nonparametric density estimation technique. In general the smoothing kernel is placed on all available data points, which makes the algorithm computationally expensive when large datasets are considered. Several approaches have been proposed in the past to reduce the computational cost of PW either by subsampling the dataset, or by imposing a sparsity in the density model. Typically the latter requires a rather involved and complex learning process. In this paper, we propose a new simple and efficient kernel-based method for non-parametric probability density function (pdf) estimation on large datasets. We cover the entire data space by a set of fixed radii hyper-balls with densities represented by full covariance Gaussians. The accuracy and efficiency of the new estimator is verified on both synthetic dataset and large datasets of astronomical simulations of the galaxy disruption process. Experiments demonstrate that the estimation accuracy of the new estimator is comparable to that of the previous approaches but with a significant speed-up. We also show that the pdf learnt by the new estimator could used to automatically find the most matching set in large scale astronomical simulations.
Keywords
"Kernel","Gaussian processes","Computational efficiency","Smoothing methods","Large-scale systems","Astronomy","Probability density function","Physics","Neural networks","Statistical learning"
Publisher
ieee
Conference_Titel
Neural Networks, 2009. IJCNN 2009. International Joint Conference on
ISSN
2161-4393
Print_ISBN
978-1-4244-3548-7
Electronic_ISBN
2161-4407
Type
conf
DOI
10.1109/IJCNN.2009.5178637
Filename
5178637
Link To Document