Improved maximum inner product search with better theoretical guarantee using randomized partition trees (Q1621880)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6976226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved maximum inner product search with better theoretical guarantee using randomized partition trees |
scientific article; zbMATH DE number 6976226 |
Statements
Improved maximum inner product search with better theoretical guarantee using randomized partition trees (English)
0 references
12 November 2018
0 references
maximum inner product search
0 references
nearest neighbor search
0 references
random projection trees
0 references
locality-sensitive hashing
0 references
0.7729236483573914
0 references
0.6631391644477844
0 references
0.6443958282470703
0 references
0.6439217329025269
0 references
0.6435713768005371
0 references
