Approximate Nearest Neighbors¶
Indyk, P., & Motwani, R. (1998). Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), 604-613.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Curse Of Dimensionality
- From geometry to recommendation and search: nearest-neighbour retrieval degrades in raw high-dimensional embeddings, motivating learned low-dimensional representations and approximate-nearest-neighbour methods.
This sourceIntroduces approximate-nearest-neighbour methods and dimension reduction as escapes from the curse in retrieval.
- From geometry to recommendation and search: nearest-neighbour retrieval degrades in raw high-dimensional embeddings, motivating learned low-dimensional representations and approximate-nearest-neighbour methods.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:ddc89aca2f4d · see in the full table