mperrot / ComparisonHCLinks
Python implementation of several comparison-based hierarchical clustering algorithms.
☆7Updated 3 years ago
Alternatives and similar repositories for ComparisonHC
Users that are interested in ComparisonHC are comparing it to the libraries listed below
Sorting:
- ☆55Updated 7 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- Implementations of label propagation like algorithms☆82Updated 8 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- wNMF: Weighted Non-Negative Matrix Factorization☆18Updated last year
- ☆143Updated 4 years ago
- Python code of Hilbert-Schmidt Independence Criterion☆87Updated 3 years ago
- Graph Signal Processing in Python☆510Updated 6 months ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- ☆314Updated 3 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆175Updated 2 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Lightweight Python library for in-memory matrix completion.☆107Updated 2 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆60Updated 5 years ago
- Discovering Polarized Communities in Signed Networks☆13Updated 5 years ago
- Learning Discrete Structures for Graph Neural Networks (TensorFlow implementation)☆197Updated last year
- Graph kernels☆56Updated 3 years ago
- Mixed Membership Stochastic Blockmodel Implementation with 3 Inference Schemes☆24Updated 10 years ago
- A sparsity aware implementation of "Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection" (CIKM 2018).☆207Updated 2 years ago
- Theano-based implementation of Deep Semi-NMF.☆117Updated 9 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 11 months ago
- Learning Deep Representations for Graph Clustering Implementation☆20Updated 6 years ago
- ☆19Updated 2 years ago
- Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)☆25Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Python implementation of Newman's spectral methods to maximize modularity.☆46Updated 6 years ago
- ☆14Updated 3 years ago
- learning point processes by means of optimal transport and wasserstein distance☆54Updated 7 years ago