vp-tree: Vantage Point Trees

[ bsd3, data, data-mining, data-structures, library, machine-learning ] [ Propose Tags ] [ Report a vulnerability ]

Vantage Point Trees enable fast nearest-neighbor queries in metric 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.1.0.1
Dependencies base (>=4.7 && <5), boxes (>=0.1.5), containers (>=0.6.0.1), deepseq (>=1.4.4.0), depq (>=0.3), mtl (>=2.2.2), mwc-probability (>=2.1.0), primitive (>=0.6.4.0), psqueues (>=0.2.7.2), sampling (>=0.3.3), serialise (>=0.2.2.0), transformers (>=0.5.6.2), vector (>=0.12.1.2), vector-algorithms (>=0.8.0.3) [details]
Tested with ghc ==8.6.5
License BSD-3-Clause
Copyright 2020-2021 Marco Zocca
Author Marco Zocca
Maintainer ocramz
Category Data, Data Mining, Data Structures, Machine Learning
Home page https://github.com/ocramz/vp-tree
Source repo head: git clone https://github.com/ocramz/vp-tree
Uploaded by ocramz at 2021-04-30T10:30:34Z
Distributions NixOS:0.1.0.1
Downloads 333 total (6 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-04-30 [all 1 reports]

Readme for vp-tree-0.1.0.1

[back to package description]

vp-tree

Vantage point trees, as described in

Data structures and algorithms for nearest neighbor search in general metric spaces - P. N. Yianilos

http://web.cs.iastate.edu/~honavar/nndatastructures.pdf

Usage

Import 'Data.VPTree', which also contains usage instructions and comments

Benchmarks

Cumulative memory usage and garbage collection cycles :

$ stack bench -- vp-tree:bench-memory