返回
MobileGCN applied to low-dimensional node feature learning
DOI:10.1016/j.patcog.2020.107788.png)
摘要
En 中文
The idea of the paper concentrates on an iterative learning process in Graph Convolution Networks (GCNs) involved in two vital steps: one is a message propagation (message passing) step to aggregate neighboring node features via aggregators performed, and another is an encoding output step to encode node feature representations by using updaters. In our model, we propose a novel affinity-aware encoding as an updater in GCNs, which aggregates the neighboring nodes of a node while updating this node's features. By utilizing affinity values of our encoding, we order the neighboring nodes to determine the correspondence between encoding functions and the neighboring nodes. Furthermore, to explicitly reduce the model size, we propose a lightweight variant of our updater that integrates Depth-wise Separable Convolution (DSC) into it, namely Depth-wise Separable Graph Convolution (DSGC). Comprehensive experiments conducted on graph data demonstrate that our models' accuracy improved significantly for graphs of low-dimensional node features. Also, performed in the low-dimensional node feature space we provide state-of-the-art results on two metrics (Macro-f1 and Matthews correlation coefficient (MCC)). Besides, our models are robust when taking different low-dimensional feature selection strategies. (c) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Graph convolutional networks
Affinity-aware encoding
Updater
Depth-wise separable graph convolution
Low-Dimensional node features
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Topic-sensitive PageRank: A context-sensitive ranking algorithm for Web search主题敏感PageRank: 一种上下文敏感的Web搜索排序算法
Polyvinyl pyrrolidone regulated Co, N co-doped porous carbon for oxygen reduction reaction聚乙烯吡咯烷酮调控Co,N共掺杂多孔碳用于氧还原反应
Ionics
IF0
没有更多内容

