Fast Approximate Complete-data k-nearest-neighbor Estimation
We introduce a fast method to estimate the complete-data set of k-nearest-neighbors.This is equivalent to finding an estimate of the k-nearest-neighbor graph of the data. The method relies on random normal projections. The k-nearest-neighbors are estimated by sorting points in a number of random li...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Austrian Statistical Society
2020-02-01
|
| Series: | Austrian Journal of Statistics |
| Online Access: | http://www.ajs.or.at/index.php/ajs/article/view/907 |