Abstract
In high-dimensional data, one often seeks a few interesting low-dimensional projections that reveal important features of the data. Projection pursuit is a procedure for searching high-dimensional data for interesting low-dimensional projections via the optimization of a criterion function called the projection pursuit index. Very few projection pursuit indices incorporate class or group information in the calculation. Hence, they cannot be adequately applied in supervised classification problems to provide low-dimensional projections revealing class differences in the data. This article introduces new indices derived from linear discriminant analysis that can be used for exploratory supervised classification. © 2005 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.
Author supplied keywords
Cite
CITATION STYLE
Lee, E. K., Cook, D., Klinke, S., & Lumley, T. (2005). Projection pursuit for exploratory supervised classification. Journal of Computational and Graphical Statistics, 14(4), 831–846. https://doi.org/10.1198/106186005X77702
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.