scikit-learn/scikit-learn — Issue #597: Fibonacci Heaps for Ball Tree
Author: jakevdp
Created: 2012-01-29 23:53:48+00:00
State: open

The Ball Tree neighbor search could potentially be sped up greatly (especially for large `n_neighbors` and `n_features`) by using Fibonacci heaps instead of the binary heap/priority queue structures used currently. There is a fast cython Fibonacci heap in `sklearn/utils/graph_nearest_neighbor.pyx`. This should be factored out so that it can also be used in the Ball Tree.