Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection (Q2880958)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection |
scientific article; zbMATH DE number 6025099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection |
scientific article; zbMATH DE number 6025099 |
Statements
17 April 2012
0 references
nearest neighbors graph
0 references
high dimensional data
0 references
divide and conquer
0 references
Lanczos algorithm
0 references
spectral method
0 references
Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection (English)
0 references
0.8278598785400391
0 references
0.777794599533081
0 references
0.7666994333267212
0 references
