Alternatives and similar repositories for PGD

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

• kfoynt / LocalGraphClustering
  ☆143Updated 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.
  ☆162Updated 4 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆131Updated 4 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 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
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated last year
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆204Updated 4 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆58Updated 4 years ago
• GemsLab / REGAL
  Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings
  ☆96Updated 4 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• snap-stanford / graphwave
  ☆173Updated 6 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated last month
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆174Updated 2 years ago
• FFrankyy / DrBC
  DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )
  ☆31Updated 4 years ago
• polinapolina / temporal-pagerank
  ☆13Updated 9 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆60Updated 5 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 8 months ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆354Updated last year
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 4 years ago
• xptree / NetMF
  Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
  ☆187Updated 5 years ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆52Updated 10 years ago
• TrustAGI-Lab / graph_datasets
  A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).
  ☆290Updated 3 years ago
• kunegis / konect-extr
  Network dataset extraction library – part of the KONECT project by Jérôme Kunegis, University of Namur
  ☆27Updated 2 years ago
• palash1992 / DynamicGEM
  ☆352Updated 5 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago