BSD-3-Clause licensed by Marco Zocca
Maintained by ocramz
This version can be pinned in stack with:rp-tree-0.7.1@sha256:d8424a481af84b6788cae30804f3761ebca4c40958c1f9fff2340f8c07ab28da,3647

Module documentation for 0.7.1

  • Data
    • Data.RPTree

rp-tree

Hackage GitHub last commit

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

rp-tree

Changes

0.7

  • add batch index creation ‘treeBatch’, ‘forestBatch’, ‘dataBatch’ and corresponding unit tests (#5)

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