Parallel Computing of Kernel Density Estimates with MPI

Authors:
Szymon Łukasik
Affiliations:
Department of Automatic Control, Cracow University of Technology, ul. Warszawska 24, 31-155 Cracow, Poland
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 4
Cited 1

MPI: The Complete Reference

MPI: The Complete Reference
Parallel distributed kernel estimation

Computational Statistics & Data Analysis
Efficient Kernel Density Estimation Using the Fast Gauss Transform with Applications to Color Modeling and Tracking

IEEE Transactions on Pattern Analysis and Machine Intelligence
Motion-based background subtraction using adaptive kernel density estimation

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition

An algorithm for sample and data dimensionality reduction using fast simulated annealing

ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Kernel density estimation is nowadays a very popular tool for nonparametric probabilistic density estimation. One of its most important disadvantages is computational complexity of calculations needed, especially for data-based bandwidth selection and adaptation of bandwidth coefficient. The article presents parallel methods which can significantly improve calculation time. Results of using reference implementation based on Message Passing Interface standard in multicomputer environment are included as well as a discussion on effectiveness of parallelization.