stvdedal / gspanLinks
graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
☆11Updated 8 years ago
Alternatives and similar repositories for gspan
Users that are interested in gspan are comparing it to the libraries listed below
Sorting:
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆64Updated 2 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆114Updated last year
- Implementation of Kernighan-Lin graph partitioning algorithm in Python☆50Updated 6 years ago
- ☆25Updated 4 years ago
- Bunch of aproximated graph edit distance algorithms.☆36Updated 7 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆51Updated 2 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 6 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 4 years ago
- Subgraph matching and isomorphisms in Python.☆28Updated 2 years ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆53Updated 3 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated 2 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆32Updated 7 years ago
- ☆24Updated 3 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆43Updated 2 years ago
- SGQuant: Squeezing the Last Bit on Graph Neural Networks with Specialized Quantization☆11Updated 4 years ago
- LazyGCN☆9Updated 4 years ago
- A curated list of awesome graph representation learning.☆69Updated 4 years ago
- ☆143Updated 4 years ago