Relative and Absolute Location Embedding for Few-Shot Node Classification on Graph
Keywords:Graph Mining, Social Network Analysis & Community
AbstractNode classification is an important problem on graphs. While recent advances in graph neural networks achieve promising performance, they require abundant labeled nodes for training. However, in many practical scenarios, there often exist novel classes in which only one or a few labeled nodes are available as supervision, known as few-shot node classification. Although meta-learning has been widely used in vision and language domains to address few-shot learning, its adoption on graphs has been limited. In particular, graph nodes in a few-shot task are not independent and relate to each other. To deal with this, we propose a novel model called Relative and Absolute Location Embedding (RALE) hinged on the concept of hub nodes. Specifically, RALE captures the task-level dependency by assigning each node a relative location within a task, as well as the graph-level dependency by assigning each node an absolute location on the graph to further align different tasks toward learning a transferable prior. Finally, extensive experiments on three public datasets demonstrate the state-of-the-art performance of RALE.
How to Cite
Liu, Z., Fang, Y., Liu, C., & Hoi, S. C. (2021). Relative and Absolute Location Embedding for Few-Shot Node Classification on Graph. Proceedings of the AAAI Conference on Artificial Intelligence, 35(5), 4267-4275. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16551
AAAI Technical Track on Data Mining and Knowledge Management