On the distance concentration awareness of certain data reduction techniques
From MaRDI portal
Publication:614077
Recommendations
Cites work
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Asymptotics of graphical projection pursuit
- Gene selection for cancer classification using support vector machines
- Independent component analysis by general nonlinear Hebbian-like learning rules
- New instability results for high-dimensional nearest neighbor search
- On the geometry of similarity search: dimensionality curse and concentration of measure
- Problems and results in extremal combinatorics. I.
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- The elements of statistical learning. Data mining, inference, and prediction
- When is `nearest neighbour' meaningful: A converse theorem and implications
Cited in
(4)
This page was built for publication: On the distance concentration awareness of certain data reduction techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614077)