Sciweavers

396 search results - page 37 / 80
» Lossy Reduction for Very High Dimensional Data
Sort
View
FOCS
2000
IEEE
15 years 4 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
2012
13 years 2 months ago
Sparse Probabilistic Relational Projection
Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretabi...
Wu-Jun Li, Dit-Yan Yeung
NIPS
1997
15 years 1 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 6 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
PR
2008
129views more  PR 2008»
14 years 11 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park