Alternatives and similar repositories for fastsc

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

• 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
• jenniferjang / subsampled_neighborhood_graph_dbscan
  Subsampled Graph-Based DBSCAN
  ☆11Updated 4 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…
  ☆69Updated 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• stanis-morozov / unq
  Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search
  ☆36Updated 6 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆79Updated 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 13 years ago
• ramkikannan / planc
  Distributed NMF/NTF Library
  ☆47Updated 8 months ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated last year
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 6 years ago
• LPMP / LPMP
  Solving LPs with convergent message passing
  ☆66Updated 2 years ago
• Cyanogenoid / perm-optim
  [ICLR 2019] Learning Representations of Sets through Optimized Permutations
  ☆36Updated 6 years ago
• karthikv2k / gpu_dbscan
  GPU version of DBSCAN using FB's faiss
  ☆52Updated 8 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 7 years ago
• lengyyy / KNN-Graph
  Building KNN Graph for Billion High Dimensional Vectors Efficiently
  ☆21Updated 6 years ago
• norouzi / ckmeans
  Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.
  ☆51Updated 11 years ago
• ZJULearning / AtSNE
  Anchor-t-SNE for large-scale and high-dimension vector visualization
  ☆56Updated 5 years ago
• maciejzieba / binGAN
  ☆37Updated 5 years ago
• kingfengji / eForest
  This is the official implementation for the paper 'AutoEncoder by Forest'
  ☆75Updated 7 years ago
• fjxmlzn / GPUTaskScheduler
  GPU Task Scheduler (Python library)
  ☆43Updated 4 years ago
• oir / soft-tree
  Soft Decision Trees (code for ICPR 21 paper)
  ☆33Updated 11 years ago
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆92Updated 6 years ago
• josipd / torch-submod
  A PyTorch library for differentiable submodular minimization.
  ☆58Updated 7 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• chrischoy / knn_cuda
  Fast K-Nearest Neighbor search with GPU
  ☆141Updated 7 years ago
• vulq / Flo
  Parallel network flows using OpenMP and CUDA.
  ☆28Updated 6 years ago
• NLPrinceton / sparse_recovery
  noiseless/nonnegative sparse recovery and feature retrieval via compressed sensing
  ☆38Updated 7 years ago