76 search results - page 4 / 16 » Nonlinear Dimensionality Reduction using Approximate Nearest... |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
ICML
2004
IEEE
14 years 1 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
CVPR
2010
IEEE
13 years 6 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...