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
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 6 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 7 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 years ago
• ramkikannan / planc
  Distributed NMF/NTF Library
  ☆48Updated 10 months ago
• jenniferjang / subsampled_neighborhood_graph_dbscan
  Subsampled Graph-Based DBSCAN
  ☆11Updated 5 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
• HyTruongSon / GraphFlow
  Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…
  ☆53Updated 4 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• norouzi / ckmeans
  Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.
  ☆51Updated 12 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆33Updated 8 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆79Updated 2 years ago
• vulq / Flo
  Parallel network flows using OpenMP and CUDA.
  ☆28Updated 6 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 6 years ago
• oir / soft-tree
  Soft Decision Trees (code for ICPR 21 paper)
  ☆33Updated 11 years ago
• huanzhang12 / hogwildpp
  HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent
  ☆33Updated 9 years ago
• lengyyy / KNN-Graph
  Building KNN Graph for Billion High Dimensional Vectors Efficiently
  ☆21Updated 6 years ago
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆92Updated 7 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆46Updated 5 years ago
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆80Updated 2 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆59Updated last year
• FALCONN-LIB / FFHT
  Fast Fast Hadamard Transform
  ☆84Updated 3 years ago
• LPMP / LPMP
  Solving LPs with convergent message passing
  ☆67Updated 2 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 7 years ago
• hp027 / AliGraph
  Large Scale Graphical Model
  ☆24Updated 6 years ago
• ZJULearning / AtSNE
  Anchor-t-SNE for large-scale and high-dimension vector visualization
  ☆57Updated 6 years ago
• hechtlinger / graph_cnn
  Supplementary code to "Convolutional Neural Networks Generalization Utilizing the Data Graph Structure"
  ☆49Updated 8 years ago
• karthikv2k / gpu_dbscan
  GPU version of DBSCAN using FB's faiss
  ☆52Updated 8 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• fabianp / ProxASAGA
  Proximal Asynchronous SAGA
  ☆13Updated 7 years ago