Skip to content

KNN 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 method finds the k nearest nodes by using the Euclidean distance between the vectors of features. The set of k nodes found is considered as an hyperedge. The proces 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