Sciweavers

1187 search results - page 31 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
IJFCS
2008
121views more  IJFCS 2008»
14 years 9 months ago
Reachability Problems in Low-Dimensional Iterative Maps
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called "strange billi...
Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-...
FOCS
2000
IEEE
15 years 2 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
AAAI
2010
14 years 11 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
WIRN
2005
Springer
15 years 3 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
NIPS
2003
14 years 11 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand