Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Artificial Intelligence and Robotics
Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi
Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) emerge as a powerful family of representation learning models on graphs. To derive node representations, they utilize a global model that recursively aggregates information from the neighboring nodes. However, different nodes reside at different parts of the graph in different local contexts, making their distributions vary across the graph. Ideally, how a node receives its neighborhood information should be a function of its local context, to diverge from the global GNN model shared by all nodes. To utilize node locality without overfitting, we propose a node-wise localization of GNNs by accounting for both global and local …
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Research Collection School Of Computing and Information Systems
Semi-supervised node classification on graphs is an important research problem, with many real-world applications in information retrieval such as content classification on a social network and query intent classification on an e-commerce query graph. While traditional approaches are largely transductive, recent graph neural networks (GNNs) integrate node features with network structures, thus enabling inductive node classification models that can be applied to new nodes or even new graphs in the same feature space. However, inter-graph differences still exist across graphs within the same domain. Thus, training just one global model (e.g., a state-of-the-art GNN) to handle all new graphs, whilst …
Relative And Absolute Location Embedding For Few-Shot Node Classification On Graph, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. Hoi
Relative And Absolute Location Embedding For Few-Shot Node Classification On Graph, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Node 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 …