PROJECTION PURSUIT THROUGH RELATIVE ENTROPY MINIMISATION - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

PROJECTION PURSUIT THROUGH RELATIVE ENTROPY MINIMISATION

Résumé

Consider a defined density on a set of very large dimension. It is quite difficult to find an estimate of this density from a data set. However, it is possible through a projection pursuit methodology to solve this problem. In his seminal article, Huber (see "Projection pursuit", Annals of Statistics, 1985) demonstrates the interest of his method in a very simple given case. He considers the factorization of density through a Gaussian component and some residual density. Huber's work is based on maximizing relative entropy. Our proposal leads to a new algorithm. Furthermore, we consider the case when the density to be factorized is estimated from an i.i.d. sample. In this case, we will propose a test for the factorization of the estimated density.
Fichier principal
Vignette du fichier
Touboul-article-1-v2.pdf (463.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00429675 , version 1 (15-12-2009)

Identifiants

  • HAL Id : hal-00429675 , version 1

Citer

Jacques Touboul. PROJECTION PURSUIT THROUGH RELATIVE ENTROPY MINIMISATION. 2008. ⟨hal-00429675⟩
120 Consultations
130 Téléchargements

Partager

Gmail Facebook X LinkedIn More