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:
- 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: Gradient-based Hierarchical Clustering using Continuous Representations of Trees in Hyperbolic Space. Nicholas Monath, Manzil Z…☆44Updated 5 years ago
- Robust Spectral Clustering. Implementation of "Robust Spectral Clustering for Noisy Data: Modeling Sparse Corruptions Improves Latent Emb…☆26Updated 5 years ago
- ☆42Updated 7 years ago
- Updated version of DCN☆86Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- ☆96Updated 6 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- Pytorch implementation of Improved Deep Embedded Clustering☆105Updated 6 years ago
- This is outdated -- New version: https://github.com/boyangumn/DCN-New☆94Updated 7 years ago
- Toolbox for large scale subspace clustering☆177Updated 3 years ago
- Generalized Canonical Correlation Analysis☆51Updated 7 years ago
- Unsupervised Network Embeddings for Graph Visualization, Clustering and Classification☆17Updated 5 years ago
- Poisson Matrix and Tensor Factorization with sparse input and internal representations☆16Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Python implementation of Robust Continuous Clustering☆107Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- ☆40Updated 2 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Implementation of Deep Soft-K means☆28Updated 4 years ago
- Hyperbolic Hierarchical Clustering.☆201Updated last year
- Hyperbolic PCA via Horospherical Projections☆71Updated last year
- Canonical Correlation Analysis, Variational CCA☆24Updated 6 years ago