15 search results - page 2 / 3 » Can Shared-Neighbor Distances Defeat the Curse of Dimensiona... |
ICDE
2000
IEEE
14 years 7 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
In many real-world applications, Euclidean distance in the original space is not good due to the curse of dimensionality. In this paper, we propose a new method, called Discrimina...
CIKM
2000
Springer
13 years 10 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...