1987
DOI: 10.2307/2981662
|View full text |Cite
|
Sign up to set email alerts
|

What is Projection Pursuit?

Abstract: SUMMARY Friedman and Tukey (1974) introduced the term “projection pursuit” for a technique for the exploratory analysis of multivariate data sets; the method seeks out “interesting” linear projections of the multivariate data onto a line or a plane. In this paper, we show how to set Friedman and Tukey's idea in a more structured context than they offered. This makes it possible to offer some suggestions for the reformulation of the method, and thence to identify a computationally efficient approach to its impl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
251
0
9

Year Published

1997
1997
2015
2015

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 445 publications
(262 citation statements)
references
References 12 publications
2
251
0
9
Order By: Relevance
“…Early approaches in this respect were based on the gradient techniques [30,29] and Newton-Raphson [31,37,14,13], where the projections are performed in at most three dimensions for visual exploratory tasks, the so-called exploratory projection pursuit (EPP). Further developments focused on developing more global methods for PP optimization, such as random search [38,39,29], genetic algorithm (GA) [32], random scan sampling algorithm (RSSA) [34], simulated annealing (SA) [21], particle swarm optimization (PSO) [35] and tribes [40].…”
Section: Pp Optimizationmentioning
confidence: 99%
See 2 more Smart Citations
“…Early approaches in this respect were based on the gradient techniques [30,29] and Newton-Raphson [31,37,14,13], where the projections are performed in at most three dimensions for visual exploratory tasks, the so-called exploratory projection pursuit (EPP). Further developments focused on developing more global methods for PP optimization, such as random search [38,39,29], genetic algorithm (GA) [32], random scan sampling algorithm (RSSA) [34], simulated annealing (SA) [21], particle swarm optimization (PSO) [35] and tribes [40].…”
Section: Pp Optimizationmentioning
confidence: 99%
“…A great deal of research in the PP community has been centered on the construction of meaningful PP indexes for different purposes. It is possible to find PP indexes for clustering analysis [42,19,38,39,43,30,13], for supervised analysis [44,45,21,5] and for regression analysis [46,47]. Given that this paper is targeted to supervised analysis, we briefly describe some relevant supervised PP indexes included in the experimental evaluation of the paper.…”
Section: Projection Pursuit Indicesmentioning
confidence: 99%
See 1 more Smart Citation
“…they can be used for the projection index. Jones and Sibson (1987) proposed a one-dimensional projection index named the "moment index," with the third cumulant k 3 = µ 3 and the fourth cumulant k 4 = µ 4 − 3:…”
Section: Moment Indexmentioning
confidence: 99%
“…There are in fact an infinite number of possible projections to choose from, so which one should be used? Projection pursuit (Jones and Sibson, 1987} is concerned with resolving this kind of problem.…”
Section: Contextmentioning
confidence: 99%