xgfs / NetLSDLinks
NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
☆61Updated 5 years ago
Alternatives and similar repositories for NetLSD
Users that are interested in NetLSD are comparing it to the libraries listed below
Sorting:
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- ☆144Updated 4 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Source code from the NeurIPS 2019 workshop article "Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks" (G. Salha, R…☆134Updated 5 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 5 months ago
- Graph Embedding via Frequent Subgraphs☆45Updated 5 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆120Updated 3 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆88Updated last year
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆49Updated 2 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆86Updated last year
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 2 years ago
- ☆173Updated 6 years ago
- A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".☆188Updated 2 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆177Updated 2 years ago
- A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).☆295Updated 3 years ago
- ☆97Updated 2 years ago
- Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018☆28Updated 5 years ago
- ☆362Updated last year
- Benchmark for Graph Embedding Methods☆48Updated 4 years ago
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆90Updated 5 years ago
- This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…☆66Updated last year
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- A graph matching library for Python☆208Updated last year
- A sparsity aware implementation of "Biological Network Comparison Using Graphlet Degree Distribution" (Bioinformatics 2007)☆26Updated 3 years ago