A Computational Perspective on Projection Pursuit in High Dimensions: Feasible or Infeasible Feature Extraction
From MaRDI portal
Publication:6089883
DOI10.1111/INSR.12517WikidataQ114080822 ScholiaQ114080822MaRDI QIDQ6089883FDOQ6089883
Jimin Ye, Chunming Zhang, Xiaomei Wang
Publication date: 15 December 2023
Published in: International Statistical Review (Search for Journal in Brave)
Cites Work
- Principal component analysis.
- Asymptotic Statistics
- Title not available (Why is that?)
- Model-based clustering of high-dimensional data: a review
- Principal component analysis: a review and recent developments
- Title not available (Why is that?)
- What is Projection Pursuit?
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- Projection pursuit in high dimensions
- Projection pursuit
- Asymptotics of graphical projection pursuit
- Exploratory Projection Pursuit
- Projection pursuit exploratory data analysis
- Three-Dimensional Projection Pursuit
- Smallest singular value of a random rectangular matrix
- Title not available (Why is that?)
- A limit theorem for the norm of random matrices
- A multivariate Kolmogorov-Smirnov test of goodness of fit
- Title not available (Why is that?)
- A multivariate skew-garch model
- Bump hunting with non-Gaussian kernels
- Skewness-based projection pursuit: a computational approach
- Projection pursuit for discrete data
- Maximum independent component analysis with application to EEG data
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)
