Construct · 1 fields · 1 citations

locality-sensitive hashing: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
locality-sensitivehashing1 CONSTRUCTLocality-sensitiveINDYK · ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms

hashing schemes where similar items collide with higher probability than dissimilar ones, enabling fast approximate nearest-neighbour search.

In algorithms, locality-sensitive hashing refers to hashing schemes where similar items collide with higher probability than dissimilar ones, enabling fast approximate nearest-neighbour search. This meaning comes from Indyk (1998) in Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how locality-sensitive hashing sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

search4 fields · 7 citationsjingle · one word, four constructs

References

  1. Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: towards removing the curse of dimensionality. Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. https://doi.org/10.1145/276698.276876

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct