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
• nmonath / graphgrove
  A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and ne…
  ☆44Updated 2 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆50Updated 2 years ago
• tbonald / paris
  Hierarchical graph clustering
  ☆38Updated 6 years ago
• talwagner / fair_clustering
  ☆20Updated 5 years ago
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆14Updated last month
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆27Updated last year
• kfoynt / LocalGraphClustering
  ☆137Updated 4 years ago
• aaronmcdaid / Overlapping-NMI
  ☆52Updated 8 years ago
• GemsLab / KGist
  Knowledge Graph summarization for anomaly/error detection & completion (WebConf '20)
  ☆37Updated 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 2 years ago
• mwcvitkovic / Supervised-Learning-on-Relational-Databases-with-GNNs
  Code to reproduce the results in the paper Supervised Learning on Relational Databases with Graph Neural Networks.
  ☆62Updated 5 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated 11 months ago
• rsonthal / TreeRep
  Learning Tree structures and Tree metrics
  ☆23Updated 7 months ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆16Updated 8 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆130Updated 4 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 5 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
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• kijungs / densealert
  DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)
  ☆19Updated 5 months ago
• thelahunginjeet / pyrankagg
  pure python code for rank aggregation/voting
  ☆32Updated 3 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• moranbel / tdGraphEmbed
  ☆21Updated last year
• twitter-research / sign
  SIGN: Scalable Inception Graph Network
  ☆96Updated 4 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 5 years ago
• mperrot / ComparisonHC
  Python implementation of several comparison-based hierarchical clustering algorithms.
  ☆7Updated 2 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 6 months ago