jihoonko / kdd20-mosso
Official source code for MoSSo, described in the paper Incremental Lossless Graph Summarization, Jihoon Ko*, Yunbum Kook* and Kijung Shin, KDD 2020.
☆15Updated 2 years ago
Alternatives and similar repositories for kdd20-mosso:
Users that are interested in kdd20-mosso are comparing it to the libraries listed below
- Source code for VLDB 2020 paper "Hypergraph Motifs: Concepts, Algorithms, and Discoveries."☆15Updated 9 months ago
- WWW21 - How Do Hyperedges Overlap☆16Updated last year
- ☆13Updated 4 years ago
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 4 years ago
- Handbook for Geometric Deep Learning with Intel Gaudi-v2 Devices☆21Updated 3 weeks ago
- Source code for ICDM 2022 paper "Set2Box: Similarity Preserving Representation Learning for Sets."☆14Updated 2 years ago
- Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"☆17Updated last year
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 4 months ago
- A graph benchmark library for heterophilic and heterogeneous graphs☆13Updated last month
- ☆13Updated 3 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Easy-to-use framework for graph continual learning with Python☆34Updated 5 months ago
- Official code for "Towards Better Utilzation of Multiple Views for Bundle Recommendation" (CIKM 24 Short)☆19Updated 3 months ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆16Updated 2 years ago
- Source code for KAIS (2023) paper "Temporal Hypergraph Motifs" and ICDM 2021 paper "THyMe+: Temporal Hypergraph Motifs and Fast Algorithm…☆12Updated 2 years ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆18Updated 3 years ago
- Source code for the paper UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks (IJCAI 2021).☆64Updated 3 years ago
- Hypergraph representation learning: Hypergraph Networks with Hyperedge Neurons.☆41Updated 4 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 8 months ago
- KDD23 - Classification of Edge-Dependent Labels of Nodes in Hypergraphs☆18Updated 8 months ago
- [NeurIPS 2021] Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods☆122Updated 2 years ago
- A Broader Picture of Random-walk Based Graph Embedding☆30Updated 3 years ago
- Local Community Detection in Multiple Netwrks☆14Updated last month
- ☆39Updated 4 years ago
- ☆42Updated 7 months ago
- An Empirical Evaluation of Temporal Graph Benchmark☆31Updated last year
- WWW22 - MiDaS: Representative Hypergraph Sampling☆12Updated 10 months ago
- Learning to Count Isomorphisms with Graph Neural Networks☆13Updated 2 years ago
- ☆57Updated 3 years ago
- Awesome Temporal Graph Learning is a collection of SOTA, novel temporal graph learning methods (papers, codes, and datasets).☆67Updated 5 months ago