Skip to search formSkip to main contentSkip to account menu

Curse of dimensionality

Known as: Curse of dimension, Problem of dimensionality 
The curse of dimensionality refers to various phenomena that arise when analyzing and organizing data in high-dimensional spaces (often with hundreds… 
Wikipedia (opens in a new tab)

Related topics

Related topics

47 relations
(1+ε)-approximate nearest neighbor searchAdaBoostAnomaly detectionBackward induction

Broader (2)

Dynamic programmingMachine learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
Fighting the Curse of Dimensionality: Compressive Sensing in Exploration Seismology
Many seismic exploration techniques rely on the collection of massive data volumes that are mined for information during… 
Highly Cited
2011
Highly Cited
2011
The Effects of Dimensionality Curse in High Dimensional kNN Search
The dimensionality curse phenomenon states that in high dimensional spaces distances between nearest and farthest points from… 
Highly Cited
2008
Highly Cited
2008
UvA-DARE ( Digital Academic Repository ) Kernel codebooks for scene categorization
This paper introduces a method for scene categorization by modeling ambiguity in the popular codebook approach. The codebook… 
Highly Cited
2008
Highly Cited
2008
Locally linear discriminant embedding: An efficient method for face recognition
Highly Cited
2008
Highly Cited
2008
A hybrid cooperative-comprehensive learning based PSO algorithm for image segmentation using multilevel thresholding
Highly Cited
2007
Highly Cited
2007
Lifting the Curse of Dimensionality
In certain problem domains, “The Curse of Dimensionality” (Hastie et al., 2001) is well known. Also known as the problem of “High… 
Highly Cited
2005
Highly Cited
2005
Graph embedding: a general framework for dimensionality reduction
In the last decades, a large family of algorithms - supervised or unsupervised; stemming from statistic or geometry theory - have… 
Highly Cited
2001
Highly Cited
2001
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
Spatial queries in high-dimensional spaces have been studied extensively. Among them, nearest neighbor queries are important in… 
Review
2000
Review
2000
Direct Method for Rapid Prototyping of Near-Optimal Aircraft Trajectories
Adirectmethod fora real-timegenerationofnear-optimal spatialtrajectoriesofshort-term maneuversonboard a e ying vehiclewith… 
Highly Cited
1998
Highly Cited
1998
The pyramid-technique: towards breaking the curse of dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The Pyramid-Technique is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)