Projection pursuit
From Wikipedia, the free encyclopedia
Projection pursuit 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.
The projection pursuit concept was developed by Jerome H. Friedman and John Tukey in 1974.
[edit] See also
[edit] References
- J. H. Friedman and J. W. Tukey (Sep. 1974). "A Projection Pursuit Algorithm for Exploratory Data Analysis". IEEE Transactions on Computers C-23 (9): 881–890. doi:10.1109/T-C.1974.224051. ISSN 0018-9340. http://www.slac.stanford.edu/cgi-wrap/getdoc/slac-pub-1312.pdf.
- P. J. Huber (Jun. 1985). "Projection pursuit". The Annuals of Statistics 13 (2): 435–475. doi:10.1214/aos/1176349519. http://www.stat.rutgers.edu/~rebecka/Stat687/huber.pdf.
- M. C. Jones and R. Sibson (1987). "What is Projection Pursuit?". Journal of the Royal Statistical Society, Series A (General) 150 (1): 1–37. doi:10.2307/2981662. JSTOR 2981662.
| This statistics-related article is a stub. You can help Wikipedia by expanding it. |