A locality-sensitive hash for real vectors

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1179-1189

  Neylon, Tyler ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CONSTANT TIME; DIMENSION REDUCTION; EXPECTED TIME; INPUT VECTOR; LOCALITY SENSITIVE HASH; QUERY TIME; REAL VECTOR; SPACE AND TIME;

VECTOR SPACES;

EID: 77951691994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.94     Document Type: Conference Paper

References (15)

1. D. Achlioptas, Database-friendly random projections, Symposium on principles of database systems, 2001.
2. A. Andoni and P. Indyk, Near-optimal hashing algorithm for approximate nearest neighbor in high dimensions, Communications of the ACM. 51:117-122, 2008,
3. A. Broder, M. Charikar, A. Frieze and M. Mitzenmacher, Mm-wise independent permutations. Proceedings of the 30th annual ACM symposium on theory of computing, 1998.
4. T.M. Chan, Approximate nearest neighbor queries revisited, Disc. Comp. Geom., 20(1998), pp. 359-373.
5. T.M. Chan, Closest-point problems simplified on the RAM, Proceedings of the ACM-SIAM Symposium on discrete algorithms, 2002.
6. J.H. Conway and N.J.A. Sloane, Sphere packings, lattices, and groups, Springer, 1993.
7. M. Datar, N. Immorlica, P. Inclyk and V. rvlirrokni, Locality-sensitive hashing scheme based on p-stable distributions, Proceedings of the 20th annual symposium on computational geometry, 2004.
8. A. Gionis, P. Indyk and R. Motwani, Similarity search in high dimensions via hashing, Proceedings of the 25th international conference on very large databases, 1999.
9. V. Guruswami, J. Lee and A. Razhorov, Almost Euclidean subspaces of ℓ1 via expander codes, Proceedings of the ACM-SIAM Symposium on discrete algorithms, 2008,
10. P. Indyk, Uncertainty principles, extractors, and explicit embeddings of ℓ2 into ℓ1, Proceedings of the 39th armual ACM symposium on theory of computing, 2007.
11. P. Indyk and R. Motwani, Approximate nearest neighbor: toward removing the curse of dimenszonahty, Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1998.
12. W. Johnson and J. Lindenstrauss, Extensions of Lipschitz maps into a Hilbert space, Contemp. Math., 26(1984), pp. 189-206.
13. C. Manku, A. Jam and A. Sarma. Detecting near- duplicates for web crawling, Proceedings of the 16th international conference on WWW, 2007.
14. R. Panigrahy, Entropy-based nearest neighbor algorithm in high dimensions, Proceedings of the ACrVISIAM Symposium on discrete algorithms, 2006.
15. H. Samet, Foundations of Multidimensional and Metric Data Structures, Elsevier, 2006.