Alternatives and similar repositories for dataset-call-graph-blogpost-material:

Users that are interested in dataset-call-graph-blogpost-material are comparing it to the libraries listed below

• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 4 years ago
• annamalai-nr / subgraph2vec_tf
  This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper
  ☆26Updated 7 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 5 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆130Updated 4 years ago
• holderlb / Subdue
  The Subdue graph miner discovers highly-compressing patterns in an input graph.
  ☆40Updated 10 months ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆57Updated 2 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago
• annamalai-nr / subgraph2vec_gensim
  Contains the code (and working vm setup) for our KDD MLG 2016 paper titled: "subgraph2vec: Learning Distributed Representations of Rooted…
  ☆42Updated 7 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• y3nk0 / Graph-Based-TC
  Graph-based framework for text classification
  ☆24Updated 6 years ago
• daokunzhang / MetaGraph2Vec
  Code for PAKDD-2018 paper "MetaGraph2Vec: Complex Semantic Path Augmented Heterogeneous Network Embedding"
  ☆22Updated 6 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• williamleif / graphqembed
  Learning to query complex networks
  ☆116Updated 10 months ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆34Updated 6 years ago
• safreita1 / malnet-graph
  A large-scale database for graph representation learning
  ☆50Updated 2 years ago
• benedekrozemberczki / EgoSplitting
  A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).
  ☆84Updated 2 years ago
• mast-group / sequence-mining
  Probabilistic Sequence Mining
  ☆45Updated 7 years ago
• streaming-graphs / NOUS
  NOUS: Construction, Querying and Reasoning with Knowledge Graphs
  ☆71Updated 2 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 3 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 12 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 7 months ago
• binghuiwang / sybildetection
  Structure-based Sybil/Fake account/Spam detection in social networks
  ☆25Updated 3 years ago
• minjiyoon / KDD19-AnomRank
  Anomaly Detection in Dynamic Graphs
  ☆32Updated last year
• maxuewei2 / RiWalk
  Code for the ICDM 2019 Paper "RiWalk: Fast Structural Node Embedding via Role Identification".
  ☆14Updated 5 years ago
• iHeartGraph / Illuminati
  ☆16Updated 2 years ago
• benedekrozemberczki / LabelPropagation
  A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…
  ☆124Updated 2 years ago
• ZW-ZHANG / HOPE
  This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).
  ☆17Updated 6 years ago
• benedekrozemberczki / TADW
  An implementation of "Network Representation Learning with Rich Text Information" (IJCAI '15).
  ☆60Updated 2 years ago
• kykamath / streaming_lsh
  A project for clustering text streams using locality-sensitive hashing (LSH) in Python
  ☆26Updated 13 years ago
• dhivyaeswaran / sedanspot
  SedanSpot: Detecting Anomalies in Edge Streams
  ☆24Updated 6 years ago