349 search results - page 23 / 70 » Information Preserving Dimensionality Reduction |
129
click to vote
CORR
2010
Springer
15 years 2 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...
169
Voted
PAMI
2012
13 years 6 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...
115
click to vote
NIPS
2004
15 years 5 months ago
2004
We describe a way of using multiple different types of similarity relationship to learn a low-dimensional embedding of a dataset. Our method chooses different, possibly overlappin...
131
Voted
MM
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
129
Voted
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Systems designed to extract time-critical information from large volumes of unstructured data must include the ability, both from an architectural and algorithmic point of view, t...