Alternatives and similar repositories for LSH-community-detection

Users that are interested in LSH-community-detection are comparing it to the libraries listed below

• adityat / fastconsensus
  Fast consensus clustering in networks
  ☆22Updated 10 months ago
• ahollocou / multicom
  Multiple Local Community Detection
  ☆17Updated 7 years ago
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆56Updated 3 years ago
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 8 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 4 years ago
• MKLab-ITI / reveal-graph-embedding
  Implementation of community-based graph embedding for user classification.
  ☆27Updated 6 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated 2 years ago
• augustoqm / MCLRE
  Multi-Contextual Learning to Rank Events
  ☆23Updated 9 years ago
• MKLab-ITI / pygrank
  Recommendation algorithms for large graphs
  ☆28Updated 6 months ago
• Ivanopolo / modnet
  Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"
  ☆36Updated 5 years ago
• sisinflab / KGFlex
  Official implementation of the paper "Sparse Feature Factorization for Recommender Systems with Knowledge Graphs"
  ☆20Updated 2 years ago
• benedekrozemberczki / BoostedFactorization
  An implementation of "Multi-Level Network Embedding with Boosted Low-Rank Matrix Approximation" (ASONAM 2019).
  ☆36Updated 2 years ago
• maxuewei2 / RiWalk
  Code for the ICDM 2019 Paper "RiWalk: Fast Structural Node Embedding via Role Identification".
  ☆14Updated 5 years ago
• arangoml / fastgraphml
  Given an input graph (ArangoDB or PyG) it generates graph embeddings using Low-Code framework built on top of PyG.
  ☆68Updated last year
• IngoScholtes / kdd2018-tutorial
  Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data
  ☆46Updated 6 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆48Updated 4 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆15Updated 8 years ago
• benedekrozemberczki / EgoSplitting
  A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).
  ☆84Updated 2 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year
• GiulioRossetti / TILES
  TILES: an algorithm for community discovery in dynamic social networks
  ☆59Updated last year
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆131Updated 4 years ago
• benedekrozemberczki / FSCNMF
  An implementation of "Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks".
  ☆20Updated 2 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 6 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 5 years ago
• sisinflab / SEMAUTO-2.0
  Semantics-Aware Autoencoder Neural Network
  ☆16Updated 5 years ago
• uhh-lt / path2vec
  Learning to represent shortest paths and other graph-based measures of node similarities with graph embeddings
  ☆33Updated 5 years ago
• HKUST-KnowComp / Social-Explorative-Attention-Networks
  ☆14Updated 3 years ago
• xgfs / node2vec-c
  node2vec implementation in C++
  ☆52Updated 5 years ago