Alternatives and similar repositories for scc:

Users that are interested in scc are comparing it to the libraries listed below

• iesl / grinch
  Scalable Hierarchical Clustering with Tree Grafting
  ☆28Updated 2 years ago
• KyuhanLee / SSumM
  SSumM: Sparse Summarization of Massive Graphs
  ☆19Updated 4 years ago
• LJeub / LocalCommunities
  Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …
  ☆13Updated 6 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 4 months ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆49Updated last year
• mperrot / ComparisonHC
  Python implementation of several comparison-based hierarchical clustering algorithms.
  ☆7Updated 2 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆26Updated last year
• tbonald / paris
  Hierarchical graph clustering
  ☆38Updated 6 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆16Updated last year
• GTmac / FastRP
  Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"
  ☆56Updated 5 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆22Updated 5 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 2 years ago
• rsonthal / TreeRep
  Learning Tree structures and Tree metrics
  ☆23Updated 5 months ago
• asn32 / weighted-nmf
  wNMF: Weighted Non-Negative Matrix Factorization
  ☆15Updated last year
• lukasjf / contrastive-gnn-explanation
  ☆19Updated 2 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆40Updated 5 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 5 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 4 years ago
• tlancian / contrast-subgraph
  "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis
  ☆20Updated 2 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆129Updated 3 years ago
• urielsinger / tNodeEmbed
  tNodeEmbed
  ☆76Updated last year
• DavidMcDonald1993 / heat
  Reference implementation of the HEAT algorithm described in https://link.springer.com/chapter/10.1007/978-3-030-62362-3_4
  ☆11Updated last year
• fukien / BiANE
  Codes for our SIGIR'20 paper "BiANE: Bipartite Attributed Network Embedding".
  ☆12Updated 6 months ago
• AnryYang / APP
  The code of APP, Scalable Graph Embedding for Asymmetric Proximity. Zhou, Chang and Liu, Yuqiong and Liu, Xiaofei and Liu, Zhongyi and Ga…
  ☆10Updated 6 years ago
• talwagner / fair_clustering
  ☆20Updated 5 years ago
• louisabraham / fastnode2vec
  Fast and scalable node2vec implementation
  ☆90Updated last year