Aghasemian / OptimalLinkPredictionLinks
This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M. Airoldi, and Aaron Clauset. (arXiv:1909.07578)
☆66Updated last year
Alternatives and similar repositories for OptimalLinkPrediction
Users that are interested in OptimalLinkPrediction are comparing it to the libraries listed below
Sorting:
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- Probabilistic generative model that incorporates both the topology of interactions and node attributes to extract overlapping communities…☆43Updated last year
- Source code from the CIKM 2019 article "Gravity-Inspired Graph Autoencoders for Directed Link Prediction" by G. Salha, S. Limnios, R. Hen…☆45Updated last year
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- tNodeEmbed☆79Updated 2 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆67Updated last year
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆43Updated 4 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆87Updated 11 months ago
- Software for "Configuration Models of Random Hypergraphs"☆28Updated 3 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- A Bayesian model+algorithm for community detection in bipartite networks☆57Updated 4 years ago
- A package for clustering of Signed Networks☆37Updated 4 years ago
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.☆26Updated 4 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆24Updated 3 years ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆31Updated 3 years ago
- A Python framework for generating multilayer networks with planted mesoscale structure.☆18Updated 2 years ago
- Python code implementing a stable ensemble-based graph partition algorithm (ecg) and 11 graph-aware measures (gam) for comparing graph pa…☆30Updated last year
- Multiplex network package☆12Updated 6 years ago
- GND and GNDR network dismantling algorithm☆21Updated 2 years ago
- Benchmark for Graph Embedding Methods☆48Updated 4 years ago
- This page is a companion for our paper on overfitting and underfitting of community detection methods on real networks, written by Amir G…☆27Updated last year
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆14Updated 2 years ago
- Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"☆41Updated 6 years ago
- Implementation of the CTDNE algorithm.☆20Updated 6 years ago
- Repository of the paper "Machine learning dismantling and early-warning signals of disintegration in complex systems" by M. Grassia, M. D…☆41Updated 3 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆21Updated 6 years ago
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 4 years ago