nveldt / HypergraphFlowClustering
☆12Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for HypergraphFlowClustering
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated last week
- ☆12Updated 3 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆22Updated 2 years ago
- Software relating to relational empirical risk minimization☆17Updated 3 years ago
- Dynamic PageRank☆16Updated 9 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- Source code for VLDB 2020 paper "Hypergraph Motifs: Concepts, Algorithms, and Discoveries."☆15Updated 5 months ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆15Updated 6 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 5 years ago
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆45Updated last year
- WWW21 - How Do Hyperedges Overlap☆16Updated 8 months ago
- ☆12Updated 3 years ago
- 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
- "Do We Need Anisotropic Graph Neural Networks?" at ICLR 2022☆32Updated 2 years ago
- Hypergraph representation learning: Hypergraph Networks with Hyperedge Neurons.☆39Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks (TKDD 2019)☆17Updated 2 years ago
- [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.☆19Updated last year
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆10Updated 5 years ago
- Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)☆24Updated last year
- Joint Community and Structural Hole Spanner Detection via Harmonic Modularity☆10Updated 6 years ago
- An Implementation of 1-Weisfeiler-Lehman Algorithm using Deep Graph Library☆9Updated 4 years ago
- [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.☆17Updated last year
- Temporal Walk Based Centrality Metric for Graph Streams☆14Updated last year
- Facilitating learning, using, and designing graph processing pipelines/models systematically.☆22Updated 2 years ago
- ☆12Updated 2 years ago
- Cross Entropy Low-rank Logits for graph generation.☆18Updated 3 months ago