.png){kind=icon}
.png){kind=icon}
Return
I2HGNN: Iterative Interpretable HyperGraph Neural Network for semi-supervised classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2024.106929.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Learning on hypergraphs has garnered significant attention recently due to their ability to effectively represent complex higher-order interactions among multiple entities compared to conventional graphs. Nevertheless, the majority of existing methods are direct extensions of graph neural networks, and they exhibit noteworthy limitations. Specifically, most of these approaches primarily rely on either the Laplacian matrix with information distortion or heuristic message passing techniques. The former tends to escalate algorithmic complexity, while the latter lacks a solid theoretical foundation. To address these limitations, we propose a novel hypergraph neural network named I2HGNN, which is grounded in an energy minimization function formulated for hypergraphs. Our analysis reveals that propagation layers align well with the message-passing paradigm in the context of hypergraphs. I2HGNN achieves a favorable trade-off between performance and interpretability. Furthermore, it effectively balances the significance of node features and hypergraph topology across a diverse range of datasets. We conducted extensive experiments on 15 datasets, and the results highlight the superior performance of I2HGNN in the task of hypergraph node classification across nearly all benchmarking datasets.
Keywords:
Iterative algorithm
Hypergraph
Optimization
Classification
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W