benedekrozemberczki / FEATHER
The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models".
☆45Updated last year
Related projects ⓘ
Alternatives and complementary repositories for FEATHER
- code for the paper in NeurIPS 2019☆40Updated last year
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆45Updated last year
- Node Embeddings in Dynamic Graphs☆53Updated 2 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆60Updated 3 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆44Updated last year
- ☆30Updated last year
- SIGN: Scalable Inception Graph Network☆94Updated 4 years ago
- Deep Graph Mapper: Seeing Graphs through the Neural Lens☆54Updated last year
- Benchmark for Graph Embedding Methods☆47Updated 3 years ago
- Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018☆25Updated 4 years ago
- spectralembeddings is a python library which is used to generate node embeddings from Knowledge graphs using GCN kernels and Graph Autoe…☆65Updated 3 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 4 years ago
- The official PyTorch implementation of "Pathfinder Discovery Networks for Neural Message Passing" (WebConf '21)☆57Updated last year
- Official PyTorch implementation of "Towards Deeper Graph Neural Networks" [KDD2020]☆69Updated 2 years ago
- Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)☆24Updated last year
- Source code from the NeurIPS 2019 workshop article "Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks" (G. Salha, R…☆131Updated 4 years ago
- Fast graph-regularized matrix factorization☆20Updated last year
- Compute graph embeddings via Anonymous Walk Embeddings☆81Updated 6 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆81Updated 3 months ago
- SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance☆15Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆77Updated 2 months ago
- ☆21Updated 3 years ago
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆88Updated 4 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆120Updated 2 years ago
- From Random Walks to Transformer for Learning Node Embeddings (ECML-PKDD 2020) (In Pytorch and Tensorflow)☆41Updated 3 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆105Updated 7 months ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago