Data

Tools

Indexes

Applications

Experiments

Open Source Science

https://github.com/andoslandsbotn/distributed-cover-tree-project

In this project we develop a distributed cover-tree algorithm

https://github.com/andoslandsbotn/distributed-cover-tree-project

Science Score: 13.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • ○
    CITATION.cff file
  • ○
    codemeta.json file
  • ○
    .zenodo.json file
  • ✓
    DOI references
    Found 2 DOI reference(s) in README
  • ○
    Academic publication links
  • ○
    Academic email domains
  • ○
    Institutional organization owner
  • ○
    JOSS paper metadata
  • ○
    Scientific vocabulary similarity
    Low similarity (6.8%) to scientific vocabulary
Last synced: 9 months ago · JSON representation

Repository

In this project we develop a distributed cover-tree algorithm

Basic Info
  • Host: GitHub
  • Owner: AndOslandsbotn
  • License: gpl-3.0
  • Language: Python
  • Default Branch: main
  • Size: 62.5 KB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created over 3 years ago · Last pushed over 3 years ago
Metadata Files
Readme License

README.md

Distributed-cover-tree-project

In this project we develop a distributed cover-tree algorithm using the Ray framework and asyncio.

The cover-tree is an algorithm that generates an epsilon cover of a point cloud of data. But was originally intended as a datastructure for nearest neighbor search in metric spaces.

Install

To install the code, clone the repository and install the packages in the requirements.txt file using pip install -r requirements.txt from the root of your repository

Run

To run a test of the code on a dummy dataset. Run first

- main_generate_dummydata.py

This generates a dataset of desired size. Then run 

- main.py

This constructs a cover-tree in a distributed manner.

Note

To run tests it might be necessary to add a Logg folder to the tests folder

Reference

The standard cover-tree algorithm can for example be found here:

[1] A. Beygelzimer, S. Kakade and J. Langford (2006) Cover trees for nearest neighbor Proc. 23th Int. Conf. Mach. Learn. p. 97--104 https://doi.org/10.1145/1143844.1143857

Owner

  • Name: Andreas Oslandsbotn
  • Login: AndOslandsbotn
  • Kind: user
  • Location: Oslo, Norway
  • Company: Simula Research Laboratory

Master in Applied Physics and Mathematics from the Norwegian University of Science and Technology (NTNU). PhD stud. Mathematics/Machine learning UiO/Simula/UCSD

GitHub Events

Total
Last Year

Dependencies

requirements.txt pypi
  • Deprecated ==1.2.13
  • Pillow ==8.4.0
  • PyYAML ==6.0
  • async-timeout ==4.0.2
  • attrs ==21.4.0
  • click ==8.0.4
  • cycler ==0.11.0
  • dataclasses ==0.6
  • filelock ==3.4.1
  • grpcio ==1.43.0
  • importlib-metadata ==4.8.3
  • jsonschema ==3.2.0
  • kiwisolver ==1.3.1
  • matplotlib ==3.3.4
  • msgpack ==1.0.3
  • numpy ==1.19.5
  • packaging ==21.3
  • protobuf ==3.19.4
  • py-cpuinfo ==8.0.0
  • pyparsing ==3.0.7
  • pyrsistent ==0.18.0
  • python-dateutil ==2.8.2
  • ray ==1.11.0
  • redis ==4.2.1
  • scipy ==1.5.4
  • six ==1.16.0
  • tqdm ==4.65.0
  • typing_extensions ==4.1.1
  • wrapt ==1.14.0
  • zipp ==3.6.0