92 search results - page 11 / 19 » Similarity Search in High Dimensions via Hashing |
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
The goal of the paper is to present a novel Chi-square similarity measure and assess its performance through comparison with well-known similarity measures such as Cosine, Dice, a...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
94
Voted
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...