First-Order Meta-Learning in Node Classification with Graph Convolutional Network

2021 ◽  
Author(s):  
Jing Cao ◽  
Yi Xu ◽  
Xuening Song
Keyword(s):  
Convolutional Network ◽  
First Order ◽  
Meta Learning ◽  
Node Classification

scholarly journals MR-GCN: Multi-Relational Graph Convolutional Networks based on Generalized Tensor Product

2020 ◽  
Author(s):  
Zhichao Huang ◽  
Xutao Li ◽  
Yunming Ye ◽  
Michael K. Ng
Keyword(s):  
Tensor Product ◽  
Convolution Operator ◽  
State Of The Art ◽  
Single Type ◽  
Convolutional Network ◽  
Convolutional Networks ◽  
Node Classification ◽  
Relational Graphs ◽  
Eigen Decomposition ◽  
Single Relation

Graph Convolutional Networks (GCNs) have been extensively studied in recent years. Most of existing GCN approaches are designed for the homogenous graphs with a single type of relation. However, heterogeneous graphs of multiple types of relations are also ubiquitous and there is a lack of methodologies to tackle such graphs. Some previous studies address the issue by performing conventional GCN on each single relation and then blending their results. However, as the convolutional kernels neglect the correlations across relations, the strategy is sub-optimal. In this paper, we propose the Multi-Relational Graph Convolutional Network (MR-GCN) framework by developing a novel convolution operator on multi-relational graphs. In particular, our multi-dimension convolution operator extends the graph spectral analysis into the eigen-decomposition of a Laplacian tensor. And the eigen-decomposition is formulated with a generalized tensor product, which can correspond to any unitary transform instead of limited merely to Fourier transform. We conduct comprehensive experiments on four real-world multi-relational graphs to solve the semi-supervised node classification task, and the results show the superiority of MR-GCN against the state-of-the-art competitors.

scholarly journals Variance-reduced First-order Meta-learning for Natural Language Processing Tasks

2021 ◽  
Author(s):  
Lingxiao Wang ◽  
Kevin Huang ◽  
Tengyu Ma ◽  
Quanquan Gu ◽  
Jing Huang
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
First Order ◽  
Meta Learning

scholarly journals Dual Self-Paced Graph Convolutional Network: Towards Reducing Attribute Distortions Induced by Topology

2019 ◽  
Author(s):  
Liang Yang ◽  
Zhiyang Chen ◽  
Junhua Gu ◽  
Yuanfang Guo
Keyword(s):  
Neural Networks ◽  
Learning Strategies ◽  
Convolutional Neural Networks ◽  
Training Process ◽  
Training Set ◽  
Convolutional Network ◽  
Attribute Information ◽  
Topology Information ◽  
Node Classification ◽  
The Impact

The success of graph convolutional neural networks (GCNNs) based semi-supervised node classification is credited to the attribute smoothing (propagating) over the topology. However, the attributes may be interfered by the utilization of the topology information. This distortion will induce a certain amount of misclassifications of the nodes, which can be correctly predicted with only the attributes. By analyzing the impact of the edges in attribute propagations, the simple edges, which connect two nodes with similar attributes, should be given priority during the training process compared to the complex ones according to curriculum learning. To reduce the distortions induced by the topology while exploit more potentials of the attribute information, Dual Self-Paced Graph Convolutional Network (DSP-GCN) is proposed in this paper. Specifically, the unlabelled nodes with confidently predicted labels are gradually added into the training set in the node-level self-paced learning, while edges are gradually, from the simple edges to the complex ones, added into the graph during the training process in the edge-level self-paced learning. These two learning strategies are designed to mutually reinforce each other by coupling the selections of the edges and unlabelled nodes. Experimental results of transductive semi-supervised node classification on many real networks indicate that the proposed DSP-GCN has successfully reduced the attribute distortions induced by the topology while it gives superior performances with only one graph convolutional layer.

scholarly journals Masked Graph Convolutional Network

2019 ◽  
Author(s):  
Liang Yang ◽  
Fan Wu ◽  
Yingkui Wang ◽  
Junhua Gu ◽  
Yuanfang Guo
Keyword(s):  
Supervised Classification ◽  
Label Propagation ◽  
Unstructured Data ◽  
Classification Methods ◽  
Convolutional Network ◽  
Node Attributes ◽  
Classification Tasks ◽  
Node Classification ◽  
Supervised Classification Methods ◽  
The Impact

Semi-supervised classification is a fundamental technology to process the structured and unstructured data in machine learning field. The traditional attribute-graph based semi-supervised classification methods propagate labels over the graph which is usually constructed from the data features, while the graph convolutional neural networks smooth the node attributes, i.e., propagate the attributes, over the real graph topology. In this paper, they are interpreted from the perspective of propagation, and accordingly categorized into symmetric and asymmetric propagation based methods. From the perspective of propagation, both the traditional and network based methods are propagating certain objects over the graph. However, different from the label propagation, the intuition ``the connected data samples tend to be similar in terms of the attributes", in attribute propagation is only partially valid. Therefore, a masked graph convolution network (Masked GCN) is proposed by only propagating a certain portion of the attributes to the neighbours according to a masking indicator, which is learned for each node by jointly considering the attribute distributions in local neighbourhoods and the impact on the classification results. Extensive experiments on transductive and inductive node classification tasks have demonstrated the superiority of the proposed method.

Multi-Initialization Graph Meta-Learning for Node Classification

2021 ◽  
Author(s):  
Feng Zhao ◽  
Donglin Wang ◽  
Xintao Xiang
Keyword(s):  
Meta Learning ◽  
Node Classification

scholarly journals Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification

2019 ◽  
Author(s):  
Fenyu Hu ◽  
Yanqiao Zhu ◽  
Shu Wu ◽  
Liang Wang ◽  
Tieniu Tan
Keyword(s):  
Receptive Field ◽  
Performance Improvement ◽  
Global Information ◽  
Convolutional Network ◽  
Network Mining ◽  
Convolutional Networks ◽  
Hierarchical Graph ◽  
Empirical Performance ◽  
Classification Tasks ◽  
Node Classification

Graph convolutional networks (GCNs) have been successfully applied in node classification tasks of network mining. However, most of these models based on neighborhood aggregation are usually shallow and lack the “graph pooling” mechanism, which prevents the model from obtaining adequate global information. In order to increase the receptive field, we propose a novel deep Hierarchical Graph Convolutional Network (H-GCN) for semi-supervised node classification. H-GCN first repeatedly aggregates structurally similar nodes to hyper-nodes and then refines the coarsened graph to the original to restore the representation for each node. Instead of merely aggregating one- or two-hop neighborhood information, the proposed coarsening procedure enlarges the receptive field for each node, hence more global information can be captured. The proposed H-GCN model shows strong empirical performance on various public benchmark graph datasets, outperforming state-of-the-art methods and acquiring up to 5.9% performance improvement in terms of accuracy. In addition, when only a few labeled samples are provided, our model gains substantial improvements.

Sign in / Sign up

Export Citation Format

Share Document