Abstract
Multivariate kernel density estimation (KDE) is a very important statistical technique in exploratory data analysis. Research on high performance KDE is still an open research problem. One of the most elegant and efficient approach utilizes the Fast Fourier Transform. Unfortunately, the existing FFT-based solution suffers from a serious limitation, as it can accurately operate only with the constrained (i.e., diagonal) multivariate bandwidth matrices. In the paper we propose a crucial improvement to this algorithm which results in relaxing the above mentioned limitation. Numerical simulation study demonstrates good properties of the new solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Andrzejewski, W., Gramacki, A., Gramacki, J.: Graphics processing units in acceleration of bandwidth selection for kernel density estimation. Int. J. Appl. Math. Comput. Sci. 23(4), 869–885 (2013)
Duong, T.: Kernel smoothing (2016). http://CRAN.R-project.org/package=ks, R package version 1.10.4
González-Manteigaa, W., Sánchez-Selleroa, C., Wand, M.: Accuracy of binned kernel functional approximations. Comput. Stat. Data Anal. 22, 1–16 (1996)
Gramacki, A., Gramacki, J.: FFT-based fast computation of multivariate kernel estimators with unconstrained bandwidth matrices. J. Comput. Graph. Stat. 26(2), 459–462 (2016). doi:10.1080/10618600.2016.1182918
Gramacki, A., Gramacki, J.: FFT-based fast bandwidth selector for multivariate kernel density estimation. Comput. Stat. Data Anal. 106, 27–45 (2017). doi:10.1016/j.csda.2016.09.001
Gramacki, A., Sawerwain, M., Gramacki, J.: FPGA-based bandwidth selection for kernel density estimation using high level synthesis approach. Bull. Pol. Acad. Sci.: Tech. Sci. 64(4), 821–829 (2016). doi:10.1515/bpasts-2016-0091
Hall, P., Wand, M.P.: On the accuracy of binned kernel density estimators. J. Multivar. Anal. 56(2), 165–184 (1996)
Härdle, W.: Smoothing Techniques: With Implementation in S. Springer Series in Statistics. Springer, New York (1991)
Raykar, V., Duraiswami, R., Zhao, L.: Fast computation of kernel estimators. J. Comput. Graph. Stat. 19(1), 205–220 (2010)
Scott, D.W.: Multivariate Density Estimation: Theory, Practice, and Visualization. Wiley Inc., New York (1992)
Silverman, B.W.: Algorithm AS 176: kernel density estimation using the fast fourier transform. Appl. Stat. 31, 93–99 (1982)
Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Chapman & Hall/CRC, London (1986)
Wand, M.P., Jones, M.C.: Kernel Smoothing. Chapman & Hall, London (1995)
Wand, M.: Fast computation of multivariate kernel estimators. J. Comput. Graph. Stat. 3(4), 433–445 (1994)
Wand, M., Ripley, B.: Functions for kernel smoothing supporting Wand & Jones (1995) (2016). http://CRAN.R-project.org/package=KernSmooth, R package version 2.23-15
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Gramacki, J., Gramacki, A. (2017). A Complete Efficient FFT-Based Algorithm for Nonparametric Kernel Density Estimation. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2017. Lecture Notes in Computer Science(), vol 10246. Springer, Cham. https://doi.org/10.1007/978-3-319-59060-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-59060-8_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59059-2
Online ISBN: 978-3-319-59060-8
eBook Packages: Computer ScienceComputer Science (R0)