Alternatives and similar repositories for HypergraphFlowClustering:

Users that are interested in HypergraphFlowClustering are comparing it to the libraries listed below

• PhilChodrow / HypergraphModularity
  Code for generative hypergraph clustering via modularity-like objective functions.
  ☆22Updated 2 years ago
• yunbum-kook / icdm20-hyperff
  ☆13Updated 4 years ago
• manhtuando97 / KDD-20-Hypergraph
  Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"
  ☆31Updated 5 months ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆41Updated 6 years ago
• ferencberes / online-centrality
  Temporal Walk Based Centrality Metric for Graph Streams
  ☆14Updated 2 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆27Updated last year
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 3 years ago
• paulmorio / geo2dr
  Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.
  ☆45Updated last year
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• delta2323 / GB-GNN
  Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks
  ☆13Updated 4 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• uestc-lese / SPGRL
  ☆17Updated 2 years ago
• houchengbin / ABRW
  Attributed Biased Random Walks (ABRW) is an Attributed Network Embedding method
  ☆12Updated 3 years ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆19Updated 6 years ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 years ago
• sisaman / NPGLM
  Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks (TKDD 2019)
  ☆18Updated 3 years ago
• GraphZoom-iclr / GraphZoom
  ☆14Updated 2 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 5 months ago
• rctzeng / NeurIPS2020-SCG
  The code repository for Discovering Conflicting Groups in Signed Networks (NeurIPS 2020)
  ☆15Updated 3 years ago
• Graph-COM / SUREL_Plus
  [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.
  ☆17Updated last year
• iaciac / py-draw-simplicial-complex
  Draws a 2D simplicial complex from a list of simplices.
  ☆15Updated 5 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 5 years ago
• joshpxyne / deep-hyperedges
  New Algorithms for Learning on Hypergraphs
  ☆39Updated 3 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 4 years ago
• prathasah / random-modular-network-generator
  Generates random graphs with tunable strength of community structure
  ☆28Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• houchengbin / GloDyNE
  GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…
  ☆65Updated 3 years ago