Alternatives and similar repositories for PGD

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

• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆164Updated 5 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 3 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆108Updated last month
• linhongseba / Temporal-Network-Embedding
  The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots
  ☆64Updated 8 years ago
• polinapolina / temporal-pagerank
  ☆13Updated 9 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 7 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆103Updated 2 years ago
• snap-stanford / graphwave
  ☆173Updated 7 years ago
• palash1992 / DynamicGEM
  ☆357Updated 5 years ago
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆178Updated 2 years ago
• eXascaleInfolab / LFR-Benchmark_UndirWeightOvp
  Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…
  ☆86Updated 2 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆55Updated 8 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆366Updated last year
• benedekrozemberczki / MUSAE
  The reference implementation of "Multi-scale Attributed Node Embedding". (Journal of Complex Networks 2021)
  ☆181Updated 3 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 9 years ago
• dkaslovsky / GraphRole
  Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)
  ☆89Updated last year
• xptree / NetMF
  Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
  ☆186Updated 5 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆32Updated 5 years ago
• benedekrozemberczki / GraphWaveMachine
  A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".
  ☆189Updated 2 years ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆24Updated 7 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆214Updated 5 years ago
• Aghasemian / OptimalLinkPrediction
  This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…
  ☆66Updated last year
• TrustAGI-Lab / graph_datasets
  A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).
  ☆296Updated 3 years ago
• urielsinger / tNodeEmbed
  tNodeEmbed
  ☆79Updated 2 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆91Updated 5 years ago
• PhilChodrow / HypergraphModularity
  Code for generative hypergraph clustering via modularity-like objective functions.
  ☆26Updated 3 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆62Updated 4 years ago