rp-tree: Random projection trees

[ bsd3, data, data-mining, data-structures, library, machine-learning, program ] [ Propose Tags ]

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


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.2.0.0, 0.2.1.0, 0.3, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5, 0.3.6, 0.4, 0.5, 0.6, 0.7, 0.7.1
Change log Changelog.md
Dependencies base (>=4.7 && <5), boxes, bytestring, conduit (>=1.3.4.1), containers (>=0.6.2.1), deepseq (>=1.4.4.0), exceptions, microlens, microlens-th, mnist-idx-conduit, mtl, rp-tree, serialise (>=0.2.3.0), splitmix (>=0.1.0.3), splitmix-distributions (>=0.8), transformers (>=0.5.6.2), vector (>=0.12.1.2), vector-algorithms (>=0.8.0.4) [details]
License BSD-3-Clause
Copyright 2021 Marco Zocca
Author Marco Zocca
Maintainer ocramz
Category Data Mining, Data Structures, Machine Learning, Data
Home page https://github.com/ocramz/rp-tree
Source repo head: git clone https://github.com/ocramz/rp-tree
Uploaded by ocramz at 2021-05-14T16:45:20Z
Distributions LTSHaskell:0.7.1, NixOS:0.7.1, Stackage:0.7.1
Executables rp-tree
Downloads 2277 total (46 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-05-14 [all 1 reports]

Readme for rp-tree-0.2.1.0

[back to package description]

rp-tree

rp-tree

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