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
• 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
• LJeub / LocalCommunities
  Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …
  ☆13Updated 6 years ago
• snap-stanford / MAG
  Programs for Microsoft Academic Graph
  ☆16Updated 8 years ago
• belizgunel / hyperE
  ☆32Updated 6 years ago
• stvdedal / gspan
  graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
  ☆11Updated 7 years ago
• snap-stanford / snap-dev
  SNAP repository for Ringo
  ☆14Updated 7 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 5 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 4 years ago
• ntumslab / AttriRank
  AttriRank - Unsupervised Ranking using Graph Structures and Node Attributes
  ☆22Updated 7 years ago
• myaooo / pysbrl
  Python Interface of the Scalable Bayesian Rule Lists
  ☆19Updated 5 years ago
• wangtongada / BOA
  Bayesian or-of-and
  ☆34Updated 3 years ago
• pankajk / Deep-Graph-Kernels
  Deep Graph Kernels
  ☆13Updated 9 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 3 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 8 years ago
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 8 years ago
• supriya-gdptl / STWalk
  Implementation of "STWalk: Learning Trajectory Representations in Temporal Graphs"
  ☆17Updated 7 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆15Updated 8 years ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆20Updated 5 years ago
• NC0DER / GraphOfDocs
  GraphOfDocs: Representing multiple documents as a single graph
  ☆18Updated 2 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• premgopalan / bnprec
  Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…
  ☆15Updated 10 years ago
• snap-stanford / mambo
  ☆37Updated 7 years ago
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• alshargi / Concept2vec
  Concept2vec Metrics for Evaluating Quality of Embeddings for Ontological Concepts
  ☆14Updated 6 years ago
• timvieira / hypergraphs
  Reference implementations of basic and advanced hypergraph algorithms.
  ☆47Updated last year
• timtadh / parsemis
  The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…
  ☆44Updated 5 years ago
• sanghosuh / lens_nmf-matlab
  ☆12Updated 6 years ago