A fast algorithm for sparse probability density function construction

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Hong, X. ORCID: https://orcid.org/0000-0002-6832-2298 and Chen, S. (2013) A fast algorithm for sparse probability density function construction. In: 18th International Conference on Digital Signal Processing (DSP2013), 2013-07-01 - 2013-07-03, Santorini - Greece.

Abstract/Summary

A new sparse kernel density estimator is introduced. Our main contribution is to develop a recursive algorithm for the selection of significant kernels one at time using the minimum integrated square error (MISE) criterion for both kernel selection. The proposed approach is simple to implement and the associated computational cost is very low. Numerical examples are employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with competitive accuracy to existing kernel density estimators.

Item Type Conference or Workshop Item (Paper)
URI https://reading-pure-test.eprints-hosting.org/id/eprint/153982
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record