Alternatives and similar repositories for python-graph-clustering

Users that are interested in python-graph-clustering are comparing it to the libraries listed below

• benedekrozemberczki / EdMot
  An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
  ☆133Updated 2 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆174Updated 3 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆131Updated 4 years ago
• xgfs / node2vec-c
  node2vec implementation in C++
  ☆52Updated 5 years ago
• caesar0301 / graphsim
  Graph similarity algorithms based on NetworkX.
  ☆170Updated 5 years ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆52Updated 10 years ago
• mims-harvard / ohmnet
  OhmNet: Representation learning in multi-layer graphs
  ☆83Updated 4 years ago
• kfoynt / LocalGraphClustering
  ☆143Updated 4 years ago
• snap-stanford / snap-python
  SNAP Python code, SWIG related files
  ☆305Updated 3 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆60Updated 5 years ago
• snap-stanford / graphwave
  ☆173Updated 6 years ago
• snap-stanford / mambo
  ☆37Updated 7 years ago
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆174Updated 2 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated last year
• linhongseba / Temporal-Network-Embedding
  The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots
  ☆64Updated 7 years ago
• TuftsBCB / Walker
  Python implementation of Kohler et al.'s random walk with restart
  ☆29Updated 6 years ago
• vtraag / louvain-igraph
  Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.
  ☆249Updated 10 months ago
• benedekrozemberczki / diff2vec
  Reference implementation of Diffusion2Vec (Complenet 2018) built on Gensim and NetworkX.
  ☆126Updated 2 years ago
• thelahunginjeet / pyrankagg
  pure python code for rank aggregation/voting
  ☆32Updated 3 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
• snash4 / GAT2VEC
  embedding attributed graphs
  ☆57Updated 3 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 5 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• SkBlaz / py3plex
  Py3plex - A multilayer complex network visualization and analysis library in python3
  ☆165Updated 2 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• GGiecold-zz / Cluster_Ensembles
  A package for combining multiple partitions into a consolidated clustering. The combinatorial optimization problem of obtaining such a co…
  ☆74Updated 2 years ago
• vuptran / graph-representation-learning
  [DSAA 2018] Autoencoders for Link Prediction and Semi-Supervised Node Classification
  ☆256Updated 5 years ago
• mims-harvard / scikit-fusion
  scikit-fusion: Data fusion via collective latent factor models
  ☆148Updated last year
• benedekrozemberczki / DANMF
  A sparsity aware implementation of "Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection" (CIKM 2018).
  ☆207Updated 2 years ago