NaazS03 / cgSpan
Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
☆10Updated 3 years ago
Alternatives and similar repositories for cgSpan:
Users that are interested in cgSpan are comparing it to the libraries listed below
- Frequent subgraph mining using FFSM algorithm, C++☆10Updated 7 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆7Updated 9 years ago
- Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications☆11Updated 6 years ago
- A software for hypergraph and multi-way network analysis 🌐☆21Updated 2 weeks ago
- ☆18Updated 4 years ago
- Wasserstein Distance Graph Alignment☆22Updated 3 years ago
- ☆16Updated 8 years ago
- [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.☆17Updated last year
- GraphFramEx: a systematic evaluation framework for explainability methods on GNNs☆43Updated 9 months ago
- Dir-GNN is a machine learning model that enables learning on directed graphs.☆77Updated last year
- This repo contains the experiments performed for link prediction, multi-class classification and pairwise node classification task.☆10Updated 4 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- Implementation of the SPN model and the experiments from the LoG 2022 paper "Shortest Path Networks for Graph Property Prediction".☆25Updated last year
- Facilitating learning, using, and designing graph processing pipelines/models systematically.☆24Updated 2 years ago
- TIP: Tri-graph Interaction Propagation model for Polypharmacy Side Effect Prediction (GRL@NeurIPS, 2019)☆24Updated 2 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆19Updated 4 years ago
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 4 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆31Updated 4 years ago
- Official Code Repository for the paper "Graph Ordering Attention Networks"☆21Updated last year
- Graph Embedding via Frequent Subgraphs☆44Updated 4 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆16Updated last year
- ☆11Updated 5 years ago
- This repository holds code and other relevant files for the Learning on Graphs 2022 tutorial "Graph Rewiring: From Theory to Applications…☆54Updated 2 years ago
- Official implementation of MAG-GNN: an RL-boosted graph learning framework.☆16Updated last year
- Explanation method for Graph Neural Networks (GNNs)☆62Updated 2 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆23Updated 5 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆49Updated last year
- Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks☆73Updated 4 months ago
- Generating PGM Explanation for GNN predictions☆74Updated last year
- LEAP (Learning Edges by Aggregation of Paths)☆12Updated 11 months ago