On the distance concentration awareness of certain data reduction techniques
DOI10.1016/J.PATCOG.2010.08.018zbMATH Open1211.68357OpenAlexW2150688459MaRDI QIDQ614077FDOQ614077
Authors: Ata Kabán
Publication date: 23 December 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.08.018
Recommendations
feature selectiondimensionality reductionprojection pursuitsure independence screeningdistance concentration
Applications of statistics (62P99) Pattern recognition, speech recognition (68T10) Data structures (68P05)
Cites Work
- The elements of statistical learning. Data mining, inference, and prediction
- Gene selection for cancer classification using support vector machines
- Sure Independence Screening for Ultrahigh Dimensional Feature Space
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Asymptotics of graphical projection pursuit
- Title not available (Why is that?)
- Independent component analysis by general nonlinear Hebbian-like learning rules
- Problems and results in extremal combinatorics. I.
- On the geometry of similarity search: dimensionality curse and concentration of measure
- When is `nearest neighbour' meaningful: A converse theorem and implications
- New instability results for high-dimensional nearest neighbor search
Cited In (4)
Uses Software
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)