wOOL / STSCLinks
Self-Tuning Spectral Clustering Python
☆36Updated 7 years ago
Alternatives and similar repositories for STSC
Users that are interested in STSC are comparing it to the libraries listed below
Sorting:
- Generalized Canonical Correlation Analysis☆51Updated 7 years ago
- Updated version of DCN☆86Updated 2 years ago
- Code for: Gradient-based Hierarchical Clustering using Continuous Representations of Trees in Hyperbolic Space. Nicholas Monath, Manzil Z…☆44Updated 5 years ago
- Toolbox for large scale subspace clustering☆177Updated 3 years ago
- Classifier based mutual information, conditional mutual information estimation; conditional independence testing☆34Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆101Updated 2 years ago
- A deep clustering algorithm. Code to reproduce results for our paper N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of …☆135Updated last year
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Robust Spectral Clustering. Implementation of "Robust Spectral Clustering for Noisy Data: Modeling Sparse Corruptions Improves Latent Emb…☆26Updated 5 years ago
- Hyperbolic Hierarchical Clustering.☆201Updated last year
- ☆96Updated 6 years ago
- Graph signal processing tutorial, presented at the GraphSiP summer school.☆76Updated 6 years ago
- A package for Multiple Kernel Learning in Python☆129Updated 2 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆47Updated 2 months ago
- Code for experimentation on graph scattering transforms☆30Updated 5 years ago
- This repository is an attempt to replicate the results for the paper: "Learning Deep Representations for Graph Clustering".☆21Updated 8 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆150Updated 3 years ago
- Lightweight Python library for in-memory matrix completion.☆107Updated 2 years ago
- A brief tutorial on the Wasserstein auto-encoder☆83Updated 6 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- ☆163Updated 8 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- A pytorch package for non-negative matrix factorization.☆240Updated 11 months ago
- Python package for graph-based clustering and semi-supervised learning☆94Updated 4 months ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- This repository tries to provide unsupervised deep learning models with Pytorch☆90Updated 7 years ago