This repository has been archived by the owner on Feb 3, 2020. It is now read-only.
v0.5.4
Pre-release
Pre-release
- Now using a heap structure to store the current k nearest neighbours. This has effect on performance for large k.
- The tree can now rearrange the input data to optimize the memory layout of the data.
- The logic in the tree building has been improved. Trees are now around 3 times faster to build compared to the previous release.
- Default
leafsize
changed to 10. With the memory structure optimization the cost of calculating the distance is reduced which means that we should increase the leafsize.