AntonioLonga / Egocentric-Temporal-Motifs-Miner-ETMM
Egocentric Temporal Motifs Miner
☆12Updated 3 years ago
Alternatives and similar repositories for Egocentric-Temporal-Motifs-Miner-ETMM:
Users that are interested in Egocentric-Temporal-Motifs-Miner-ETMM are comparing it to the libraries listed below
- ETNgen: A temporal graph generator based on Egocentric Temporal Motifs☆13Updated last year
- This repository holds code and other relevant files for the Learning on Graphs 2022 tutorial "Graph Rewiring: From Theory to Applications…☆55Updated 2 years ago
- GraphFramEx: a systematic evaluation framework for explainability methods on GNNs☆44Updated 11 months ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆29Updated 2 years ago
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆25Updated last year
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 4 months ago
- ☆20Updated 3 years ago
- A Note On Over-Smoothing for Graph Neural Network☆20Updated 4 years ago
- An Empirical Evaluation of Temporal Graph Benchmark☆31Updated last year
- Dynamic Graph Benchmark☆74Updated 2 years ago
- The official implementation of the Graph Barlow Twins method with the experimental pipeline☆30Updated last year
- Repository for the AAAI 2022 paper: Directed Graph Auto-Encoders☆18Updated 3 years ago
- A Data-Driven Graph Generative Model for Temporal Interaction Networks☆34Updated 2 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Code and data for the CIKM2021 paper "Learning Ideological Embeddings From Information Cascades"☆11Updated 3 years ago
- A Python Library for Machine Learning in Epidemic Data Modeling and Analysis☆39Updated last month
- Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)☆14Updated last year
- ☆12Updated 2 years ago
- The code repository for Discovering Conflicting Groups in Signed Networks (NeurIPS 2020)☆15Updated 3 years ago
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆14Updated 2 years ago
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆17Updated 8 months ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆34Updated 4 years ago
- Local Community Detection in Multiple Netwrks☆14Updated last month
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 3 years ago
- Collection of papers relating data-driven higher-order graph/networks researches.☆69Updated 2 years ago
- [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.☆19Updated 2 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- A curated list of publications and code about data augmentaion for graphs.☆64Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆41Updated 5 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 6 months ago