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
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• GraphChi / graphchi-cpp
  GraphChi's C++ version. Big Data - small machine.
  ☆808Updated 6 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• plofgren / bidirectional-random-walk
  Random Walk (Personalized PageRank) Algorithms for Large Graphs
  ☆73Updated 9 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 10 years ago
• cuMF / cumf_sgd
  CUDA Matrix Factorization Library with Stochastic Gradient Descent (SGD)
  ☆71Updated 7 years ago
• xgfs / node2vec-c
  node2vec implementation in C++
  ☆53Updated 5 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• lqhl / PowerWalk
  Personalized PageRank (PPR) on GraphLab PowerGraph
  ☆15Updated 8 years ago
• romain-fontugne / slpa_nx
  Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs
  ☆27Updated 3 years ago
• cuMF / cumf_als
  CUDA Matrix Factorization Library with Alternating Least Square (ALS)
  ☆179Updated 7 years ago
• yixuan / recosystem
  Recommender System Using Parallel Matrix Factorization
  ☆84Updated 2 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• alihadian / ROLL
  ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks
  ☆11Updated 8 years ago
• Lab41 / survey-community-detection
  Market Survey: Community Detection
  ☆70Updated 8 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 10 months ago
• derekgreene / dynamic-community
  Dynamic Community Finding
  ☆26Updated 7 years ago
• cjlin1 / libmf
  ☆204Updated last year
• qcri / Arabesque
  Scalable Graph Mining
  ☆63Updated 2 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• premgopalan / svinet
  Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…
  ☆73Updated 4 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆55Updated 7 years ago
• ibayer / fastFM-core
  A short paper describing the library is available on arXiv.
  ☆65Updated 7 years ago
• vtraag / louvain-igraph
  Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.
  ☆249Updated 11 months ago
• xgfs / deepwalk-c
  DeepWalk implementation in C++
  ☆99Updated last year
• jdwilson4 / MultilayerExtraction
  An R package to identify strongly connected vertex-layer communities in multilayer networks.
  ☆35Updated 7 years ago