Alternatives and similar repositories for Balanced_k-Means_Revisited:

Users that are interested in Balanced_k-Means_Revisited are comparing it to the libraries listed below

• dglai / minigun
  Light-weight GPU kernel interface for graph operations
  ☆15Updated 4 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆20Updated last week
• apd10 / universal_memory_allocation
  ☆15Updated 3 years ago
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆140Updated this week
• kk9six / Learn-LSH
  ☆13Updated 6 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 9 months ago
• xptree / LightNE
  ☆24Updated 2 years ago
• daochenzha / neuroshard
  [MLSys 2023] Pre-train and Search: Efficient Embedding Table Sharding with Pre-trained Neural Cost Models
  ☆16Updated last year
• StatsDLMathsRecomSys / Knowledge-aware-complementary-product-representation-learning
  ☆12Updated 2 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
• daochenzha / autoshard
  [KDD 2022] AutoShard: Automated Embedding Table Sharding for Recommender Systems
  ☆21Updated 2 years ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆66Updated 5 years ago
• gaurav16gupta / BLISS
  Large Scale Search Index
  ☆31Updated last year
• daochenzha / dreamshard
  [NeurIPS 2022] DreamShard: Generalizable Embedding Table Placement for Recommender Systems
  ☆29Updated 2 years ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆16Updated 2 years ago
• ahollocou / graph-streaming
  A streaming algorithm for graph clustering
  ☆12Updated 7 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• KarypisLab / PM4GNN
  Graph partitioning for distributed GNN training
  ☆13Updated 2 years ago
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 5 years ago
• HazyResearch / anchor-stability
  A study of the downstream instability of word embeddings
  ☆12Updated 2 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• nogrady / dynamo
  DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
  ☆28Updated 3 years ago
• Shekhale / gbnns_dim_red
  Reducing Dimensionality method for Nearest Neighbor Search
  ☆14Updated 4 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
• WPJiang / HWTL_SDU-ANNS
  ☆71Updated 3 months ago
• MassimoPerini / online-gnn-learning
  ☆13Updated 3 years ago
• locuslab / sdp_clustering
  ☆12Updated 4 years ago
• devinjdangelo / FastRec
  Generate and train embeddings with a graph neural network and deploy as an API in a few lines of code
  ☆9Updated 4 years ago
• young917 / www21-hyperlap
  WWW21 - How Do Hyperedges Overlap
  ☆16Updated last year