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 4 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 3 months ago
- WWW21 - How Do Hyperedges Overlap☆16Updated last year
- (BESIDE) ``Bridge” Enhanced Signed Directed Network Embedding☆11Updated 6 years 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
- ☆16Updated 8 years ago
- Source code for VLDB 2020 paper "Hypergraph Motifs: Concepts, Algorithms, and Discoveries."☆15Updated 8 months ago
- Source code for ICDM 2022 paper "Set2Box: Similarity Preserving Representation Learning for Sets."☆14Updated 2 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆16Updated last year
- LEAP (Learning Edges by Aggregation of Paths)☆12Updated last year
- KDD23 - Classification of Edge-Dependent Labels of Nodes in Hypergraphs☆18Updated 7 months ago
- ☆12Updated 6 years ago
- WWW22 - MiDaS: Representative Hypergraph Sampling☆12Updated 9 months ago
- Code for "HINTS: Citation Time Series Prediction for New Publications via Dynamic Heterogeneous Information Network Embedding".☆12Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- Local Community Detection in Multiple Netwrks☆14Updated 2 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆31Updated 4 years ago
- [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.☆17Updated last year
- The code repository for Discovering Conflicting Groups in Signed Networks (NeurIPS 2020)☆15Updated 3 years ago
- Published as a journal paper at DAMI 2023☆14Updated last week
- ☆33Updated 5 years ago
- Python Implementation for Signed Random Walk with Restart (SRWR)☆8Updated 5 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 6 years ago
- Hypergraph representation learning: Hypergraph Networks with Hyperedge Neurons.☆41Updated 4 years ago
- Learning Topological Representation for Networks via Hierarchical Sampling☆12Updated 3 years ago
- A graph benchmark library for heterophilic and heterogeneous graphs☆13Updated 6 months ago
- Official Code Repository for the paper "Edge Representation Learning with Hypergraphs" (NeurIPS 2021)☆52Updated last year
- Robust Graph Clustering via Meta Weighting for Noisy Graphs (CIKM'23)☆8Updated last year
- The code of APP, Scalable Graph Embedding for Asymmetric Proximity. Zhou, Chang and Liu, Yuqiong and Liu, Xiaofei and Liu, Zhongyi and Ga…☆10Updated 6 years ago