跳到主要导航 跳到搜索 跳到主要内容

iPool - Information-Based Pooling in Hierarchical Graph Neural Networks

  • Xing Gao
  • , Wenrui Dai*
  • , Chenglin Li
  • , Hongkai Xiong
  • , Pascal Frossard
  • *此作品的通讯作者
  • Shanghai Jiao Tong University
  • Swiss Federal Institute of Technology Lausanne

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

With the advent of data science, the analysis of network or graph data has become a very timely research problem. A variety of recent works have been proposed to generalize neural networks to graphs, either from a spectral graph theory or a spatial perspective. The majority of these works, however, focus on adapting the convolution operator to graph representation. At the same time, the pooling operator also plays an important role in distilling multiscale and hierarchical representations, but it has been mostly overlooked so far. In this article, we propose a parameter-free pooling operator, called iPool, that permits to retain the most informative features in arbitrary graphs. With the argument that informative nodes dominantly characterize graph signals, we propose a criterion to evaluate the amount of information of each node given its neighbors and theoretically demonstrate its relationship to neighborhood conditional entropy. This new criterion determines how nodes are selected and coarsened graphs are constructed in the pooling layer. The resulting hierarchical structure yields an effective isomorphism-invariant representation of networked data on arbitrary topologies. The proposed strategy achieves superior or competitive performance in graph classification on a collection of public graph benchmark data sets and superpixel-induced image graph data sets.

源语言英语
页(从-至)5032-5044
页数13
期刊IEEE Transactions on Neural Networks and Learning Systems
卷33
期9
DOI
出版状态已出版 - 1 9月 2022
已对外发布是

学术指纹

探究 'iPool - Information-Based Pooling in Hierarchical Graph Neural Networks' 的科研主题。它们共同构成独一无二的学术指纹。

引用此