Hypergraph Partitioning using Tensor Eigenvalue Decomposition

by   Deepak Maurya, et al.

Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities. In this work, we propose a novel approach for the partitioning of k-uniform hypergraphs. Most of the existing methods work by reducing the hypergraph to a graph followed by applying standard graph partitioning algorithms. The reduction step restricts the algorithms to capturing only some weighted pairwise interactions and hence loses essential information about the original hypergraph. We overcome this issue by utilizing the tensor-based representation of hypergraphs, which enables us to capture actual super-dyadic interactions. We prove that the hypergraph to graph reduction is a special case of tensor contraction. We extend the notion of minimum ratio-cut and normalized-cut from graphs to hypergraphs and show the relaxed optimization problem is equivalent to tensor eigenvalue decomposition. This novel formulation also enables us to capture different ways of cutting a hyperedge, unlike the existing reduction approaches. We propose a hypergraph partitioning algorithm inspired from spectral graph theory that can accommodate this notion of hyperedge cuts. We also derive a tighter upper bound on the minimum positive eigenvalue of even-order hypergraph Laplacian tensor in terms of its conductance, which is utilized in the partitioning algorithm to approximate the normalized cut. The efficacy of the proposed method is demonstrated numerically on simple hypergraphs. We also show improvement for the min-cut solution on 2-uniform hypergraphs (graphs) over the standard spectral partitioning algorithm.


page 1

page 2

page 3

page 4


Hyperedge Prediction using Tensor Eigenvalue Decomposition

Link prediction in graphs is studied by modeling the dyadic interactions...

Consistency of Spectral Hypergraph Partitioning under Planted Partition Model

Hypergraph partitioning lies at the heart of a number of problems in mac...

Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques

In a series of recent works, we have generalised the consistency results...

Hypergraph p-Laplacian: A Differential Geometry View

The graph Laplacian plays key roles in information processing of relatio...

Three hypergraph eigenvector centralities

Eigenvector centrality is a standard network analysis tool for determini...

K-SpecPart: A Supervised Spectral Framework for Multi-Way Hypergraph Partitioning Solution Improvement

State-of-the-art hypergraph partitioners follow the multilevel paradigm,...

Weighted Laplacian and Its Theoretical Applications

In this paper, we develop a novel weighted Laplacian method, which is pa...

Please sign up or login with your details

Forgot password? Click here to reset