|
|
| (2 versions intermédiaires par un autre utilisateur non affichées) |
| Ligne 1 : |
Ligne 1 : |
| ==en construction==
| | #REDIRECTION[[Poursuite de projection]] |
|
| |
|
| == Définition ==
| | [[Catégorie:ENGLISH]] |
| XXXXXXXXX
| |
| | |
| == Français ==
| |
| ''' XXXXXXXXX '''
| |
| | |
| == Anglais ==
| |
| ''' Projection pursuit '''
| |
| Projection pursuit (PP) is a type of statistical technique which involves finding the most "interesting" possible projections in multidimensional data. Often, projections which deviate more from a normal distribution are considered to be more interesting. As each projection is found, the data are reduced by removing the component along that projection, and the process is repeated to find new projections; this is the "pursuit" aspect that motivated the technique known as matching pursuit.[1][2]
| |
| | |
| The idea of projection pursuit is to locate the projection or projections from high-dimensional space to low-dimensional space that reveal the most details about the structure of the data set. Once an interesting set of projections has been found, existing structures (clusters, surfaces, etc.) can be extracted and analyzed separately.
| |
| | |
| Projection pursuit has been widely used for blind source separation, so it is very important in independent component analysis. Projection pursuit seeks one projection at a time such that the extracted signal is as non-Gaussian as possible.[3]
| |
| | |
| <small>
| |
| | |
| [https://en.wikipedia.org/wiki/Projection_pursuit Source : Wikipedia Machine Learning ]
| |
| | |
| | |
| [[Catégorie:vocabulary]]
| |
| [[Catégorie:Wikipedia-IA]] | |
