#
c2lsh
Here are 2 public repositories matching this topic...
This is the implementation for C2LSH algorithm using PySpark with constraints. C2LSH algorithm searches the nearest neighbours (Euclidian space) from the given data points by accepting nearest neighbours using features in the datapoints.
-
Updated
Sep 5, 2020 - Jupyter Notebook
Improve this page
Add a description, image, and links to the c2lsh topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the c2lsh topic, visit your repo's landing page and select "manage topics."