Alternatives and similar repositories for tree-based-parallel-kNN

Users that are interested in tree-based-parallel-kNN are comparing it to the libraries listed below

• xmba15 / generic_dbscan
  generic DBSCAN on CPU & GPU
  ☆33Updated 2 years ago
• wangyiqiu / hdbscan
  A Fast Parallel Algorithm for HDBSCAN* Clustering
  ☆58Updated 2 years ago
• rohanmohapatra / hdbscan-cpp
  Fast and Efficient Implementation of HDBSCAN in C++ using STL
  ☆64Updated 5 years ago
• amock / kNNcuda
  knn Cuda implementation
  ☆16Updated 3 years ago
• wangyiqiu / dbscan
  Further development has been moved to a new repository https://github.com/wangyiqiu/dbscan-python
  ☆18Updated 2 years ago
• iromu / Graclus
  Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…
  ☆22Updated 12 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆78Updated last year
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆116Updated last year
• rahulyesantharao / batch-dynamic-kdtree
  Parallel, batch-dynamic kdtree
  ☆13Updated 3 years ago
• egbertbouman / fgm-cpp
  C++ library for solving graph matching problems using Factorized Graph Matching
  ☆15Updated 9 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆29Updated 10 years ago
• rmsalinas / picoflann
  Minimal library for Exact KdTree Search
  ☆20Updated 6 years ago
• sergiud / SuiteSparse
  SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support
  ☆53Updated 10 months ago
• jmaye / curb-detection
  A C++ based library for curb detection
  ☆24Updated 12 years ago
• Markus-Goetz / hpdbscan
  Highly parallel DBSCAN (HPDBSCAN)
  ☆44Updated 8 months ago
• YechengLyu / ChipNet
  ☆15Updated 5 years ago
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• l3lackcurtains / fast-cuda-gpu-dbscan
  CUDA-DClust+: Fast DBSCAN algorithm implemented on CUDA. Based on the research paper.
  ☆13Updated 3 weeks ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆78Updated 6 years ago
• cggos / hpc
  High-Performance Computing: CPU Instructions, GPU OpenCL & CUDA, etc.
  ☆14Updated last year
• ghamerly / fast-kmeans
  Code to speed up k-means clustering. Originally at BaylorCS/baylorml.
  ☆57Updated last year
• guiyang882 / DensityCluster
  Machine learning. Clustering by fast search and find of density peaks.
  ☆33Updated 8 years ago
• gyaikhom / agglomerative-hierarchical-clustering
  Implements the Agglomerative Hierarchical Clustering algorithm.
  ☆68Updated 5 years ago
• MichaelRuhnke / ssa
  Sparse Surface Adjustment
  ☆16Updated 11 years ago
• CallmeNezha / SimpleDBSCAN
  A one header only DBSCAN (N-dimensions support) implementation
  ☆121Updated 3 years ago
• jamespayor / weighted-bipartite-perfect-matching
  Fast C++ implementation of an O(NM) algorithm for the assignment problem.
  ☆53Updated 4 years ago
• Eleobert / dbscan
  Probably the fastest C++ dbscan library.
  ☆96Updated last year
• daviddoria / ClusteringSegmentation
  Point cloud segmentation using radially bounded nearest neighbor clustering
  ☆22Updated 13 years ago
• vazois / TopK
  TopK Algorithms Benchmark
  ☆10Updated 5 years ago