mespadoto / proj-quant-eval
☆16Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for proj-quant-eval
- Wasserstein Weisfeiler-Lehman Graph Kernels☆77Updated 2 months ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆133Updated 5 years ago
- Python implementation of several comparison-based hierarchical clustering algorithms.☆7Updated 2 years ago
- Library of python functions for the analysis of hypergraphs.☆13Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Graphs clustering using kernel measures and estimators. Kernel KMeans, Spectral Clustering, Kernel Ward etc.☆18Updated 5 months ago
- Implementation of the CIKM-17 paper “MGAE: Marginalized Graph Autoencoder for Graph Clustering”☆28Updated 2 years ago
- A software for hypergraph and multi-way network analysis 🌐☆19Updated last week
- Cross Entropy Low-rank Logits for graph generation.☆18Updated 3 months ago
- ☆17Updated 3 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆92Updated 3 years ago
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 2 years ago
- Attraction-Repulsion Spectrum in Neighbor Embeddings☆30Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated last year
- paper code with respect to classification, clustering and etc.☆33Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- GLEE: Geometric Laplacian Eigenmap Embedding☆11Updated 4 years ago
- Source code accompanying the submission to EuroVis 2017☆29Updated 6 months ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Code for the paper "RWR-GAE: Random Walk Regularized Graph Auto Encoder"☆38Updated last year
- Symmetric NMF for graph clustering☆27Updated 6 years ago
- Generating PGM Explanation for GNN predictions☆73Updated last year
- ☆12Updated 4 years ago
- Data sets for multi-view learning.☆81Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated 11 months ago
- A package for computing Graph Kernels☆102Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆174Updated last year
- Discovering Polarized Communities in Signed Networks☆12Updated 5 years ago