Randomized partition trees for nearest neighbor search (Q2345949)
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 6438358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized partition trees for nearest neighbor search |
scientific article; zbMATH DE number 6438358 |
Statements
Randomized partition trees for nearest neighbor search (English)
0 references
21 May 2015
0 references
nearest neighbor
0 references
intrinsic dimension
0 references
spatial partition
0 references
\(k\)-d tree
0 references
random projection
0 references
0.8179948329925537
0 references
0.8082260489463806
0 references
0.8040962219238281
0 references
0.8023400902748108
0 references
