stvdedal / gspan
graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
☆10Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for gspan
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- ☆23Updated 4 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 11 years ago
- Fast graph-regularized matrix factorization☆20Updated last year
- ☆16Updated 4 years ago
- C++ library for graph kernel and edit distance algorithm☆16Updated 6 years ago
- ☆8Updated 4 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- Multi-Graph Multi-Label Learning☆11Updated 6 years ago
- Bunch of aproximated graph edit distance algorithms.☆34Updated 6 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 6 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 6 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆9Updated 2 years ago
- 1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…☆14Updated 4 years ago
- ☆14Updated 3 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆57Updated last year
- ☆15Updated 4 years ago
- ☆8Updated 7 years ago
- Graph partitioning for distributed GNN training☆11Updated last year
- MPI based algorithm for detecting high centrality vertices in large graphs☆8Updated 10 years ago
- ☆12Updated 3 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆16Updated last year
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆30Updated 3 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 4 years ago
- Graph Neural Network☆19Updated 3 years ago
- DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)☆18Updated 3 weeks ago
- Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical ext…☆17Updated 6 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆15Updated 6 years ago
- ☆16Updated 8 years ago