Sciweavers

116 search results - page 1 / 24
» Dimensionality reduction techniques for proximity problems
Sort
View
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 6 months ago
Dimensionality reduction techniques for proximity problems
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...
Piotr Indyk
ICML
2007
IEEE
14 years 5 months ago
Map building without localization by dimensionality reduction techniques
This paper proposes a new map building framework for mobile robot named Localization-Free Mapping by Dimensionality Reduction (LFMDR). In this framework, the robot map building is...
Takehisa Yairi
SODA
2001
ACM
103views Algorithms» more  SODA 2001»
13 years 6 months ago
Reductions among high dimensional proximity problems
Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan
ICML
2005
IEEE
14 years 5 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
13 years 6 months ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye