38 search results - page 4 / 8 » Near Optimal Dimensionality Reductions That Preserve Volumes |
120
Voted
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
87
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider feature extraction (dimensionality reduction) for compositional data, where the data vectors are constrained to be positive and constant-sum. In real-world problems, t...
98
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
147
click to vote
PAMI
2012
13 years 2 months ago
2012
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
111
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...