KyuhanLee / SSumM
SSumM: Sparse Summarization of Massive Graphs
☆19Updated 4 years ago
Alternatives and similar repositories for SSumM:
Users that are interested in SSumM are comparing it to the libraries listed below
- ☆12Updated 3 years ago
- ☆12Updated 6 years ago
- (BESIDE) ``Bridge” Enhanced Signed Directed Network Embedding☆11Updated 6 years ago
- Source code for ICDM 2022 paper "Set2Box: Similarity Preserving Representation Learning for Sets."☆13Updated 2 years ago
- LEAP (Learning Edges by Aggregation of Paths)☆12Updated 11 months ago
- Official source code for MoSSo, described in the paper Incremental Lossless Graph Summarization, Jihoon Ko*, Yunbum Kook* and Kijung Shin…☆15Updated 2 years ago
- A PyTorch implementation of "SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling" paper, which appeared in …☆30Updated 3 years ago
- Deep Multi-Graph Clustering via Attentive Cross-Graph Association☆24Updated 4 years ago
- WWW21 - How Do Hyperedges Overlap☆16Updated 11 months ago
- ☆16Updated 8 years ago
- Graph Clustering with Embedding Propagation☆16Updated 5 years ago
- Local Community Detection in Multiple Netwrks☆14Updated 2 years ago
- Wasserstein Distance Graph Alignment☆22Updated 3 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 2 months ago
- Relation learning on content-rich diffusion networks☆12Updated 5 years ago
- ☆32Updated last year
- Code for the paper "Higher-order motif analysis in hypergraphs"☆26Updated 2 years ago
- ☆13Updated 3 years ago
- KDD23 - Classification of Edge-Dependent Labels of Nodes in Hypergraphs☆18Updated 6 months ago
- Implementation of SBM-meet-GNN☆22Updated 5 years ago
- the Implementation of "Structural Deep Embedding for Hyper-Networks"(AAA20I8)☆45Updated 5 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 6 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated 8 months ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆16Updated 6 years ago
- ☆11Updated 4 years ago
- ☆21Updated last year
- ☆14Updated last year
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 4 years ago