A Computational Perspective on Projection Pursuit in High Dimensions: Feasible or Infeasible Feature Extraction
From MaRDI portal
Publication:6089883
Cites work
- scientific article; zbMATH DE number 3870398 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- scientific article; zbMATH DE number 2119079 (Why is no real title available?)
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- A limit theorem for the norm of random matrices
- A multivariate Kolmogorov-Smirnov test of goodness of fit
- A multivariate skew-GARCH model
- Asymptotic Statistics
- Asymptotics of graphical projection pursuit
- Bump hunting with non-Gaussian kernels
- Exploratory Projection Pursuit
- In search of non-Gaussian components of a high-dimensional distribution
- Maximum independent component analysis with application to EEG data
- Model-based clustering of high-dimensional data: a review
- Principal component analysis.
- Principal component analysis: a review and recent developments
- Projection pursuit
- Projection pursuit exploratory data analysis
- Projection pursuit for discrete data
- Projection pursuit in high dimensions
- Skewness-based projection pursuit: a computational approach
- Smallest singular value of a random rectangular matrix
- Three-Dimensional Projection Pursuit
- What is Projection Pursuit?
Cited in
(2)
This page was built for publication: A Computational Perspective on Projection Pursuit in High Dimensions: Feasible or Infeasible Feature Extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089883)
