Alternatives and similar repositories for fastGNMF:

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

• giannisnik / message_passing_graph_kernels
  ☆16Updated 4 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 3 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• satwik77 / libnmf
  Optimization and Regularization variants of Non-negative Matrix Factorization (NMF)
  ☆33Updated 6 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
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆30Updated 7 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• locuslab / sdp_clustering
  ☆12Updated 4 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
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆21Updated 5 years ago
• sanghosuh / lens_nmf-matlab
  ☆12Updated 6 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆30Updated last year
• ZW-ZHANG / TIMERS
  This is a sample implementation of "TIMERS: Error-Bounded SVD Restart on Dynamic Networks"(AAAI 2018).
  ☆12Updated 6 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 4 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆47Updated 4 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆26Updated last year
• uestc-lese / SPGRL
  ☆17Updated 2 years ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated last year
• DEEP-PolyU / GraphRNA_KDD19
  Graph Recurrent Networks with Attributed Random Walks
  ☆28Updated last year
• CheriseZhu / GSSNN
  The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".
  ☆20Updated 4 years ago
• abojchevski / paican
  Implementation of "Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure".
  ☆24Updated 4 years ago
• TUM-DAML / pprgo_tensorflow
  PPRGo model in TensorFlow 1, as proposed in "Scaling Graph Neural Networks with Approximate PageRank" (KDD 2020)
  ☆36Updated 2 years ago
• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆42Updated last year
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• HongyangGao / LGCN
  Tensorflow Implementation of Large-Scale Learnable Graph Convolutional Networks (LGCN) KDD18
  ☆46Updated 6 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆51Updated 4 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 5 years ago
• twitter-research / sign
  SIGN: Scalable Inception Graph Network
  ☆95Updated 4 years ago