Skip to content

KHop Lifting (Graph to Hypergraph)

Jump to bottom
Guillermo Bernárdez edited this page Mar 6, 2025 · 1 revision

For each node in the graph, the algorithm finds the set of nodes that are at most k connections away from the initial node. This set is then used to create an hyperedge. The process is repeated for all nodes in the graph.

Reference: Hypergraph Learning: Methods and Practices

Home | TopoTune | Structural Liftings

TopoTune

  • Defining GCCNs
  • Defining backbone models
  • Reproducing experiments

Structural Liftings

Clone this wiki locally