1224 search results - page 56 / 245 » On the Optimality of the Dimensionality Reduction Method |
174
click to vote
CORR
2010
Springer
15 years 4 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...
222
click to vote
PAMI
2012
13 years 8 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...
156
click to vote
CICLING
2007
Springer
16 years 10 days ago
2007
Springer
Term selection process is a very necessary component for most natural language processing tasks. Although different unsupervised techniques have been proposed, the best results ar...
128
click to vote
SIAMSC
2010
15 years 27 days ago
2010
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods ge...
215
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...