Alternatives and similar repositories for fastsc

Users that are interested in fastsc are comparing it to the libraries listed below

• jenniferjang / subsampled_neighborhood_graph_dbscan
  Subsampled Graph-Based DBSCAN
  ☆11Updated 5 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 7 years ago
• lengyyy / KNN-Graph
  Building KNN Graph for Billion High Dimensional Vectors Efficiently
  ☆21Updated 6 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• LPMP / LPMP
  Solving LPs with convergent message passing
  ☆67Updated 2 years ago
• NVIDIA / kmeans
  kmeans clustering with multi-GPU capabilities
  ☆121Updated 2 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• karthikv2k / gpu_dbscan
  GPU version of DBSCAN using FB's faiss
  ☆52Updated 8 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆61Updated last year
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆54Updated 7 years ago
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆92Updated 7 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆67Updated 8 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆211Updated 4 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 6 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆80Updated 2 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆69Updated 6 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆35Updated 5 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆31Updated 6 years ago
• chrischoy / knn_cuda
  Fast K-Nearest Neighbor search with GPU
  ☆142Updated 8 years ago
• HyTruongSon / GraphFlow
  Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…
  ☆53Updated 4 years ago
• iromu / Graclus
  Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…
  ☆22Updated 13 years ago
• google / quickshift
  A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hi…
  ☆70Updated 7 years ago
• norouzi / ckmeans
  Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.
  ☆51Updated 12 years ago
• usyd-fsalab / NeuralNetworkRandomness
  ☆14Updated 3 years ago
• vulq / Flo
  Parallel network flows using OpenMP and CUDA.
  ☆28Updated 7 years ago
• liamcli / hyperband_benchmarks
  ☆14Updated 8 years ago
• rapidsai / nvgraph
  ☆31Updated 5 years ago
• stanis-morozov / unq
  Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search
  ☆35Updated 6 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆46Updated 6 years ago