Sciweavers

137 search results - page 5 / 28
» Ordinal Embedding: Approximation Algorithms and Dimensionali...
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
Tony Lin, Hongbin Zha, Sang Uk Lee
FOCS
2006
IEEE
14 years 1 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
ICONIP
2004
13 years 9 months ago
Non-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
Ashutosh Saxena, Abhinav Gupta, Amitabha Mukerjee
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 8 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
IBPRIA
2003
Springer
14 years 28 days ago
Supervised Locally Linear Embedding Algorithm for Pattern Recognition
The dimensionality of the input data often far exceeds their intrinsic dimensionality. As a result, it may be difficult to recognize multidimensional data, especially if the number...
Olga Kouropteva, Oleg Okun, Matti Pietikäinen