mlsanityData to 14 Oct 2026

Line Hypergraph Convolution Network: Applying Graph Convolution for Hypergraphs

arXiv 2002.03392 ↗First posted 9 Feb 2020cs.SI cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Network representation learning and node classification in graphs got significant attention due to the invent of different types graph neural networks. Graph convolution network (GCN) is a popular semi-supervised technique which aggregates attributes within the neighborhood of each node. Conventional GCNs can be applied to simple graphs where each edge connects only two nodes. But many modern days applications need to model high order relationships in a graph. Hypergraphs are effective data types to handle such complex relationships. In this paper, we propose a novel technique to apply graph convolution on hypergraphs with variable hyperedge sizes. We use the classical concept of line graph of a hypergraph for the first time in the hypergraph learning literature. Then we propose to use graph convolution on the line graph of a hypergraph. Experimental analysis on multiple real world network datasets shows the merit of our approach compared to state-of-the-arts.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 4; 2023: 1; 2024: 2; 2025: 1.

11 papers.