Alternatives and similar repositories for coveringLSH

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

• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 5 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• edoliberty / streaming-quantiles
  Implements the Karnin-Lang-Liberty (KLL) algorithm in python
  ☆58Updated 3 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆100Updated 7 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 6 years ago
• optml / CoCoA
  ☆18Updated 7 years ago
• premgopalan / hgaprec
  Scalable Recommendation with Hierarchical Poisson Factorization P Gopalan, JM Hofman, DM Blei UAI, 326-335
  ☆55Updated 10 years ago
• mast-group / sequence-mining
  Probabilistic Sequence Mining
  ☆46Updated 7 years ago
• mast-group / itemset-mining
  Probabilistic Itemset Mining
  ☆19Updated 9 years ago
• ajbc / spf
  Social Poisson Factorization
  ☆26Updated 6 years ago
• dmlc / experimental-mf
  cache-friendly multithread matrix factorization
  ☆90Updated 9 years ago
• FurongHuang / TensorDecomposition4TopicModeling
  ☆20Updated 8 years ago
• gregversteeg / discrete_sieve
  The information sieve for discrete variables.
  ☆36Updated 9 years ago
• botev / metadiff
  ☆11Updated 9 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 8 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 8 months ago
• blei-lab / DynamicPoissonFactorization
  Dynamic version of Poisson Factorization (dPF). dPF captures the changing interest of users and the evolution of items over time accordin…
  ☆48Updated 9 years ago
• mesuvash / pyrec
  ☆10Updated 9 years ago
• lateral / hyperplane-hasher
  Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.
  ☆30Updated 10 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• allentran / graph2vec
  Theano implementation of GloVe for graphs
  ☆47Updated 10 years ago
• SheffieldML / collab
  Collaborative filtering with the GP-LVM
  ☆25Updated 10 years ago
• dmarx / Topological-Anomaly-Detection
  Topological Anomaly Detection (TAD) per Gartley and Basener 2009
  ☆68Updated 5 years ago
• Bollegala / svdmi
  Common pre-processing in NLP such as PPMI computation, SVD-based dimensionality reduction, and PLSR-based distribution prediction.
  ☆23Updated 7 years ago
• alkant / cpm
  Convex Polytope Machine
  ☆25Updated 10 years ago
• gingsmith / cocoa
  communication-efficient distributed coordinate ascent
  ☆90Updated 6 years ago
• napsternxg / deepwalk_keras_igraph
  Reimplementation of deepwalk algorithm from https://github.com/phanein/deepwalk
  ☆38Updated 9 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• datamicroscopes / irm
  Infinite relational model (IRM) for datamicroscopes
  ☆14Updated 10 years ago