Alternatives and similar repositories for significant-subgraph-mining

Users that are interested in significant-subgraph-mining are comparing it to the libraries listed below

• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 years ago
• stvdedal / gspan
  graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
  ☆11Updated 8 years ago
• shangjingbo1226 / ContrastSubgraphMining
  Contrast Subgraph Mining from Coherent Cores
  ☆13Updated 7 years ago
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆10Updated 3 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 5 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 6 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆51Updated 2 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆48Updated 4 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 4 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆60Updated 5 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 12 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆36Updated 6 years ago
• yangji9181 / RELEARN
  Relation learning on content-rich diffusion networks
  ☆12Updated 6 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• BorgwardtLab / MotiFiesta
  Approximate subgraph motif mining through learnable edge contraction.
  ☆13Updated last year
• LJeub / LocalCommunities
  Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …
  ☆13Updated 7 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• amazon-science / panrep
  ☆15Updated 3 years ago
• timvieira / hypergraphs
  Reference implementations of basic and advanced hypergraph algorithms.
  ☆49Updated last year
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• jajupmochi / py-graph
  ☆8Updated 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
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 4 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 7 months ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 5 years ago
• pankajk / Deep-Graph-Kernels
  Deep Graph Kernels
  ☆13Updated 9 years ago
• abojchevski / paican
  Implementation of "Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure".
  ☆24Updated 5 years ago