Projection pursuit through relative entropy minimization
From MaRDI portal
Abstract: Projection Pursuit methodology permits to solve the difficult problem of finding an estimate of a density defined on a set of very large dimension. In his seminal article, Huber (see "Projection pursuit", Annals of Statistics, 1985) evidences the interest of the Projection Pursuit method thanks to the factorisation of a density into a Gaussian component and some residual density in a context of Kullback-Leibler divergence maximisation. In the present article, we introduce a new algorithm, and in particular a test for the factorisation of a density estimated from an iid sample.
Recommendations
Cites work
- Asymptotic Statistics
- Asymptotics of graphical projection pursuit
- scientific article; zbMATH DE number 4072103 (Why is no real title available?)
- scientific article; zbMATH DE number 837911 (Why is no real title available?)
- On the forward and backward algorithms of projection pursuit.
- On the theory of elliptically contoured distributions
- Optimal robust estimates using the Kullback-Leibler divergence
- Optimal robust M-estimators using divergences
- Parametric estimation and tests through divergences and the duality technique
- Projection pursuit
- Robust Statistics
- Tail Conditional Expectations for Elliptical Distributions
Cited in
(4)- Minimization Problems Based on Relative <inline-formula> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula>-Entropy I: Forward Projection
- scientific article; zbMATH DE number 4199338 (Why is no real title available?)
- scientific article; zbMATH DE number 2091785 (Why is no real title available?)
- Projection pursuit through -divergence minimisation
This page was built for publication: Projection pursuit through relative entropy minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087570)