rp-tree

Random projection trees

https://github.com/ocramz/rp-tree

Version on this page:0.6
LTS Haskell 20.16:0.7.1
Stackage Nightly 2023-03-31:0.7.1
Latest on Hackage:0.7.1

See all snapshots rp-tree appears in

BSD-3-Clause licensed by Marco Zocca
Maintained by ocramz
This version can be pinned in stack with:rp-tree-0.6@sha256:55d13747612b858061e7d712cd9a7c66bd301e0a8807ee8621f08d07f10a89b7,3519

Module documentation for 0.6

Used by 1 package in lts-18.28(full list with versions):
rp-tree

rp-tree

Hackage GitHub last commit

Random projection trees for approximate nearest neighbor search in high-dimensional vector spaces.

rp-tree

Changes

0.6

  • add ‘knnPQ’ based on ‘heaps’, to be confirmed how efficient it is

0.5.1

  • no need for ‘microlens’ and ‘hspec’ in the library

0.5

  • fixed intermittent bug in ‘knn’, originally due to messing up the order of ‘take’ and ‘sort’.

0.4

  • add function to compute the forest construction parameters from the dataset dimensions (rpTreeCfg)
  • add type parameter to RPTree to label tree branching points

0.3.6

  • relax lower dependency bounds to ensure it builds with GHC 8.6.5 (== stackage lts 14.27) as well

0.2

  • fix ‘candidates’ such that ‘knn’ now does the right thing
  • now ‘knn’ accepts a distance function as parameter as well
  • add I/O functionality
  • some time benchmarks
A service provided by FP Complete