Aghasemian / OptimalLinkPrediction
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
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆42Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Probabilistic generative model that incorporates both the topology of interactions and node attributes to extract overlapping communities…☆43Updated last year
- A Bayesian model+algorithm for community detection in bipartite networks☆57Updated 4 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆66Updated last year
- Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.☆26Updated 4 years ago
- A Python framework for generating multilayer networks with planted mesoscale structure.☆18Updated last year
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- A package for clustering of Signed Networks☆35Updated 4 years ago
- 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
- Software for "Configuration Models of Random Hypergraphs"☆28Updated 2 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆42Updated 6 years ago
- GND and GNDR network dismantling algorithm☆21Updated last year
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆14Updated 2 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆23Updated 2 years ago
- TILES: an algorithm for community discovery in dynamic social networks☆59Updated last year
- Code associated to the paper 'Simplicial models of social contagion' Nat. Commun. (2019)☆44Updated 3 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆86Updated 9 months ago
- Fast code for SIR on temporal networks☆25Updated 3 years ago
- Data and source code for the paper "How choosing random-walk model and network representation matters for flow-based community detection …☆11Updated 4 years ago
- A sparsity aware implementation of "Biological Network Comparison Using Graphlet Degree Distribution" (Bioinformatics 2007)☆26Updated 2 years ago
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 3 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 6 months ago
- Multiplex network package☆12Updated 6 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
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 3 years ago