arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.10751cs.LGcs.AIcs.ITcs.NEmath.IT

Understanding the Basis of Graph Convolutional Neural Networks via an Intuitive Matched Filtering Approach

University of Montenegro(黑山大学);Imperial College London(伦敦帝国理工学院)

Ljubisa Stankovic, Danilo Mandic

英文摘要:

Graph Convolutional Neural Networks (GCNN) are becoming a preferred model for data processing on irregular domains, yet their analysis and principles of operation are rarely examined due to the black box nature of NNs. To this end, we revisit the operation of GCNNs and show that their convolution layers effectively perform matched filtering of input data with the chosen patterns (features). This allows us to provide a unifying account of GCNNs through a matched filter perspective, whereby the nonlinear ReLU and max-pooling layers are also discussed within the matched filtering framework. This is followed by a step-by-step guide on information propagation and learning in GCNNs. It is also shown that standard CNNs and fully connected NNs can be obtained as a special case of GCNNs. A carefully chosen numerical example guides the reader through the various steps of GCNN operation and learning both visually and numerically.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑