Few-shot learning (FSL) that acquires new knowledge with little supervision, attracts much attention due to expensive cost of data annotation. Various meta-learning methods have made a great progress for few-shot problem in image and text data. In reality, data samples are not independent but rich in link relations. Large amounts of data exists in the form of graph structure such as citation, social, and biological networks. However, FSL study on graph data is still in its infancy because of the obstacle on extracting meta-knowledge from a meta node classification task. Current research just simply combines the FSL methods experienced in computer vision with node representation models together, but ignores the effect of rich links among support and query nodes in few-shot meta-task. For this issue, we propose a novel Multi-Level Graph Relation Network (MuL-GRN) for the challenging few-shot node classification. MuL-GRN extracts node embeddings through the popular graph neural networks (GNNs). And it includes a relation learning module to mine the deep node relations from three views, namely node-level, global subgraph-level, and local subgraph-level relations. For any two nodes, the node-level relation is computed on their node embeddings, global subgraph-level relation is measured on their subgraph embeddings, and the local subgraph-level relation is mined according to the pairwise node comparison information in their subgraphs. The three-view relation vectors are fused together with an interesting relation fusion module, which measures the importance of relation vector for the current few-shot classification task automatically. Extensive experiments on five real datasets show that MuL-GRN significantly outperforms existing state-of-the-art methods by a large margin.

Handwritten Chinese Text Recognition (HCTR) is a challenging problem due to its high complexity. Previous methods based on over-segmentation, hidden Markov model (HMM) or long short-term memory recurrent neural network (LSTM-RNN) have achieved great success in recognition results. However, all of them, including over-segmentation based methods, are incompetent in accurate segmentation of single character. To solve this problem, we propose a fast and accurate fully convolutional network for end-to-end segmentation and recognition of handwritten Chinese text. Experiments on CASIA-HWDB datasets and ICDAR 2013 competition dataset show that our method achieves a competitive performance on recognition and produces great character segmentation results. Moreover, our model reaches a real-time speed of 70 fps, which is fast enough for various applications.