返回
UniG-Encoder: A universal feature encoder for graph and hypergraph node classification
DOI:10.1016/j.patcog.2023.110115.png)
摘要
En 中文
Despite the decent performance and fruitful applications of Graph Neural Networks (GNNs), Hypergraph Neural Networks (HGNNs), and their well -designed variants, on some commonly used benchmark graphs and hypergraphs, they are outperformed by even a simple Multi -Layer Perceptron. This observation motivates a reexamination of the design paradigm of the current GNNs and HGNNs and poses challenges of extracting graph features effectively. In this work, a universal feature encoder for both graph and hypergraph representation learning is designed, called UniG-Encoder. The architecture starts with a forward transformation of the topological relationships of connected nodes into edge or hyperedge features via a normalized projection matrix. The resulting edge/hyperedge features, together with the original node features, are fed into a neural network. The encoded node embeddings are then derived from the reversed transformation, described by the transpose of the projection matrix, of the network's output, which can be further used for tasks such as node classification. The designed projection matrix, encoding the graph features, is intuitive and interpretable. The proposed architecture, in contrast to the traditional spectral -based and/or message passing approaches, simultaneously and comprehensively exploits the node features and graph/hypergraph topologies in an efficient and unified manner, covering both heterophilic and homophilic graphs. Furthermore, a variant version, UniGEncoder II, is devised to leverage multi -hop node information. Extensive experiments are conducted and demonstrate the superior performance of the proposed framework on twelve representative hypergraph datasets and six real -world graph datasets, compared to the state-of-the-art methods. Our implementation is available online at https://github.com/MinhZou/UniG-Encoder.
Keyword:
Graph and hypergraph
Representation learning
Homophily and heterophily
Node classification
Feature projection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Temporal-Relational hypergraph tri-Attention networks for stock trend prediction
PATTERN RECOGNITION
IF7.6
Analysis and assessment of ship collision accidents using Fault Tree and Multiple Correspondence Analysis基于故障树和多重对应分析的船舶碰撞事故分析与评估

