On the distance concentration awareness of certain data reduction techniques

DOI10.1016/J.PATCOG.2010.08.018zbMath1211.68357OpenAlexW2150688459MaRDI QIDQ614077

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

zbMATH Keywords

projection pursuitdimensionality reductionfeature selectionsure independence screeningdistance concentration

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Applications of statistics (62P99) Data structures (68P05)

Related Items (2)

Non-parametric detection of meaningless distances in high dimensional data ⋮ A survey on unsupervised outlier detection in high‐dimensional numerical data

Uses Software

• ElemStatLearn
• L1-MAGIC
• boost

Cites Work

• Unnamed Item
• On the geometry of similarity search: dimensionality curse and concentration of measure
• New instability results for high-dimensional nearest neighbor search
• Independent component analysis by general nonlinear Hebbian-like learning rules
• Problems and results in extremal combinatorics. I.
• Asymptotics of graphical projection pursuit
• When is `nearest neighbour' meaningful: A converse theorem and implications
• Sure Independence Screening for Ultrahigh Dimensional Feature Space
• An elementary proof of a theorem of Johnson and Lindenstrauss
• The elements of statistical learning. Data mining, inference, and prediction
• Gene selection for cancer classification using support vector machines

This page was built for publication: On the distance concentration awareness of certain data reduction techniques