Feature-Attention Graph Convolutional Networks for Noise Resilient Learning

--Noise and inconsistency commonly exist in real-world information networks, due to inherent error-prone nature of human or user privacy concerns. T o date, tremendous efforts have been made to advance feature learning from networks, including the most recent Graph Convolutional Networks (GCN) or attention GCN, by integrating node content and topology structures. However, all existing methods consider networks as error-free sources and treat feature content in each node as independent and equally important to model node relations. The erroneous node content, combined with sparse features, provide essential challenges for existing methods to be used on real-world noisy networks. In this paper, we propose F A-GCN, a feature-attention graph convolution learning framework, to handle networks with noisy and sparse node content. T o tackle noise and sparse content in each node, F A-GCN first employs a long short-term memory (LSTM) network to learn dense representation for each feature. T o model interactions between neighboring nodes, a feature-attention mechanism is introduced to allow neighboring nodes learn and vary feature importance, with respect to their connections. By using spectral-based graph convolution aggregation process, each node is allowed to concentrate more on the most determining neighborhood features aligned with the corresponding learning task. I NTRODUCTION M ANY real-world applications involve knowledge mining and analysis from network or graph-based data such as citation networks, social networks, telecommunication networks, and biological networks, etc, where data are often collected from noisy channels with erroneous/inconsistent labels or features [1]. In order to carry out pattern mining from networks, such as community detection [2], node classification [3], link prediction [4], etc., network representation learning (or embedding learning) [5] is commonly used to construct features to represent nodes for learning.