Alternatives and similar repositories for fastGNMF:

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

• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 5 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 3 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 4 years ago
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• locuslab / sdp_clustering
  ☆12Updated 4 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆49Updated last year
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 3 years ago
• qiangsiwei / poincare_embedding
  Poincaré Embedding
  ☆40Updated 7 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆47Updated 4 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆42Updated last year
• dferendo / RecommendationSystem
  ☆10Updated 4 years ago
• IBM / HOTT
  Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"
  ☆54Updated 5 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 4 years ago
• DEEP-PolyU / GraphRNA_KDD19
  Graph Recurrent Networks with Attributed Random Walks
  ☆28Updated last year
• sidak / context-mover-distance-and-barycenters
  Code accompanying our paper at AISTATS 2020
  ☆21Updated 4 years ago
• BorisMuzellec / EllipticalEmbeddings
  Python code for implementing embeddings in the Wasserstein space of elliptical distributions
  ☆11Updated 4 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• DavidMcDonald1993 / heat
  Reference implementation of the HEAT algorithm described in https://link.springer.com/chapter/10.1007/978-3-030-62362-3_4
  ☆11Updated last year
• yangji9181 / AutoPath
  The AutoPath pipeline for similarity modeling on heterogeneous networks with automatic path discovery
  ☆11Updated 5 years ago
• THUDM / eTrust
  Source code and dataset for TKDE 2019 paper “Trust Relationship Prediction in Alibaba E-Commerce Platform”
  ☆15Updated 5 years ago
• hongyuanmei / nce-mpp
  Source code for Noise-Contrastive Estimation for Multivariate Point Processes (NeurIPS 2020).
  ☆15Updated 4 years ago
• yangji9181 / RELEARN
  Relation learning on content-rich diffusion networks
  ☆12Updated 5 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆42Updated 5 years ago
• giannisnik / repset
  Rep the Set: Neural Networks for Learning Set Representations
  ☆28Updated 4 years ago
• sanghosuh / lens_nmf-matlab
  ☆12Updated 6 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆26Updated last year