[ENH] k-nearest neighbors regressor: support for non-brute algorithms and non-precomputed mode to improve memory efficiency #15957
Job | Run time |
---|---|
1m 18s | |
8s | |
5m 54s | |
27m 7s | |
32s | |
2m 39s | |
5s | |
5m 35s | |
13m 59s | |
1h 34m 10s | |
18m 6s | |
1h 22m 39s | |
55m 38s | |
1h 30m 42s | |
1h 4m 2s | |
1h 0m 6s | |
34m 57s | |
1h 6m 48s | |
40m 53s | |
1h 30m 3s | |
49m 33s | |
36m 1s | |
56m 50s | |
1h 30m 50s | |
37m 50s | |
49m 17s | |
1h 29m 50s | |
39m 54s | |
52m 51s | |
1h 34m 15s | |
6s | |
9s | |
7s | |
0s | |
0s | |
3m 56s | |
2m 26s | |
4m 0s | |
3m 32s | |
0s | |
2m 21s | |
5m 13s | |
4m 48s | |
3m 17s | |
5m 8s | |
2m 29s | |
2m 35s | |
4m 23s | |
2m 12s | |
1m 38s | |
4m 10s | |
23h 25m 2s |