kunegis / konect-extrLinks
Network dataset extraction library – part of the KONECT project by Jérôme Kunegis, University of Namur
☆27Updated 2 years ago
Alternatives and similar repositories for konect-extr
Users that are interested in konect-extr are comparing it to the libraries listed below
Sorting:
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- ☆143Updated 4 years ago
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆86Updated last year
- 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.☆43Updated 6 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- Implementation of "Overlapping Community Detection with Graph Neural Networks"☆168Updated 4 years ago
- Local Community Detection in Multiple Netwrks☆15Updated 6 months ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- 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
- ☆352Updated 5 years ago
- The reference implementation of "Multi-scale Attributed Node Embedding". (Journal of Complex Networks 2021)☆175Updated 2 years ago
- tNodeEmbed☆79Updated 2 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆69Updated last year
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 2 years ago
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆24Updated 3 years ago
- ☆13Updated 9 years ago
- A PyTorch implementation of ACM SIGKDD 2019 paper "Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks"☆399Updated last year
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆134Updated 2 years ago
- TILES: an algorithm for community discovery in dynamic social networks☆60Updated last year
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆87Updated last year
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆14Updated 2 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…☆65Updated 3 years ago
- Easy link prediction tool☆142Updated 8 months ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆21Updated 6 years ago
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec☆187Updated 5 years ago