Alternatives and similar repositories for parallel-louvain-modularity

Users that are interested in parallel-louvain-modularity 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
• usc-cloud / hadoop-louvain-community
  Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.
  ☆15Updated 9 years ago
• ExaScience / bpmf
  Julia and C++ implementations of Bayesian Probabilistic Matrix Factorization using Markov Chain Monte Carlo
  ☆57Updated last year
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 10 years ago
• xgfs / node2vec-c
  node2vec implementation in C++
  ☆52Updated 5 years ago
• derekgreene / dynamic-community
  Dynamic Community Finding
  ☆26Updated 7 years ago
• tbjohns / BlitzL1
  Fast, principled L1-regularized loss minimization
  ☆24Updated last year
• conradlee / network-community-benchmark
  For benchmaring community detection algorithms on social networks with meta-data
  ☆17Updated 10 years ago
• cuMF / cumf_sgd
  CUDA Matrix Factorization Library with Stochastic Gradient Descent (SGD)
  ☆71Updated 7 years ago
• yixuan / recosystem
  Recommender System Using Parallel Matrix Factorization
  ☆84Updated 2 years ago
• kunegis / konect-analysis
  Analysis of large complex network collections – part of the KONECT project by Jérôme Kunegis, University of Namur
  ☆7Updated 2 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 8 months ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• qcri / Arabesque
  Scalable Graph Mining
  ☆62Updated 2 years ago
• snap-stanford / snap-dev
  SNAP repository for Ringo
  ☆14Updated 7 years ago
• plofgren / bidirectional-random-walk
  Random Walk (Personalized PageRank) Algorithms for Large Graphs
  ☆73Updated 9 years ago
• arbenson / tensor-sc
  Tensor spectral clustering.
  ☆29Updated 7 years ago
• Lab41 / Circulo
  Community Detection Research Effort
  ☆79Updated 9 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 years ago
• Sotera / distributed-graph-analytics
  Distributed Graph Analytics (DGA) is a compendium of graph analytics written for Bulk-Synchronous-Parallel (BSP) processing frameworks su…
  ☆175Updated 6 years ago
• alexgittens / alchemist
  Alchemist: an Apache Spark<->MPI interface
  ☆26Updated 7 years ago
• Lab41 / survey-community-detection
  Market Survey: Community Detection
  ☆70Updated 8 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• xgfs / deepwalk-c
  DeepWalk implementation in C++
  ☆99Updated last year
• arbenson / higher-order-organization-julia
  Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".
  ☆40Updated 7 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• romain-fontugne / slpa_nx
  Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs
  ☆27Updated 3 years ago
• ryanrossi / dynamic-pagerank
  Dynamic PageRank
  ☆16Updated 9 years ago