Alternatives and similar repositories for scoda

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

• GiulioRossetti / Eva
  Eva: Community Discovery for Labeled Graphs (networkx implementation)
  ☆14Updated 4 years ago
• GiulioRossetti / TILES
  TILES: an algorithm for community discovery in dynamic social networks
  ☆59Updated last year
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 8 years ago
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆96Updated 4 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• Lab41 / survey-community-detection
  Market Survey: Community Detection
  ☆70Updated 8 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆15Updated 8 years ago
• GiulioRossetti / DEMON
  DEMON: a local-first discovery method for overlapping communities.
  ☆35Updated last year
• PhilChodrow / hypergraph
  Software for "Configuration Models of Random Hypergraphs"
  ☆28Updated 3 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated last year
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• GiulioRossetti / f1-communities
  A novel approach to evaluate community detection algorithms on ground truth
  ☆22Updated 4 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• trueprice / python-graph-clustering
  A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…
  ☆94Updated 6 years ago
• GemsLab / REGAL
  Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings
  ☆95Updated 4 years ago
• Aghasemian / OptimalLinkPrediction
  This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…
  ☆66Updated last year
• benedekrozemberczki / EdMot
  An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
  ☆133Updated 2 years ago
• kfoynt / LocalGraphClustering
  ☆142Updated 4 years ago
• maxdan94 / LouvainNE
  Implementation of a scalable embedding method suggested in WSDM2020
  ☆12Updated 5 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 8 years ago
• muhanzhang / HyperLinkPrediction
  Code for "M. Zhang, Z. Cui, S. Jiang, and Y. Chen, Beyond Link Prediction: Predicting Hyperlinks in Adjacency Space, AAAI-2018".
  ☆21Updated 7 years ago
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆162Updated 4 years ago
• kijungs / densealert
  DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)
  ☆19Updated 7 months ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆14Updated 4 months ago