165 search results - page 17 / 33 » Adaptive dimension reduction for clustering high dimensional... |
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...
105
Voted
MICAI
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
118
click to vote
NIPS
2001
15 years 1 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
201
click to vote
ICDE
1998
IEEE
16 years 1 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
SODA
2000
ACM
15 years 1 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...