aponom84 / lpam-clusteringLinks
Overlapping Communities Detection in Network
☆13Updated 4 years ago
Alternatives and similar repositories for lpam-clustering
Users that are interested in lpam-clustering are comparing it to the libraries listed below
Sorting:
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆88Updated last year
- Implements the bigCLAM algorithm☆52Updated 5 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 3 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- Implementation of "Overlapping Community Detection with Graph Neural Networks"☆170Updated 5 years ago
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- ☆16Updated 2 years ago
- ☆144Updated 4 years ago
- TILES: an algorithm for community discovery in dynamic social networks☆60Updated last year
- Dynamic Network Analysis library☆112Updated last year
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 2 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Graph Neural Networks for Community Detection☆64Updated 5 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"☆58Updated 6 years ago
- Implementation of "BiMLPA: Community Detection in Bipartite Networks by Multi-Label Propagation"☆26Updated 5 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 3 years ago
- Software for "Configuration Models of Random Hypergraphs"☆29Updated 3 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆49Updated 2 years ago
- Fast (Personalized) PageRank Implementation☆69Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- The reference implementation of "Multi-scale Attributed Node Embedding". (Journal of Complex Networks 2021)☆176Updated 3 years ago
- Community Discovery Library☆407Updated last month
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 5 years ago
- Easy link prediction tool☆142Updated 11 months ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆61Updated 5 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆69Updated 2 years ago
- 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