JHL-HUST / HiCodeLinks
Hidden Community Detection in Social Networks
☆14Updated 4 years ago
Alternatives and similar repositories for HiCode
Users that are interested in HiCode are comparing it to the libraries listed below
Sorting:
- 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
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- In recent years, community detection has received increased attention thanks to its wide range of applications in many fields. While at f…☆14Updated 6 years ago
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- ☆40Updated last year
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆86Updated last year
- ☆352Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆69Updated last year
- An R package to identify strongly connected vertex-layer communities in multilayer networks.☆35Updated 7 years ago
- Easy link prediction tool☆142Updated 9 months ago
- A Bayesian model+algorithm for community detection in bipartite networks☆58Updated 4 years ago
- Network dataset extraction library – part of the KONECT project by Jérôme Kunegis, University of Namur☆27Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- A PyTorch implementation of ACM SIGKDD 2019 paper "Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks"☆399Updated last year
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Representation learning for link prediction within social networks☆352Updated 7 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- ☆12Updated 2 years ago
- Probabilistic generative model that incorporates both the topology of interactions and node attributes to extract overlapping communities…☆44Updated 2 years ago
- Implementation of "Overlapping Community Detection with Graph Neural Networks"☆168Updated 4 years ago
- 通过研究社交网络，从网络中提取拓扑结构特征，运用机器学习方法进行链路预测，比较了几种机器学习算法的预测精度。☆32Updated 8 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆24Updated 3 years ago
- ☆143Updated 4 years ago
- Implementation of the CTDNE algorithm.☆14Updated 6 years ago
- Python package for detecting core-periphery structure in networks.☆60Updated 3 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 2 years ago
- Representation learning on dynamic graphs using self-attention networks☆296Updated 2 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- The reference implementation of "Multi-scale Attributed Node Embedding". (Journal of Complex Networks 2021)☆175Updated 2 years ago