15 search results - page 3 / 3 » Can Shared-Neighbor Distances Defeat the Curse of Dimensiona... |
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
ICDE
1999
IEEE
14 years 7 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
DEXA
2006
Springer
13 years 8 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
CVPR
2000
IEEE
13 years 9 months ago
2000
IEEE
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...