Alternatives and similar repositories for Learn-LSH

Users that are interested in Learn-LSH 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
• JongikKim / Nass
  ☆14Updated 9 months ago
• saurabhdash / GCN_Partitioning
  Graph Partitoning Using Graph Convolutional Networks
  ☆65Updated 2 years ago
• dzambon / graph-matching-toolkit
  ☆25Updated 4 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆39Updated 6 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆28Updated 6 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 9 months ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 9 months ago
• GTmac / FastRP
  Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"
  ☆57Updated 5 years ago
• RapidsAtHKUST / SimRank
  1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…
  ☆14Updated 4 years ago
• xinyandai / product-quantization
  Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…
  ☆59Updated 4 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• chenyuhsu / learnedsketch
  LearnedSketch: Learning-Based Frequency Estimation Algorithms (ICLR 2019)
  ☆31Updated 2 years ago
• chentingpc / dpq_embedding_compression
  Differentiable Product Quantization for End-to-End Embedding Compression.
  ☆62Updated 2 years ago
• kfoynt / LocalGraphClustering
  ☆138Updated 4 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆21Updated 5 years ago
• yunshengb / graph-matching-toolkit
  ☆13Updated 6 years ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆19Updated 3 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• guofei9987 / pyLSHash
  Locality Sensitive Hashing, fuzzy-hash， min-hash, simhash, aHash, pHash, dHash。基于 Hash值的图片相似度、文本相似度
  ☆59Updated last year
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆23Updated 3 weeks ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• chennnM / GBP
  PyTorch implementation of "Scalable Graph Neural Networks via Bidirectional Propagation"
  ☆27Updated 4 years ago
• Ivanopolo / modnet
  Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"
  ☆36Updated 5 years ago
• nghiahhnguyen / CS224W-Stanford
  This is the repository containing the solution of the homework for the CS224W course at Stanford: Machine Learning with Graphs
  ☆11Updated 4 years ago
• xptree / LightNE
  ☆24Updated 3 years ago