Alternatives and similar repositories for frequent-directions

Users that are interested in frequent-directions are comparing it to the libraries listed below

• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆74Updated 3 years ago
• locuslab / sdp_clustering
  ☆12Updated 4 years ago
• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 7 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• flaviovdf / tribeflow
  TribeFlow's source code
  ☆32Updated 7 years ago
• premgopalan / bnprec
  Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…
  ☆15Updated 10 years ago
• Networks-Learning / mlss-2016
  MLSS 2016 material.
  ☆22Updated 9 years ago
• PurdueMINDS / JanossyPooling
  ☆26Updated 6 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 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
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 9 years ago
• huanzhang12 / hogwildpp
  HogWild++: A New Mechanism for Decentralized Asynchronous Stochastic Gradient Descent
  ☆33Updated 8 years ago
• xgfs / deepwalk-c
  DeepWalk implementation in C++
  ☆99Updated last year
• mahito-sugiyama / Legendre-decomposition
  Legendre decomposition for tensors
  ☆13Updated 6 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• wittawatj / kernel-gof
  NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.
  ☆67Updated 5 years ago
• offconvex / offconvex.github.io
  Off the convex path
  ☆67Updated 2 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 4 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆46Updated 5 years ago
• qiangsiwei / poincare_embedding
  Poincaré Embedding
  ☆40Updated 7 years ago
• edoliberty / frequent-directions-experiments
  Contains matrix sketching algorithms in python
  ☆16Updated 3 years ago
• risi-kondor / pMMF
  The pMMF Multiresolution Matrix Factorization Library
  ☆27Updated 7 years ago
• mblondel / projection-losses
  Python implementation of projection losses.
  ☆27Updated 5 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago