Alternatives and similar repositories for PGD:

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

• kfoynt / LocalGraphClustering
  ☆137Updated 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.
  ☆161Updated 4 years ago
• linhongseba / Temporal-Network-Embedding
  The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots
  ☆65Updated 7 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• polinapolina / temporal-pagerank
  ☆13Updated 8 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated 10 months ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆103Updated last year
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆82Updated 6 years ago
• snap-stanford / graphwave
  ☆172Updated 6 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆129Updated 3 years ago
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆56Updated 3 years ago
• dkaslovsky / GraphRole
  Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)
  ☆85Updated 7 months ago
• GTmac / HARP
  Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"
  ☆115Updated last year
• eXascaleInfolab / LFR-Benchmark_UndirWeightOvp
  Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…
  ☆83Updated last year
• palash1992 / DynamicGEM
  ☆348Updated 4 years ago
• kunegis / konect-extr
  Network dataset extraction library – part of the KONECT project by Jérôme Kunegis, University of Namur
  ☆26Updated last year
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• GemsLab / REGAL
  Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings
  ☆94Updated 3 years ago
• athomo / kcore
  ☆11Updated 7 years ago
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆175Updated last year
• adrian-lison / gnn-community-detection
  Graph Neural Networks for Community Detection
  ☆62Updated 5 years ago
• xptree / NetMF
  Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
  ☆185Updated 5 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 6 months ago
• shchur / overlapping-community-detection
  Implementation of "Overlapping Community Detection with Graph Neural Networks"
  ☆160Updated 4 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 5 months ago
• urielsinger / tNodeEmbed
  tNodeEmbed
  ☆77Updated 2 years ago
• nogrady / dynamo
  DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
  ☆27Updated 3 years ago
• luckiezhou / DynamicTriad
  Dynamic Network Embedding by Modeling Triadic Closure Process
  ☆138Updated 5 years ago