Alternatives and similar repositories for affinity-propagation-sparse:

Users that are interested in affinity-propagation-sparse are comparing it to the libraries listed below

• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 6 years ago
• cran / fastcluster
   This is a read-only mirror of the CRAN R package repository. fastcluster — Fast Hierarchical Clustering Routines for R and 'Python'. Ho…
  ☆10Updated last year
• uci-cbcl / tree-hmm
  Tree hidden Markov model for learning epigenetic states in multiple cell types
  ☆28Updated 11 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• GuillaumeHolley / BlastGraph
  BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…
  ☆12Updated 11 years ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆23Updated 4 months ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆26Updated 5 years ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 4 years ago
• ratschlab / graph_annotation
  Code accompanying the publication for compressed graph annotation
  ☆13Updated 5 years ago
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 4 years ago
• bioinfo-cnb / bionmf-gpu
  NMF-mGPU web site:
  ☆26Updated 9 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 4 years ago
• joachimwolff / sparse-neighbors-search
  A python/c++ implementation of an approximate nearest neighbor search for sparse data structures based on the idea of local sensitiv hash…
  ☆10Updated last year
• dali-ml / dali-cython
  Dali in Python
  ☆8Updated 8 years ago
• QData / GaKCo-SVM
  ECML16: GaKCo: a Fast Gapped k-mer string Kernel using Counting
  ☆14Updated 5 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 3 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• xgfs / node2vec-c
  node2vec implementation in C++
  ☆52Updated 4 years ago
• claesenm / resvm
  Robust Ensemble of SVMs
  ☆21Updated 10 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• jssong-lab / maxEnt
  ☆11Updated 7 years ago
• YeWenting / sGLMM
  Implementation for sGLMM (Sparse graph-structured linear mixed model)
  ☆15Updated last year
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆43Updated 3 years ago
• evison / LMF
  Code for paper: Localized matrix factorization for recommendation based on matrix block diagonal forms
  ☆10Updated 10 years ago
• ebattenberg / nmf-cuda
  A CUDA implementation of non-negative matrix factorization for GPUs.
  ☆34Updated 6 years ago
• travisbrady / py-soft-impute
  Python implementation of Mazumder and Hastie's softImpute for matrix completion
  ☆45Updated 9 years ago
• djsutherland / skl-groups
  scikit-learn addon to operate on set/"group"-based features
  ☆41Updated 8 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• dib-lab / MQF
  ☆12Updated last year
• ParBLiSS / parconnect
  Computes graph connectivity for large graphs
  ☆11Updated 8 years ago