Regularized Recovery by Multi-order Partial Hypergraph Total Variation

by   Ruyuan Qu, et al.

Capturing complex high-order interactions among data is an important task in many scenarios. A common way to model high-order interactions is to use hypergraphs whose topology can be mathematically represented by tensors. Existing methods use a fixed-order tensor to describe the topology of the whole hypergraph, which ignores the divergence of different-order interactions. In this work, we take this divergence into consideration, and propose a multi-order hypergraph Laplacian and the corresponding total variation. Taking this total variation as a regularization term, we can utilize the topology information contained by it to smooth the hypergraph signal. This can help distinguish different-order interactions and represent high-order interactions accurately.


page 1

page 2

page 3

page 4


The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited

Hypergraphs allow one to encode higher-order relationships in data and a...

Synthesis and analysis in total variation regularization

We generalize the bridge between analysis and synthesis estimators by El...

Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation

Social relations are often used to improve recommendation quality when u...

Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint

We study the problem of efficient exact partitioning of the hypergraphs ...

Learning on Hypergraphs with Sparsity

Hypergraph is a general way of representing high-order relations on a se...

Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) inte...

Hyperharmonic analysis for the study of high-order information-theoretic signals

Network representations often cannot fully account for the structural ri...