Alternatives and similar repositories for breaking_cycles_in_noisy_hierarchies

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

• caesar0301 / graphsim
  Graph similarity algorithms based on NetworkX.
  ☆170Updated 6 years ago
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆76Updated 3 years ago
• DerwenAI / disparity_filter
  Implements a disparity filter in Python, based on graphs in NetworkX, to extract the multiscale backbone of a complex weighted network (S…
  ☆36Updated 3 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆212Updated 5 years ago
• louisabraham / fastnode2vec
  Fast and scalable node2vec implementation
  ☆97Updated 2 years ago
• wdimmy / MeTeoR
  ☆22Updated last year
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 5 years ago
• RobRomijnders / bigclam
  Implements the bigCLAM algorithm
  ☆52Updated 6 years ago
• microsoft / dpu-utils
  Utilities used by the Deep Program Understanding team
  ☆104Updated 2 years ago
• meelgroup / MLIC
  A new framework to generate interpretable classification rules
  ☆18Updated 2 years ago
• OpenBioLink / SAFRAN
  Scalable and fast non-redundant rule application for link prediction
  ☆47Updated last year
• holderlb / Subdue
  The Subdue graph miner discovers highly-compressing patterns in an input graph.
  ☆41Updated last year
• VHRanger / CSRGraph
  A tiny library for larger graphs
  ☆119Updated last year
• xflr6 / concepts
  Formal Concept Analysis with Python
  ☆119Updated last month
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• IBM / pyflowgraph
  Flow graphs for Python
  ☆27Updated 3 years ago
• DatabaseGroup / apted
  APTED algorithm for the Tree Edit Distance
  ☆126Updated 7 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆60Updated 4 years ago
• timtadh / parsemis
  The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…
  ☆45Updated 5 years ago
• typilus / typilus
  Code for "Typilus: Neural Type Hints" PLDI 2020
  ☆62Updated 2 years ago
• JoaoFelipe / apted
  Python APTED algorithm for the Tree Edit Distance
  ☆99Updated 8 years ago
• benedekrozemberczki / Splitter
  A Pytorch implementation of "Splitter: Learning Node Representations that Capture Multiple Social Contexts" (WWW 2019).
  ☆212Updated 2 years ago
• microsoft / msrc-dpu-learning-to-represent-edits
  C# Data Extraction for "Learning to Represent Edits"
  ☆27Updated 7 years ago
• microsoft / graph-based-code-modelling
  Code for "Generative Code Modeling with Graphs" (ICLR'19)
  ☆172Updated 3 years ago
• zhenv5 / atp
  ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation
  ☆10Updated 6 years ago
• dselsam / neurosat
  NeuroSAT: Learning a SAT Solver from Single-Bit Supervision
  ☆289Updated 6 years ago
• srlearn / srlearn
  ☕ A Python library for gradient-boosted statistical relational models / learning probabilistic relational programs.
  ☆31Updated 3 years ago
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆57Updated 3 years ago
• google-research / python-graphs
  A static analysis library for computing graph representations of Python programs suitable for use with graph neural networks.
  ☆338Updated 2 years ago