# A Projection Pursuit Algorithm for Exploratory Data Analysis

@article{Friedman1974APP, title={A Projection Pursuit Algorithm for Exploratory Data Analysis}, author={Jerome H. Friedman and John W. Tukey}, journal={IEEE Transactions on Computers}, year={1974}, volume={C-23}, pages={881-890} }

An algorithm for the analysis of multivariate data is presented and is discussed in terms of specific examples. The algorithm seeks to find one-and two-dimensional linear projections of multivariate data that are relatively highly revealing.

#### 1,628 Citations

Exploratory Projection Pursuit

- Mathematics
- 1995

“Projection Pursuit” (PP) stands for a class of exploratory projection techniques. This class contains methods designed for analyzing high dimensional data using low-dimensional projections. The main… Expand

A Neural Network for Feature Extraction

- Computer Science
- NIPS
- 1989

The paper suggests a statistical framework for the parameter estimation problem associated with unsupervised learning in a neural network, leading to an exploratory projection pursuit network that… Expand

REPPlab: An R package for detecting clusters and outliers using exploratory projection pursuit

- Mathematics, Computer Science
- Communications in Statistics - Simulation and Computation
- 2019

The R-package REPPlab is designed to explore multivariate data sets using one-dimensional unsupervised projection pursuit and is useful as a preprocessing step to find clusters or as an out-of-the-box solution to solve multivariate clustering problems. Expand

Graphics for the Multivariate Two-Sample Problem

- Mathematics
- 1981

Abstract Some graphical methods for comparing multivariate samples are presented. These methods are based on minimal spanning tree techniques developed for multivariate two-sample tests. The utility… Expand

Projection Pursuit Regression

- Mathematics
- 1981

Abstract A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictor… Expand

PROJECTION PURSUIT DENSITY ESTIMATION

- Mathematics
- 1984

Abstract The projection pursuit methodology is applied to the multivariate density estimation problem. The resulting nonparametric procedure is often less biased than the kernel and near-neighbor… Expand

Projection Pursuit-A Brief Introduction†

- Mathematics
- 2014

Projection pursuit was conceived as a method for finding ‘interesting’ one- or two-dimensional projections of multivariate data revealing unanticipated structure such as clusters, skewness, or… Expand

An Algorithm with Projection Pursuit for Sliced Inverse Regression Model

- Mathematics
- 2000

In the paper, we investigate a conditional density function of sliced response variables and propose an algorithm for the sliced inverse regression (SIR) model with projection pursuit.

Manifold learning and representations for image analysis and visualization

- Computer Science
- 2006

We present a novel method for manifold learning, i.e. identification of the low-dimensional manifold-like structure present in a set of data points in a possibly high-dimensional space. The main id… Expand

Subspace Optimization Techniques for Classification Problems

- Computer Science
- 2003

The nonlinear conjugate gradients method is a very powerful program in the search for Bayes error optimal linear subspaces for classification problems. In this report, techniques to find linear sub… Expand

#### References

SHOWING 1-10 OF 15 REFERENCES

A Nonlinear Mapping for Data Structure Analysis

- Computer Science
- IEEE Transactions on Computers
- 1969

An algorithm for the analysis of multivariate data is presented along with some experimental results. The algorithm is based upon a point mapping of N L-dimensional vectors from the L-space to a… Expand

TOWARD A PRACTICAL METHOD WHICH HELPS UNCOVER THE STRUCTURE OF A SET OF MULTIVARIATE OBSERVATIONS BY FINDING THE LINEAR TRANSFORMATION WHICH OPTIMIZES A NEW “INDEX OF CONDENSATION”

- Mathematics
- 1969

Publisher Summary A major problem in data analysis is to find any structure in a set of multivariate observations. If each observation is represented as a point in multidimensional space, this means… Expand

An Optimal Discriminant Plane

- Computer Science
- IEEE Transactions on Computers
- 1970

A piecewise linear method is described which is being used in the on-line pattern analysis and recognition system (OLPARS) and it is shown that it can be used to discriminate between vector samples from two classes. Expand

A Technique for Determining and Coding Subclasses in Pattern Recognition Problems

- Mathematics, Computer Science
- IBM J. Res. Dev.
- 1965

This paper describes a method for detecting and coding clusters that needs not be known a priori and no matrix inversion is required. Expand

Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1971

A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster structure in arbitrary point sets; description of the detected clusters… Expand

A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems

- Computer Science
- Comput. J.
- 1966

Transitions whereby inequality constraints of certain forms can be eliminated from the formulation of an optimization problem are described, and examples of their use compared with other methods for handling such constraints are described. Expand

Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973)

- Mathematics
- 1975

Algorithms for Minimization Without Derivatives

- 1972

Bull. Internat. Stat. Inst

- Bull. Internat. Stat. Inst
- 1969