Jokeren / gBoltLinks
gBolt--very fast implementation for gSpan algorithm in data mining
☆58Updated 4 years ago
Alternatives and similar repositories for gBolt
Users that are interested in gBolt are comparing it to the libraries listed below
Sorting:
- 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
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆204Updated 4 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Codes for TopPPR☆14Updated 6 years ago
- ☆143Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆159Updated last year
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).☆290Updated 3 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- ☆173Updated 6 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago
- This repository provides a reference implementation of struc2vec.☆392Updated 2 years ago
- Graph kernels☆56Updated 3 years ago
- ☆24Updated 3 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆175Updated 2 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated last year
- Large scale graph learning on a single machine.☆164Updated 5 months ago
- This repository contains the "tensorflow" implementation of our paper "graph2vec: Learning distributed representations of graphs".☆157Updated 7 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 2 months ago
- I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.☆24Updated 4 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- PyTorch Library for Low-Latency, High-Throughput Graph Learning on GPUs.☆301Updated last year
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago