kunegis / konect-extr
Network dataset extraction library – part of the KONECT project by Jérôme Kunegis, University of Namur
☆26Updated last year
Alternatives and similar repositories for konect-extr:
Users that are interested in konect-extr are comparing it to the libraries listed below
- Local Community Detection in Multiple Netwrks☆14Updated 2 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆124Updated 2 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated 9 months ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆27Updated 3 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated 8 months ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 6 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆65Updated 7 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆85Updated 6 months ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Dynamic graph/network dataset for dynamic graph/network embedding/representation☆34Updated 4 years ago
- This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…☆64Updated 10 months ago
- tNodeEmbed☆76Updated last year
- Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data☆46Updated 5 years ago
- Node Embeddings in Dynamic Graphs☆54Updated 3 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆161Updated 4 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆132Updated 2 years ago
- ☆137Updated 3 years ago
- TILES: an algorithm for community discovery in dynamic social networks☆59Updated 11 months ago
- The code of APP, Scalable Graph Embedding for Asymmetric Proximity. Zhou, Chang and Liu, Yuqiong and Liu, Xiaofei and Liu, Zhongyi and Ga…☆10Updated 6 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 3 months ago
- Source Code for IJCAI 2018 paper "Scalable Multiplex Network Embedding"☆74Updated 4 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆64Updated last year
- ☆51Updated 8 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆16Updated 6 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- source code for signed graph attention networks (ICANN2019) & SDGNN (AAAI2021)☆55Updated last year
- GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…☆65Updated 3 years ago