yuj-umd / fastsc

Related projects ⓘ

Alternatives and complementary repositories for fastsc

• 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
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆71Updated 3 years ago
• stanis-morozov / unq
  Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search
  ☆35Updated 5 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• hp027 / AliGraph
  Large Scale Graphical Model
  ☆24Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 9 years ago
• lengyyy / KNN-Graph
  Building KNN Graph for Billion High Dimensional Vectors Efficiently
  ☆21Updated 5 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆75Updated 6 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• kylasa / NewtonCG
  GPU Accelerated Subsampled Newton Method for Convex Optimization
  ☆8Updated 6 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆34Updated 6 years ago
• dglai / minigun
  Light-weight GPU kernel interface for graph operations
  ☆15Updated 4 years ago
• norouzi / ckmeans
  Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.
  ☆50Updated 11 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆16Updated 6 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆57Updated 4 months ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• Cyanogenoid / perm-optim
  [ICLR 2019] Learning Representations of Sets through Optimized Permutations
  ☆36Updated 5 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 5 years ago
• zjuchenwei / vector-line-quantization
  ☆12Updated 5 years ago
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 5 years ago
• arbenson / tensor-sc
  Tensor spectral clustering.
  ☆28Updated 7 years ago
• songzhaozhe / Model-Architecture-Search-Paper-List
  A summary of my recently surveyed papers. Some papers on Arxiv with unimpressive results are not included.
  ☆24Updated 6 years ago