Alternatives and similar repositories for fastsc

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

• 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
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 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
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• stvdedal / gspan
  graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
  ☆11Updated 7 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• huanzhang12 / hogwildpp
  HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent
  ☆33Updated 8 years ago
• hp027 / AliGraph
  Large Scale Graphical Model
  ☆24Updated 6 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆78Updated 2 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• vulq / Flo
  Parallel network flows using OpenMP and CUDA.
  ☆28Updated 6 years ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆15Updated 6 years ago
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 9 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 3 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆46Updated 5 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• lengyyy / KNN-Graph
  Building KNN Graph for Billion High Dimensional Vectors Efficiently
  ☆21Updated 6 years ago
• fabianp / ProxASAGA
  Proximal Asynchronous SAGA
  ☆12Updated 7 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• stanis-morozov / unq
  Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search
  ☆36Updated 5 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• ermongroup / neuralsort
  Code for "Stochastic Optimization of Sorting Networks using Continuous Relaxations", ICLR 2019.
  ☆145Updated 2 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 10 months ago
• kylasa / NewtonCG
  GPU Accelerated Subsampled Newton Method for Convex Optimization
  ☆8Updated 7 years ago
• zalanborsos / coresets
  Coresets
  ☆37Updated 3 years ago