Alternatives and similar repositories for scoda:

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

• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• GiulioRossetti / Eva
  Eva: Community Discovery for Labeled Graphs (networkx implementation)
  ☆14Updated 3 years ago
• GiulioRossetti / TILES
  TILES: an algorithm for community discovery in dynamic social networks
  ☆59Updated last year
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 8 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• benmaier / tacoma
  Temporal networks in Python. Provides fast tools to analyze temporal contact networks and simulate dynamic processes on them using Gilles…
  ☆105Updated 4 years ago
• aaronmcdaid / Overlapping-NMI
  ☆52Updated 8 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated 11 months ago
• PhilChodrow / hypergraph
  Software for "Configuration Models of Random Hypergraphs"
  ☆28Updated 2 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
• GiulioRossetti / DEMON
  DEMON: a local-first discovery method for overlapping communities.
  ☆35Updated last year
• Aghasemian / CommunityFitNet
  This page is a companion for our paper on overfitting and underfitting of community detection methods on real networks, written by Amir G…
  ☆27Updated last year
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• Lab41 / Circulo
  Community Detection Research Effort
  ☆79Updated 9 years ago
• mapequation / mapping-hypergraphs
  Data and source code for the paper "How choosing random-walk model and network representation matters for flow-based community detection …
  ☆11Updated 4 years ago
• alexbovet / flow_stability
  Flow stability framework for dynamic community detection in temporal networks
  ☆24Updated 3 weeks ago
• prathasah / random-modular-network-generator
  Generates random graphs with tunable strength of community structure
  ☆28Updated 5 years ago
• egalimberti / span_cores
  Mining (maximal) Span-cores from Temporal Networks
  ☆13Updated 6 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆96Updated last year
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆96Updated 4 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆41Updated 6 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆15Updated 8 years ago
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆130Updated 4 years ago
• Lab41 / survey-community-detection
  Market Survey: Community Detection
  ☆70Updated 7 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• GiulioRossetti / f1-communities
  A novel approach to evaluate community detection algorithms on ground truth
  ☆22Updated 3 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated last year
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated last year
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆56Updated 3 years ago