Alternatives and similar repositories for wmsketch:

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

• amplab / cyclades
  Cyclades
  ☆28Updated 7 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• optml / CoCoA
  ☆19Updated 7 years ago
• All-less / continuum
  A platform for online learning that curtails data latency and saves you cost.
  ☆47Updated 3 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆30Updated 5 years ago
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• edoliberty / streaming-quantiles
  Implements the Karnin-Lang-Liberty (KLL) algorithm in python
  ☆54Updated 2 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• rackingroll / ssh
  ssh code
  ☆12Updated 7 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆100Updated 7 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• mitdbg / imputedb
  A database with automatic dynamic imputation of missing values.
  ☆11Updated 7 years ago
• ipsarros / DolphinnPy
  High-dimensional approximate nearest neighbor in python
  ☆11Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated last month
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• stanford-futuredata / Willump
  Willump Is a Low-Latency Useful Machine learning Platform.
  ☆44Updated 2 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆137Updated 8 years ago
• sfu-db / BOExplain
  Explaining Inference Queries with Bayesian Optimization
  ☆10Updated 4 years ago
• snap-stanford / ringo
  Next generation graph processing platform
  ☆12Updated 8 years ago
• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 7 years ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆86Updated last week
• M-Flash / m-flash-cpp
  ☆15Updated 7 years ago
• alexgittens / alchemist
  Alchemist: an Apache Spark<->MPI interface
  ☆26Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• takuti / stream-anomaly-detect
  Implementation of algorithms proposed by [Huang and Kasiviswanathan]
  ☆16Updated 8 years ago