mims-harvard / fastGNMFLinks
Fast graph-regularized matrix factorization
☆20Updated 2 years ago
Alternatives and similar repositories for fastGNMF
Users that are interested in fastGNMF are comparing it to the libraries listed below
Sorting:
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆49Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated 2 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".☆20Updated 5 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆43Updated 2 years ago
- Hypernetwork Knowledge Graph Embeddings☆53Updated 6 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆120Updated 2 years ago
- A curated list of awesome graph representation learning.☆69Updated 5 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆24Updated 6 years ago
- Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018☆28Updated 4 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- Source code from the NeurIPS 2019 workshop article "Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks" (G. Salha, R…☆134Updated 5 years ago
- Scalable Hierarchical Clustering with Tree Grafting☆28Updated 3 years ago
- Source code from the article "FastGAE: Scalable Graph Autoencoders with Stochastic Subgraph Decoding" by G. Salha, R. Hennequin, J.B. Rem…☆27Updated 3 years ago
- ☆31Updated 2 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- code for paper "Attributed Network Embedding via Subspace Discovery"☆21Updated 6 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆53Updated 5 years ago
- ☆12Updated 5 years ago
- ☆18Updated 3 years ago
- The source code of the paper "Understanding Graph Neural Networks from Graph Signal Denoising Perspectives"☆23Updated 5 years ago
- A sparsity aware implementation of "Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection" (CIKM 2018).☆206Updated 2 years ago
- Official Implementation of ICML 2019 Paper. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing; an…☆125Updated 6 years ago