A projection pursuit index for large p small n data
- First Online:
- Cite this article as:
- Lee, EK. & Cook, D. Stat Comput (2010) 20: 381. doi:10.1007/s11222-009-9131-1
- 231 Downloads
In high-dimensional data, one often seeks a few interesting low-dimensional projections which reveal important aspects of the data. Projection pursuit for classification finds projections that reveal differences between classes. Even though projection pursuit is used to bypass the curse of dimensionality, most indexes will not work well when there are a small number of observations relative to the number of variables, known as a large p (dimension) small n (sample size) problem. This paper discusses the relationship between the sample size and dimensionality on classification and proposes a new projection pursuit index that overcomes the problem of small sample size for exploratory classification.